PreprintCited by 85Advanced Proteomics Techniques and ApplicationsMass Spectrometry Techniques and ApplicationsBacterial Identification and Susceptibility Testing

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Fast open modification spectral library searching through approximate nearest neighbor indexing

Open access

Preprint — published as 10.1021/acs.jproteome.8b00359

Abstract

Open 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 at https://github.com/bittremieux/ANN-SoLo .

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1101/326173

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Flagged first, then by citations

Research works printed but not linked: 51

  1. 10.1002/pmic.200900502 · DOI
  2. 10.1021/pr200152g · DOI
  3. 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.
  4. 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.
  5. 10.1021/pr200074h · DOI
  6. 10.1074/mcp.M115.055103 · DOI
  7. 10.1002/widm.1074 · DOI
  8. 10.1007/978-3-642-41062-8_28 · DOI
  9. 10.1021/acs. jproteome.6b00988 · DOI
  10. 10.1074/mcp.M113.032813 · DOI
  11. 10.1101/285395 · DOI
  12. 10.1038/nbt.3267 · DOI
  13. 10.1002/pmic.200300744 · DOI
  14. 10.1002/pmic.200900375 · DOI
  15. 10.1093/nar/gkw936 · DOI
  16. 10.1101/282624 · DOI
  17. 10.1093/bioinformatics/btl645 · DOI
  18. 10.1038/nmeth1019 · DOI · Paper page
  19. 10.1021/pr070361e · DOI
  20. 10.4310/SII.2012.v5.n1.a5 · DOI
  21. 10.1074/mcp.O113.030189 · DOI
  22. 10.1021/acs.jproteome.5b00852 · DOI
  23. 10.1093/nar/gkw1062 · DOI · Paper page
  24. 10.1007/s13361-012-0516-6 · DOI
  25. 10.1002/pmic.201500296 · DOI
  26. 10.1038/nmeth.2343 · DOI
  27. 10.1038/nmeth.3902 · DOI
  28. 10. 1109/TPAMI.2010.57
  29. 10.1021/pr501173s · DOI
  30. 10.1038/nmeth.4256 · DOI
  31. 10.1002/pmic.200600625 · DOI · Paper page
  32. 10.1021/pr401006g · DOI
  33. 2016, Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs, arXiv:1603.09320 [cs] · arXiv
  34. 10.1021/pr500741y · DOI
  35. McKinney, W. “Data Structures for Statistical Computing in Python.” In: Proceedings of the 9th Python in Science Conference. Ed. by van der Walt, S. and Millman, J. Austin , Texas, USA, 2010, pp. 51–56. · DOI
  36. 10.1038/nmeth.3450 · DOI
  37. 10.1021/pr800127y · DOI
  38. 10.1038/sdata.2015.41 · DOI
  39. 10.1109/MCSE.2007.53 · DOI
  40. 10.1002/pmic.201400302 · DOI
  41. 10.1093/bioinformatics/btl118 · DOI
  42. 10.1002/pmic.200900326 · DOI
  43. 10.1074/mcp.M113.035550 · DOI
  44. 10.1002/mas.21512 · DOI
  45. 10.1074/mcp.R113.027797 · DOI
  46. 10.1016/1044-0305(94)87009-8 · DOI · Paper page
  47. 10.1109/MCSE.2011.37 · DOI · Paper page
  48. 10.1093/nar/gkv1145 · DOI
  49. 10.1021/pr401269z · DOI
  50. 10.1002/anie.200501023 · DOI
  51. 10.1093/bioinformatics/btq185 · DOI

Metadata

Authors
Bittremieux, W., Meysman, P., Noble, W. S., & Laukens, K.
Affiliations
  • University of Antwerp (BE)
  • University of Washington (US)
Corresponding author
  • Bittremieux, Wout
  • Laukens, Kris
Venue
Journal of Proteome Research
Publisher
openRxiv
Published
2018-05-19
Volume
17
Issue
10
Pages
3463-3474
ISSN
1535-3893 (ISSN-L)
OpenAlex
W2949278902
Cited by
85
References
1
Citations by year
2026: 9 · 2025: 7 · 2024: 8 · 2023: 11 · 2022: 10 · 2021: 17 · 2020: 8 · 2019: 11 · 2018: 3
FWCI
4.21
Type
journal article
Language
en
Open access
Licence
cc-by
Locations
  • Journal of Proteome Research (publishedVersion)
  • bioRxiv (Cold Spring Harbor Laboratory) (acceptedVersion, cc-by)
  • PubMed (publishedVersion)
  • PubMed Central (acceptedVersion)
  • Zenodo (CERN European Organization for Nuclear Research) (cc-by)
Funders
  • Belgian American Educational Foundation
  • Vlaams Supercomputer Centrum
  • Fonds Wetenschappelijk Onderzoek (12W0418N)
  • Vlaamse regering
  • National Institutes of Health
  • National Institute of Standards and Technology
  • National Institute of General Medical Sciences (R01GM121818)
Topics
  • Physical Sciences › Chemistry › Spectroscopy › Advanced Proteomics Techniques and Applications
  • Physical Sciences › Chemistry › Spectroscopy › Mass Spectrometry Techniques and Applications
  • Health Sciences › Medicine › Microbiology (medical) › Bacterial Identification and Susceptibility Testing
Keywords
spectral library search, peptide identification, modified peptides, false discovery rate control
MeSH terms
Algorithms, Humans, Peptides, Protein Processing, Post-Translational, Software, Time Factors, Reproducibility of Results, Peptide Library, Computational Biology, Databases, Protein, Proteomics, Tandem Mass Spectrometry, Search Engine, HEK293 Cells

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review