Skip Navigation


Bioinformatics Advance Access originally published online on September 28, 2004
Bioinformatics 2005 21(5):563-574; doi:10.1093/bioinformatics/bti044
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow All Versions of this Article:
21/5/563    most recent
bti044v1
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (11)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Yan, B.
Right arrow Articles by Xu, Y.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Yan, B.
Right arrow Articles by Xu, Y.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2005. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions{at}oupjournals.org

A graph-theoretic approach for the separation of b and y ions in tandem mass spectra

Bo Yan 1,2,{dagger}, Chongle Pan 3,4,{dagger}, Victor N. Olman 1,2, Robert L. Hettich 4 and Ying Xu 1,2,*

1 Computational Systems Biology Laboratory, Department of Biochemical and Molecular Biology, University of Georgia Athens, GA 30602, USA
2 Computational Biology Institute, University of Tennessee Oak Ridge, TN 37831, USA
3 Genome Science and Technology Graduate School, University of Tennessee Oak Ridge, TN 37831, USA
4 Organic and Biological Mass Spectrometry Group, Chemical Sciences Division, Oak Ridge National Laboratory Oak Ridge, TN 37831, USA

*To whom correspondence should be addressed.

Motivation: Ion-type identification is a fundamental problem in computational proteomics. Methods for accurate identification of ion types provide the basis for many mass spectrometry data interpretation problems, including (a) de novo sequencing, (b) identification of post-translational modifications and mutations and (c) validation of database search results.

Results: Here, we present a novel graph-theoretic approach for solving the problem of separating b ions from y ions in a set of tandem mass spectra. We represent each spectral peak as a node and consider two types of edges: type-1 edge connecting two peaks probably of the same ion types and type-2 edge connecting two peaks probably of different ion types. The problem of ion-separation is formulated and solved as a graph partition problem, which is to partition the graph into three subgraphs, representing b, y and others ions, respectively, through maximizing the total weight of type-1 edges while minimizing the total weight of type-2 edges within each partitioned subgraph. We have developed a dynamic programming algorithm for rigorously solving this graph partition problem and implemented it as a computer program PRIME (PaRtition of Ion types in tandem Mass spEctra). The tests on a large amount of simulated mass spectra and 19 sets of high-quality experimental Fourier transform ion cyclotron resonance tandem mass spectra indicate that an accuracy level of ~90% for the separation of b and y ions was achieved.

Availability: The executable code of PRIME is available upon request.

Contact: xyn{at}bmb.uga.edu


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
Brief BioinformHome page
B.-J. M. Webb-Robertson and W. R. Cannon
Current trends in computational inference from mass spectrometry-based proteomics
Brief Bioinform, September 1, 2007; 8(5): 304 - 317.
[Abstract] [Full Text] [PDF]



Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.