Chunmei Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Chunmei Liu has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Russell L. Malmberg
Department of Plant Biology, University of Georgia, Athens, GA 30602, USA
4 shared publications - Liming Cai
Department of Computer Science
3 shared publications - Yinglei Song
University of Georgia
3 shared publications Bo Yan
Department of Biochemistry and Molecular Biology, University of Georgia 2 2 Athens, GA 30602
2 shared publicationsLiming Cai
Department of Computer Science, University of Georgia 1 1 Athens, GA 30602
2 shared publicationsYing Xu
Department of Biochemistry and Molecular Biology, University of Georgia 2 2 Athens, GA 30602
2 shared publications
Latest Publications
- Open Access
- 15 July 2006
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 22 (14) , e307-e313
Peptide sequence tag-based blind identification of post-translational modifications with point process model
An important but difficult problem in proteomics is the identification of post-translational modifications (PTMs) in a protein. In general, the process of PTM identification by aligning experimental spectra with theoretical spectra from peptides in a peptide database is very time consuming and may lead to high false positive rate. In this paper, we introduce a new approach that is both efficient and effective for blind PTM identification. Our work consists of the following phases. First, we develop a novel tree decomposition based algorithm that can efficiently generate peptide sequence tags (PSTs) from an extended spectrum graph. Sequence tags are selected from all maximum weighted antisymmetric paths in the graph and their reliabilities are evaluated with a score function. An efficient deterministic finite automaton (DFA) based model is then developed to search a peptide database for candidate peptides by using the generated sequence tags. Finally, a point process model—an efficient blind search approach for PTM identification, is applied to report the correct peptide and PTMs if there are any. Our tests on 2657 experimental tandem mass spectra and 2620 experimental spectra with one artificially added PTM show that, in addition to high efficiency, our ab-initio sequence tag selection algorithm achieves better or comparable accuracy to other approaches. Database search results show that the sequence tags of lengths 3 and 4 filter out more than 98.3% and 99.8% peptides respectively when applied to a yeast peptide database. With the dramatically reduced search space, the point process model achieves significant improvement in accuracy as well. Availability: The software is available upon request. Contact: {chunmei,cai}@cs.uga.edu
- 15 July 2006
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 22 (14) , e307-e313
Open AccessPeptide sequence tag-based blind identification of post-translational modifications with point process model
An important but difficult problem in proteomics is the identification of post-translational modifications (PTMs) in a protein. In general, the process of PTM identification by aligning experimental spectra with theoretical spectra from peptides in a peptide database is very time consuming and may lead to high false positive rate. In this paper, we introduce a new approach that is both efficient and effective for blind PTM identification. Our work consists of the following phases. First, we develop a novel tree decomposition based algorithm that can efficiently generate peptide sequence tags (PSTs) from an extended spectrum graph. Sequence tags are selected from all maximum weighted antisymmetric paths in the graph and their reliabilities are evaluated with a score function. An efficient deterministic finite automaton (DFA) based model is then developed to search a peptide database for candidate peptides by using the generated sequence tags. Finally, a point process model—an efficient blind search approach for PTM identification, is applied to report the correct peptide and PTMs if there are any. Our tests on 2657 experimental tandem mass spectra and 2620 experimental spectra with one artificially added PTM show that, in addition to high efficiency, our ab-initio sequence tag selection algorithm achieves better or comparable accuracy to other approaches. Database search results show that the sequence tags of lengths 3 and 4 filter out more than 98.3% and 99.8% peptides respectively when applied to a yeast peptide database. With the dramatically reduced search space, the point process model achieves significant improvement in accuracy as well. Availability: The software is available upon request. Contact: {chunmei,cai}@cs.uga.edu
- 1 January 2006
- p. 99-110
Efficient annotation of non-coding RNA structures including pseudoknots via automated filters.
Computational search of genomes for RNA secondary structure is an important approach to the annotation of non-coding RNAs. The bottleneck of the search is sequence-structure alignment, which is often computationally intensive. A plausible solution is to devise effective filters that can efficiently remove segments unlikely to contain the desired structure patterns in the genome and to apply search only on the remaining portions. Since filters can be substructures of the RNA to be searched, the strategy to select which substructures to use as filters is critical to the overall search speed up. Such an issue becomes more involved when the structure contains pseudoknots; approaches that can filter pseudoknots are yet available. In this paper, a new effective filtration scheme is introduced to filter RNA pseudoknots. Based upon the authors' earlier work in tree-decomposable graph model for RNA pseudoknots, the new scheme can automatically derive a set of filters with the overall optimal filtration ratio. Search experiments on both synthetic and biological genomes showed that, with this filtration approach, RNA structure search can speed up 11 to 60 folds while maintaining the same search sensitivity and specificity of without the filtration. In some cases, the filtration even improves the specificity that is already high.
- 1 January 2006
- p. 99-110
Efficient annotation of non-coding RNA structures including pseudoknots via automated filters.
Computational search of genomes for RNA secondary structure is an important approach to the annotation of non-coding RNAs. The bottleneck of the search is sequence-structure alignment, which is often computationally intensive. A plausible solution is to devise effective filters that can efficiently remove segments unlikely to contain the desired structure patterns in the genome and to apply search only on the remaining portions. Since filters can be substructures of the RNA to be searched, the strategy to select which substructures to use as filters is critical to the overall search speed up. Such an issue becomes more involved when the structure contains pseudoknots; approaches that can filter pseudoknots are yet available. In this paper, a new effective filtration scheme is introduced to filter RNA pseudoknots. Based upon the authors' earlier work in tree-decomposable graph model for RNA pseudoknots, the new scheme can automatically derive a set of filters with the overall optimal filtration ratio. Search experiments on both synthetic and biological genomes showed that, with this filtration approach, RNA structure search can speed up 11 to 60 folds while maintaining the same search sensitivity and specificity of without the filtration. In some cases, the filtration even improves the specificity that is already high.
- 1 December 2005
- Published by World Scientific Pub Co Pte Ltd
- p. 255-266
FAST DE NOVO PEPTIDE SEQUENCING AND SPECTRAL ALIGNMENT VIA TREE DECOMPOSITION
De novo sequencing and spectral alignment are computationally important for the prediction of new protein peptides via tandem mass spectrometry (MS/MS). Both approaches are established upon the problem of finding the longest antisymmetric path on formulated graphs. The problem is of high computational complexity and the prediction accuracy is compromised when given spectra involve noisy data, missing mass peaks, or post translational modifications (PTMs) and mutations. This paper introduces a graphical mechanism to describe relationships among mass peaks that, through graph tree decomposition, yields linear and quadratic time algorithms for optimal de novo sequencing and spectral alignment respectively. Our test results show that, in addition to high efficiency, the new algorithms can achieve desired prediction accuracy on spectra containing noisy peaks and PTMs while allowing the presence of both b-ions and y-ions.
- 1 December 2005
- Published by World Scientific Pub Co Pte Ltd
- p. 255-266
FAST DE NOVO PEPTIDE SEQUENCING AND SPECTRAL ALIGNMENT VIA TREE DECOMPOSITION
De novo sequencing and spectral alignment are computationally important for the prediction of new protein peptides via tandem mass spectrometry (MS/MS). Both approaches are established upon the problem of finding the longest antisymmetric path on formulated graphs. The problem is of high computational complexity and the prediction accuracy is compromised when given spectra involve noisy data, missing mass peaks, or post translational modifications (PTMs) and mutations. This paper introduces a graphical mechanism to describe relationships among mass peaks that, through graph tree decomposition, yields linear and quadratic time algorithms for optimal de novo sequencing and spectral alignment respectively. Our test results show that, in addition to high efficiency, the new algorithms can achieve desired prediction accuracy on spectra containing noisy peaks and PTMs while allowing the presence of both b-ions and y-ions.
- 1 July 2005
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 20 (4) , 454-464
RNA Structural Homology Search with a Succinct Stochastic Grammar Model
- 1 July 2005
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 20 (4) , 454-464
RNA Structural Homology Search with a Succinct Stochastic Grammar Model
- 1 January 2005
- Published by Springer Nature in Lecture Notes in Computer Science
- Vol. 3515, 968-975
Profiling and Searching for RNA Pseudoknot Structures in Genomes
A new method is developed that can profile and efficiently search for pseudoknot structures in noncoding RNA genes. It profiles interleaving stems in pseudoknot structures with independent Covariance Model (CM) components. The statistical alignment score for searching is obtained by combining the alignment scores from all CM components. Our experiments show that the model can achieve excellent accuracy on both random and biological data. The efficiency achieved by the method makes it possible to search for the pseudoknot structures in genomes of a variety of organisms.
- 1 January 2005
- Published by Springer Nature in Lecture Notes in Computer Science
- Vol. 3515, 968-975
Profiling and Searching for RNA Pseudoknot Structures in Genomes
A new method is developed that can profile and efficiently search for pseudoknot structures in noncoding RNA genes. It profiles interleaving stems in pseudoknot structures with independent Covariance Model (CM) components. The statistical alignment score for searching is obtained by combining the alignment scores from all CM components. Our experiments show that the model can achieve excellent accuracy on both random and biological data. The efficiency achieved by the method makes it possible to search for the pseudoknot structures in genomes of a variety of organisms.
- 1 January 2005
- Published by Springer Nature in Lecture Notes in Computer Science
- Vol. 3680, 37-47
Profiling and Searching for RNA Pseudoknot Structures in Genomes
We developed a new method that can profile and efficiently search for pseudoknot structures in noncoding RNA genes. It profiles interleaving stems in pseudoknot structures with independent Covariance Model (CM) components. The statistical alignment score for searching is obtained by combining the alignment scores from all CM components. Our experiments show that the model can achieve excellent accuracy on both random and biological data. The efficiency achieved by the method makes it possible to search for structures that contain pseudoknot in genomes of a variety of organisms.
- 1 January 2005
- Published by Springer Nature in Lecture Notes in Computer Science
- Vol. 3680, 37-47
Profiling and Searching for RNA Pseudoknot Structures in Genomes
We developed a new method that can profile and efficiently search for pseudoknot structures in noncoding RNA genes. It profiles interleaving stems in pseudoknot structures with independent Covariance Model (CM) components. The statistical alignment score for searching is obtained by combining the alignment scores from all CM components. Our experiments show that the model can achieve excellent accuracy on both random and biological data. The efficiency achieved by the method makes it possible to search for structures that contain pseudoknot in genomes of a variety of organisms.