BACKGROUND: The identification of non-specifically cleaved peptides in proteomics and peptidomics poses a significant computational challenge. Current strategies for the identification of such peptides are typically time consuming and hinder routine data analysis. OBJECTIVE: We aimed to design an algorithm that would improve the speed of semi- and non-specific enzyme searches and could be applicable to existing search programs. METHOD: We developed a novel search algorithm that leverages fragment-ion redundancy to simultaneously search multiple non-specifically cleaved peptides at once. Briefly, a theoretical peptide tandem mass spectrum is generated using only the fragment-ion series from a single terminus. This spectrum serves as a proxy for several shorter theoretical peptides sharing the same terminus. After database searching, amino acids are removed from the opposing terminus until the observed and theoretical precursor masses match within a given mass tolerance. RESULTS: The algorithm was implemented in the search program MetaMorpheus and found to perform an order of magnitude faster than the traditional MetaMorpheus search and produce superior results. CONCLUSION: We report a speedy non-specific enzyme search algorithm which is open-source and enables search programs to utilize fragment-ion redundancy to achieve a notable increase in search speed.
BACKGROUND: The identification of non-specifically cleaved peptides in proteomics and peptidomics poses a significant computational challenge. Current strategies for the identification of such peptides are typically time consuming and hinder routine data analysis. OBJECTIVE: We aimed to design an algorithm that would improve the speed of semi- and non-specific enzyme searches and could be applicable to existing search programs. METHOD: We developed a novel search algorithm that leverages fragment-ion redundancy to simultaneously search multiple non-specifically cleaved peptides at once. Briefly, a theoretical peptide tandem mass spectrum is generated using only the fragment-ion series from a single terminus. This spectrum serves as a proxy for several shorter theoretical peptides sharing the same terminus. After database searching, amino acids are removed from the opposing terminus until the observed and theoretical precursor masses match within a given mass tolerance. RESULTS: The algorithm was implemented in the search program MetaMorpheus and found to perform an order of magnitude faster than the traditional MetaMorpheus search and produce superior results. CONCLUSION: We report a speedy non-specific enzyme search algorithm which is open-source and enables search programs to utilize fragment-ion redundancy to achieve a notable increase in search speed.
Authors: Joel M Chick; Deepak Kolippakkam; David P Nusinow; Bo Zhai; Ramin Rad; Edward L Huttlin; Steven P Gygi Journal: Nat Biotechnol Date: 2015-06-15 Impact factor: 54.908
Authors: Andy T Kong; Felipe V Leprevost; Dmitry M Avtonomov; Dattatreya Mellacheruvu; Alexey I Nesvizhskii Journal: Nat Methods Date: 2017-04-10 Impact factor: 28.547
Authors: Michael R Shortreed; Craig D Wenger; Brian L Frey; Gloria M Sheynkman; Mark Scalf; Mark P Keller; Alan D Attie; Lloyd M Smith Journal: J Proteome Res Date: 2015-09-29 Impact factor: 4.466
Authors: Chloe Chong; Fabio Marino; HuiSong Pak; Julien Racle; Roy T Daniel; Markus Müller; David Gfeller; George Coukos; Michal Bassani-Sternberg Journal: Mol Cell Proteomics Date: 2017-12-14 Impact factor: 5.911
Authors: Michael R Shortreed; Robert J Millikin; Lei Liu; Zach Rolfs; Rachel M Miller; Leah V Schaffer; Brian L Frey; Lloyd M Smith Journal: J Proteome Res Date: 2021-03-08 Impact factor: 4.466