Issue No. 02 - March/April (2012 vol. 9)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2011.59
S. Andreotti , Inst. fur Inf., Freie Univ. Berlin, Berlin, Germany
G. W. Klau , Life Sci. Group, CWI, Amsterdam, Netherlands
K. Reinert , Inst. fur Inf., Freie Univ. Berlin, Berlin, Germany
Peptide sequencing from mass spectrometry data is a key step in proteome research. Especially de novo sequencing, the identification of a peptide from its spectrum alone, is still a challenge even for state-of-the-art algorithmic approaches. In this paper, we present antilope, a new fast and flexible approach based on mathematical programming. It builds on the spectrum graph model and works with a variety of scoring schemes. ANTILOPE combines Lagrangian relaxation for solving an integer linear programming formulation with an adaptation of Yen's k shortest paths algorithm. It shows a significant improvement in running time compared to mixed integer optimization and performs at the same speed like other state-of-the-art tools. We also implemented a generic probabilistic scoring scheme that can be trained automatically for a data set of annotated spectra and is independent of the mass spectrometer type. Evaluations on benchmark data show that antilope is competitive to the popular state-of-the-art programs PepNovo and NovoHMM both in terms of runtime and accuracy. Furthermore, it offers increased flexibility in the number of considered ion types. ANTILOPE will be freely available as part of the open source proteomics library OpenMS.
Peptides, Amino acids, Databases, Algorithm design and analysis, Optimization, Heuristic algorithms, Computational biology,discrete optimization., Computational proteomics, de novo peptide sequencing, Lagrangian relaxation
S. Andreotti, G. W. Klau, K. Reinert, "Antilope—A Lagrangian Relaxation Approach to the de novo Peptide Sequencing Problem", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 9, no. , pp. 385-394, March/April 2012, doi:10.1109/TCBB.2011.59