Skip Navigation



Bioinformatics Advance Access published online on January 10, 2008
Bioinformatics, doi:10.1093/bioinformatics/btn011
This Article
Right arrow Advance Access manuscript (PDF) Freely available
Right arrow Supplementary Data
Right arrow All Versions of this Article:
24/5/674    most recent
btn011v1
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 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 arrowRequest Permissions
Google Scholar
Right arrow Articles by Khatun, J.
Right arrow Articles by Giddings, M. C.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Khatun, J.
Right arrow Articles by Giddings, M. C.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author (2008). Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Incorporating Sequence Information into the Scoring Function: A Hidden Markov Model for Improved Peptide Identification

Jainab Khatun 1, Eric Hamlett 1 and Morgan C. Giddings 1,2,3,*

1Department of Microbiology and Immunology
2Department of Biomedical Engineering
3Department of Computer Science University of North Carolina at Chapel Hill, Chapel Hill, NC 27599

*To whom correspondence should be addressed. Prof. Morgan C. Giddings, E-mail: giddings{at}unc.edu, giddings{at}med.unc.edu


  Abstract

Motivation: The identification of peptides by tandem mass spectrometry (MS/MS) is a central method of proteomics research, but due to the complexity of MS/MS data and the large databases searched, the accuracy of peptide identification algorithms remains limited. To improve the accuracy of identification we applied a machine-learning approach using a hidden Markov model (HMM) to capture the complex and often subtle links between a peptide sequence and its MS/MS spectrum.

Model: Our model, HMM_Score, represents ion types as HMM states and calculates the maximum joint probability for a peptide/spectrum pair using emission probabilities from three factors: the amino acids adjacent to each fragmentation site, the mass dependence of ion types, and the intensity dependence of ion types. The Viterbi algorithm is used to calculate the most probable assignment between ion types in a spectrum and a peptide sequence, then a correction factor added to account for the propensity of the model to favor longer peptides. An expectation value is calculated based on the model score to assess the significance of each peptide/spectrum match.

Results: We trained and tested HMM_Score on three data sets generated by two different mass spectrometer types. For a reference dataset recently reported in the literature and validated using five identification algorithms, HMM_Score produced 43% more positive identification results at a 1% false positive rate than the best of two other commonly used algorithms, Mascot and X!Tandem. HMM_Score is a highly accurate platform for peptide identification that works well for a variety of mass spectrometer and biological sample types.

Availability: The program is freely available on ProteomeCommons via an OpenSource license. See http://bioinfo.med.unc.edu/Downloads/ for the download link.

Associate Editor: Dr. Chris Stoeckert

Received on July 27, 2007; revised on January 4, 2008; accepted on January 4, 2008

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
 BioinformaticsHome page
M. R. Segal
On E-values for tandem MS scoring schemes
Bioinformatics, July 15, 2008; 24(14): 1652 - 1653.
[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.