Fast open modification spectral library searching through approximate nearest neighbor indexing

Author:

Bittremieux WoutORCID,Meysman PieterORCID,Noble William StaffordORCID,Laukens KrisORCID

Abstract

AbstractOpen modification searching (OMS) is a powerful search strategy that identifies peptides carrying any type of modification by allowing a modified spectrum to match against its unmodified variant by using a very wide precursor mass window. A drawback of this strategy, however, is that it leads to a large increase in search time. Although performing an open search can be done using existing spectral library search engines by simply setting a wide precursor mass window, none of these tools have been optimized for OMS, leading to excessive runtimes and suboptimal identification results. Here we present the ANN-SoLo tool for fast and accurate open spectral library searching. ANN-SoLo uses approximate nearest neighbor indexing to speed up OMS by selecting only a limited number of the most relevant library spectra to compare to an unknown query spectrum. This approach is combined with a cascade search strategy to maximize the number of identified unmodified and modified spectra while strictly controlling the false discovery rate, as well as a shifted dot product score to sensitively match modified spectra to their unmodified counterparts. ANN-SoLo achieves state-of-the-art performance in terms of speed and the number of identifications. On a previously published human cell line data set, ANN-SoLo confidently identifies more spectra than SpectraST or MSFragger and achieves a speedup of an order of magnitude compared to SpectraST.ANN-SoLo is implemented in Python and C++. It is freely available under the Apache 2.0 license athttps://github.com/bittremieux/ANN-SoLo.

Publisher

Cold Spring Harbor Laboratory

Reference68 articles.

1. How many human proteoforms are there?

2. Unrestricted identification of modified proteins using MS/MS

3. QuickMod: A Tool for Open Modification Spectrum Library Searches

4. Andoni, A. , Indyk, P. , Laarhoven, T. , Razenshteyn, I. , et al. “Practical and Optimal LSH for Angular Distance.” In: Proceedings of the 28th International Conference on Neural Information Processing Systems - NIPS ’15. Montreal, Canada: MIT Press, Dec. 7, 2015, pp. 1225–1233.

5. Aumüller, M. , Bernhardsson, E. , and Faithfull, A. “ANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithms.” In: Proceedings of the 10th International Conference on Similarity Search and Applications - SISAP ’17. Ed. by Beecks, C. , Borutta, F. , Kröger, P. , and Seidl, T. Vol. 10609. Munich, Germany: Springer International Publishing, Oct. 4, 2017, pp. 34–49.

Cited by 4 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3