Abstract
In the de novo peptide sequencing problem, output data from a tandem mass spectrometer are used to determine the peptide whose fragmentation yielded the output. Candidate peptides can be determined by finding forbidden-pairs paths in a spectrum graph constructed from the mass spectrometer data, assigning scores to vertices and/or edges in order to favor higher-scoring peptides. Chen et al. gave an algorithm to find the highest-scoring forbidden-pairs path in such a graph. However, in some scoring models, a vertex’s score may vary depending on which incident edges are used in the path containing the vertex, ruling out the use of this algorithm. We give an algorithm to solve the highest-scoring forbidden-pairs paths problem when vertex scores can vary depending on the incident edges used that runs in O(n 2 d 3) time on a graph with n forbidden pairs and a maximum vertex degree of d, and prove its correctness. We are currently working on a Java implementation of this algorithm that we plan on incorporating into the Illinois Bio-Grid Desktop.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bafna, V., Reinert, K.: Mass Spectrometry and Computational Proteomics. In: Encyclopedia of Genetics, Genomics, Proteomics and Bioinformatics, Wiley, Chichester (2005)
Chen, T., Kao, M.-Y., Tepel, M., Rush, J., Church, G.M.: A Dynamic Programming Approach to De Novo Peptide Sequencing via Tandem Mass Spectrometry. Journal of Computational Biology 8(3), 325–337 (2001)
Dancik, V., Adonna, T.A., Clauser, K.R., Vath, J.E., Pevzner, P.A.: De Novo Peptide Sequencing via Tandem Mass Spectrometry. Journal of Computational Biology 6(3/4), 327–342 (1999)
Fisher, B., Roth, V., Roos, F., Grossmann, J., Baginsky, S., Widmayer, P., Gruissem, W., Buhmann, J.M.: NovoHMM: A Hidden Markov Model for de Novo Peptide Sequencing. Analytic Chemistry 77, 7265–7273 (2005)
Frank, A., Pevzner, P.: PepNovo: De Novo Peptide Sequencing via Probabilistic Network Modeling. Analytical Chemistry 77, 964–973 (2005)
Kinter, M., Sherman, N.E.: Protein Sequencing and Identification Using Tandem Mass Spectrometry. Wiley-Interscience, Chichester (2000)
Lu, B., Chen, T.: Algorithms for de novo peptide sequencing using tandem mass spectrometry. Drug Discovery Today: BIOSILICO 2(2), 85–90 (2004)
Mo, L., Dutta, D., Wan, Y., Chen, T.: MSNovo: A Dynamic Programming Algorithm for de Novo Peptide Sequencing via Tandem Mass Spectrometry. Analytical Chemistry 79, 4870–4878 (2007)
Steele, A., Angulo, D.: The Illinois Bio-Grid: A Prototype for Industry-Academe Collaboration. In: Proceedings of the 2003 Midwest Software Engineering Conference (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goto, M.A., Schwabe, E.J. (2008). A Dynamic Programming Algorithm for De Novo Peptide Sequencing with Variable Scoring. In: Măndoiu, I., Sunderraman, R., Zelikovsky, A. (eds) Bioinformatics Research and Applications. ISBRA 2008. Lecture Notes in Computer Science(), vol 4983. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79450-9_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-79450-9_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79449-3
Online ISBN: 978-3-540-79450-9
eBook Packages: Computer ScienceComputer Science (R0)