Kaizhong Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Kaizhong Zhang has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Bin Ma
University of Western Ontario
2 shared publications - Gilles A. Lajoie
Department of Biochemistry, University of Western Ontario, London, Canada
2 shared publications - Jason T. L. Wang
Department of Computer and Information Science, New Jersey Institute of Technology, University Heights, Newark, NJ 07102, USA
2 shared publications - Zhewei Liang
Department of Computer Science, University of Western Ontario, London, Canada
2 shared publications - Ankur Malhotra
Division of Biological Sciences, University of California, San Diego, La Jolla, California 92093, USA
1 shared publication Bin Ma
School of Computer Science, University of Waterloo, Waterloo, Canada
1 shared publication
Latest Publications
- 1 October 2017
- Published by IGI Global Scientific Publishing in International Journal of Cognitive Informatics and Natural Intelligence
- Vol. 11 (4) , 41-65
NBPMF
Mass spectrometry (MS) is an analytical technique for determining the composition of a sample. In bottom-up techniques, peptide mass fingerprinting (PMF) is widely used to identify proteins from MS dataset. In this article, the authors developed a novel network-based inference software termed NBPMF. By analyzing peptide-protein bipartite network, they designed new peptide protein matching score functions. They present two methods: the static one, ProbS, is based on an independent probability framework; and the dynamic one, HeatS, depicts input data as dependent peptides. The authors also use linear regression to adjust the matching score according to the masses of proteins. In addition, they consider the order of retention time to further correct the score function. In post processing, a peak can only be assigned to one peptide in order to reduce random matches. Finally, the authors try to filter out false positive proteins. The experiments on simulated and real data demonstrate that their NBPMF approaches lead to significantly improved performance compared to several state-of-the-art methods.
- 1 October 2017
- Published by IGI Global Scientific Publishing in International Journal of Cognitive Informatics and Natural Intelligence
- Vol. 11 (4) , 41-65
NBPMF
Mass spectrometry (MS) is an analytical technique for determining the composition of a sample. In bottom-up techniques, peptide mass fingerprinting (PMF) is widely used to identify proteins from MS dataset. In this article, the authors developed a novel network-based inference software termed NBPMF. By analyzing peptide-protein bipartite network, they designed new peptide protein matching score functions. They present two methods: the static one, ProbS, is based on an independent probability framework; and the dynamic one, HeatS, depicts input data as dependent peptides. The authors also use linear regression to adjust the matching score according to the masses of proteins. In addition, they consider the order of retention time to further correct the score function. In post processing, a peak can only be assigned to one peptide in order to reduce random matches. Finally, the authors try to filter out false positive proteins. The experiments on simulated and real data demonstrate that their NBPMF approaches lead to significantly improved performance compared to several state-of-the-art methods.
- 5 May 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Vol. 16 (2) , 388-395
An Improved Approach for N-Linked Glycan Structure Identification from HCD MS/MS Spectra
Glycosylation is a frequently observed posttranslational modification on proteins. Currently, tandem mass spectrometry (MS/MS) serves as an efficient analytical technique for characterizing structures of oligosaccharides. However, developing effective computational approaches for identifying glycan structures from mass spectra is still a great challenge in glycoproteomics research. In this study, we proposed an approach for matching the input spectra with glycan structures acquired from a glycan structure database by incorporating a de novo sequencing assisted ranking scheme. The proposed approach is implemented as a software tool, GlycoNovoDB, for automated glycan structure identification from HCD MS/MS of glycopeptides. Experimental results showed that GlycoNovoDB can identify glycans effectively and has better performance than our previously proposed de novo sequencing algorithm as well as another software GlycoMaster DB.
- 5 May 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Vol. 16 (2) , 388-395
An Improved Approach for N-Linked Glycan Structure Identification from HCD MS/MS Spectra
Glycosylation is a frequently observed posttranslational modification on proteins. Currently, tandem mass spectrometry (MS/MS) serves as an efficient analytical technique for characterizing structures of oligosaccharides. However, developing effective computational approaches for identifying glycan structures from mass spectra is still a great challenge in glycoproteomics research. In this study, we proposed an approach for matching the input spectra with glycan structures acquired from a glycan structure database by incorporating a de novo sequencing assisted ranking scheme. The proposed approach is implemented as a software tool, GlycoNovoDB, for automated glycan structure identification from HCD MS/MS of glycopeptides. Experimental results showed that GlycoNovoDB can identify glycans effectively and has better performance than our previously proposed de novo sequencing algorithm as well as another software GlycoMaster DB.
- Open Access
- 23 December 2016
- Published by Springer Nature in BMC Bioinformatics
- Vol. 17 (S17) , 538-211
Spectra library assisted de novo peptide sequencing for HCD and ETD spectra pairs
De novo peptide sequencing via tandem mass spectrometry (MS/MS) has been developed rapidly in recent years. With the use of spectra pairs from the same peptide under different fragmentation modes, performance of de novo sequencing is greatly improved. Currently, with large amount of spectra sequenced everyday, spectra libraries containing tens of thousands of annotated experimental MS/MS spectra become available. These libraries provide information of the spectra properties, thus have the potential to be used with de novo sequencing to improve its performance. In this study, an improved de novo sequencing method assisted with spectra library is proposed. It uses spectra libraries as training datasets and introduces significant scores of the features used in our previous de novo sequencing method for HCD and ETD spectra pairs. Two pairs of HCD and ETD spectral datasets were used to test the performance of the proposed method and our previous method. The results show that this proposed method achieves better sequencing accuracy with higher ranked correct sequences and less computational time. This paper proposed an advanced de novo sequencing method for HCD and ETD spectra pair and used information from spectra libraries and significant improved previous similar methods.
- 23 December 2016
- Published by Springer Nature in BMC Bioinformatics
- Vol. 17 (S17) , 538-211
Open AccessSpectra library assisted de novo peptide sequencing for HCD and ETD spectra pairs
De novo peptide sequencing via tandem mass spectrometry (MS/MS) has been developed rapidly in recent years. With the use of spectra pairs from the same peptide under different fragmentation modes, performance of de novo sequencing is greatly improved. Currently, with large amount of spectra sequenced everyday, spectra libraries containing tens of thousands of annotated experimental MS/MS spectra become available. These libraries provide information of the spectra properties, thus have the potential to be used with de novo sequencing to improve its performance. In this study, an improved de novo sequencing method assisted with spectra library is proposed. It uses spectra libraries as training datasets and introduces significant scores of the features used in our previous de novo sequencing method for HCD and ETD spectra pairs. Two pairs of HCD and ETD spectral datasets were used to test the performance of the proposed method and our previous method. The results show that this proposed method achieves better sequencing accuracy with higher ranked correct sequences and less computational time. This paper proposed an advanced de novo sequencing method for HCD and ETD spectra pair and used information from spectra libraries and significant improved previous similar methods.
- Open Access
Pattern Matching and Local Alignment for RNA Structures
The primary structure of a ribonucleic acid (RNA) molecule can be represented as a sequence of nucleotides (bases) over the alphabet {A, C, G, U}. The secondary or tertiary structure of an RNA is a set of base pairs which form bonds between A-U and G-C. For secondary structures, these bonds have been traditionally assumed to be one-to-one and non-crossing. This paper considers pattern matching as well as local alignment between two RNA structures. For pattern matching, we present two algorithms, one for obtaining an exact match, the other for approximate match. We then present an algorithm for RNA local structural alignment.
Open AccessPattern Matching and Local Alignment for RNA Structures
The primary structure of a ribonucleic acid (RNA) molecule can be represented as a sequence of nucleotides (bases) over the alphabet {A, C, G, U}. The secondary or tertiary structure of an RNA is a set of base pairs which form bonds between A-U and G-C. For secondary structures, these bonds have been traditionally assumed to be one-to-one and non-crossing. This paper considers pattern matching as well as local alignment between two RNA structures. For pattern matching, we present two algorithms, one for obtaining an exact match, the other for approximate match. We then present an algorithm for RNA local structural alignment.
- 19 February 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Vol. 11 (2) , 398-406
Optimizing Spaced $k$-mer Neighbors for Efficient Filtration in Protein Similarity Search
Large-scale comparison or similarity search of genomic DNA and protein sequence is of fundamental importance in modern molecular biology. To perform DNA and protein sequence similarity search efficiently, seeding (or filtration) method has been widely used where only sequences sharing a common pattern or "seed" are subject to detailed comparison. Therefore these methods trade search sensitivity with search speed. In this paper, we introduce a new seeding method, called spaced k-mer neighbors, which provides a better tradeoff between the sensitivity and speed in protein sequence similarity search. With the method of spaced k-mer neighbors, for each spaced k-mer, a set of spaced k-mers is selected as its neighbors. These pre-selected spaced k-mer neighbors are then used to detect hits between query sequence and database sequences. We propose an efficient heuristic algorithm for the spaced neighbor selection. Our computational experimental results demonstrate that the method of spaced k-mer neighbors can improve the overall tradeoff efficiency over existing seeding methods.
- 19 February 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Vol. 11 (2) , 398-406
Optimizing Spaced $k$-mer Neighbors for Efficient Filtration in Protein Similarity Search
Large-scale comparison or similarity search of genomic DNA and protein sequence is of fundamental importance in modern molecular biology. To perform DNA and protein sequence similarity search efficiently, seeding (or filtration) method has been widely used where only sequences sharing a common pattern or "seed" are subject to detailed comparison. Therefore these methods trade search sensitivity with search speed. In this paper, we introduce a new seeding method, called spaced k-mer neighbors, which provides a better tradeoff between the sensitivity and speed in protein sequence similarity search. With the method of spaced k-mer neighbors, for each spaced k-mer, a set of spaced k-mers is selected as its neighbors. These pre-selected spaced k-mer neighbors are then used to detect hits between query sequence and database sequences. We propose an efficient heuristic algorithm for the spaced neighbor selection. Our computational experimental results demonstrate that the method of spaced k-mer neighbors can improve the overall tradeoff efficiency over existing seeding methods.
- 9 April 2013
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 27 (1) , 14-31
Algorithms for local similarity between forests
- 9 April 2013
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 27 (1) , 14-31
Algorithms for local similarity between forests
- 12 October 2012
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 27 (4) , 778-797
An improved algorithm for tree edit distance with applications for RNA secondary structure comparison
- 12 October 2012
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 27 (4) , 778-797
An improved algorithm for tree edit distance with applications for RNA secondary structure comparison
- Open Access
- 23 July 2012
- Published by World Scientific Pub Co Pte Ltd in Journal of Bioinformatics and Computational Biology
- Vol. 10 (04) , 1250001
A METHOD FOR DISCOVERING COMMON PATTERNS FROM TWO RNA SECONDARY STRUCTURES AND ITS APPLICATION TO STRUCTURAL REPEAT DETECTION
We propose an ab initio method, named DiscoverR, for finding common patterns from two RNA secondary structures. The method works by representing RNA secondary structures as ordered labeled trees and performs tree pattern discovery using an efficient dynamic programming algorithm. DiscoverR is able to identify and extract the largest common substructures from two RNA molecules having different sizes without prior knowledge of the locations and topologies of these substructures. We also extend DiscoverR to find repeated regions in an RNA secondary structure, and apply this extended method to detect structural repeats in the 3′-untranslated region of a protein kinase gene. We describe the biological significance of a repeated hairpin found by our method, demonstrating the usefulness of the method. DiscoverR is implemented in Java; a jar file including the source code of the program is available for download at http://bioinformatics.njit.edu/DiscoverR.
- 23 July 2012
- Published by World Scientific Pub Co Pte Ltd in Journal of Bioinformatics and Computational Biology
- Vol. 10 (04) , 1250001
Open AccessA METHOD FOR DISCOVERING COMMON PATTERNS FROM TWO RNA SECONDARY STRUCTURES AND ITS APPLICATION TO STRUCTURAL REPEAT DETECTION
We propose an ab initio method, named DiscoverR, for finding common patterns from two RNA secondary structures. The method works by representing RNA secondary structures as ordered labeled trees and performs tree pattern discovery using an efficient dynamic programming algorithm. DiscoverR is able to identify and extract the largest common substructures from two RNA molecules having different sizes without prior knowledge of the locations and topologies of these substructures. We also extend DiscoverR to find repeated regions in an RNA secondary structure, and apply this extended method to detect structural repeats in the 3′-untranslated region of a protein kinase gene. We describe the biological significance of a repeated hairpin found by our method, demonstrating the usefulness of the method. DiscoverR is implemented in Java; a jar file including the source code of the program is available for download at http://bioinformatics.njit.edu/DiscoverR.
- 7 March 2008
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 16 (3) , 293-306
A new quartet approach for reconstructing phylogenetic trees: quartet joining method
- 7 March 2008
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 16 (3) , 293-306
A new quartet approach for reconstructing phylogenetic trees: quartet joining method
- 4 March 2008
- Published by Springer Nature in Algorithmica
- Vol. 56 (2) , 270-280
On the Longest Common Rigid Subsequence Problem
- 4 March 2008
- Published by Springer Nature in Algorithmica
- Vol. 56 (2) , 270-280
On the Longest Common Rigid Subsequence Problem