An Algorithm to Improve the Speed of Semi and Non-Specific Enzyme Searches in Proteomics

一种提高蛋白质组学中半特异性和非特异性酶搜索速度的算法

阅读:1

Abstract

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.

特别声明

1、本页面内容包含部分的内容是基于公开信息的合理引用;引用内容仅为补充信息,不代表本站立场。

2、若认为本页面引用内容涉及侵权,请及时与本站联系,我们将第一时间处理。

3、其他媒体/个人如需使用本页面原创内容,需注明“来源:[生知库]”并获得授权;使用引用内容的,需自行联系原作者获得许可。

4、投稿及合作请联系:info@biocloudy.com。