The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Extremely Fast and Accurate Open Modification Spectral Library Searching of High-Resolution Mass Spectra Using Feature Hashing and Graphics Processing Units
Open accessPublished version of a preprint
Abstract
Open modification searching (OMS) is a powerful search strategy to identify peptides with any type of modification. OMS works by using a very wide precursor mass window to allow modified spectra to match against their unmodified variants, after which the modification types can be inferred from the corresponding precursor mass differences. A disadvantage of this strategy, however, is the large computational cost, because each query spectrum has to be compared against a multitude of candidate peptides. We have previously introduced 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. Here we demonstrate how this candidate selection procedure can be further optimized using graphics processing units. Additionally, we introduce a feature hashing scheme to convert high-resolution spectra to low-dimensional vectors. On the basis of these algorithmic advances, along with low-level code optimizations, the new version of ANN-SoLo is up to an order of magnitude faster than its initial version. This makes it possible to efficiently perform open searches on a large scale to gain a deeper understanding about the protein modification landscape. We demonstrate the computational efficiency and identification performance of ANN-SoLo based on a large data set of the draft human proteome. 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.
Integrity signals
Registry
Cites
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.
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
Billion-scale similarity search with GPUs
Johnson, J., Douze, M., & Jegou, H. (2021) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2019.2921572 · Cited by 4,228
When Is ''Nearest Neighbor'' Meaningful?
Beyer, K., Goldstein, J., Ramakrishnan, R., & Shaft, U. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49257-7_15 · Cited by 2,403
A draft map of the human proteome
Kim, M.-S., Pinto, S. M., Getnet, D., Nirujogi, R. S., Manda, S. S., Chaerkady, R., Madugundu, A. K., Kelkar, D. S., Isserlin, R., Jain, S., et al. (2014) · Nature · doi:10.1038/nature13302 · Cited by 2,198
How many human proteoforms are there?
Aebersold, R., Agar, J. N., Amster, I. J., Baker, M. S., Bertozzi, C. R., Boja, E. S., Costello, C. E., Cravatt, B. F., Fenselau, C., Garcia, B. A., et al. (2018) · Nature Chemical Biology · doi:10.1038/nchembio.2576 · Cited by 907
Flagged first, then by citations
Research works printed but not linked: 33
- 10.1002/mas.21544 · DOI
- 10.1002/pmic.200900502 · DOI
- 10.1002/mas.21425 · DOI
- 10.1021/acs.jproteome.8b00728 · DOI
- 10.1021/acs.jproteome.6b00485 · DOI
- 10.1021/acs.jproteome.7b00308 · DOI
- 10.1021/acs.jproteome.8b00359 · DOI
- 10.1038/nmeth.4256 · DOI
- 10.1038/nbt.4236 · DOI
- 10.1021/acs.jproteome.7b00873 · DOI
- 10.1038/s41587-019-0067-5 · DOI
- 10.1021/pr501173s · DOI
- 10.1021/pr200074h · DOI
- 10.1021/pr300338p · DOI
- 10.1186/1471-2105-15-121 · DOI
- 10.1145/1553374.1553516 · DOI
- Freksen, C. B.; Kamma, L.; Larsen, K. G. Fully Understanding the Hashing Trick. In arXiv: 1805.08539, 2018. · arXiv
- Dahlgaard, S.; Knudsen, M. B. T.; Thorup, M. Practical Hash Functions for Similarity Estimation and Dimensionality Reduction. In Proceedings of the 31st Conference on Neural Information Processing Systems—NIPS 2017 ; Long Beach, CA, 2017. arXiv: 1711.08797. · arXiv
- Aumüller, M.; Bernhardsson, E.; 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 ; Beecks, C., Borutta, F., Kröger, P., Seidl, T., Eds. Springer International Publishing: Munich, Germany, 2017; Vol. 10609, pp 34–49. · DOI
- 10.1109/ICCV.2003.1238663 · DOI · Paper page
- 10.1109/MCSE.2010.118 · DOI
- 10.1109/MCSE.2011.37 · DOI · Paper page
- 10.1145/2833157.2833162 · DOI
- 10.1101/725036 · DOI
- 10.1074/mcp.M113.032813 · DOI
- 10.1074/mcp.M113.035550 · DOI
- 10.1002/pmic.200600625 · DOI · Paper page
- 10.1021/pr900947u · DOI
- 10.1093/nar/gkv1145 · DOI
- 10.1038/nbt.2377 · DOI
- 10.1093/nar/gkw936 · DOI
- 10.1002/pmic.200300744 · DOI
- 10.1002/pmic.201300289 · DOI
Metadata
- Authors
- Bittremieux, W., Laukens, K., & Noble, W. S.
- Affiliations
- University of Antwerp (BE)
- University of Washington (US)
- Corresponding author
- Bittremieux, Wout
- Venue
- Journal of Proteome Research
- Publisher
- American Chemical Society (ACS)
- Published
- 2019-08-26
- Volume
- 18
- Issue
- 10
- Pages
- 3792-3799
- ISSN
- 1535-3893 (ISSN-L)
- 1535-3907
- PMC
- PMC6886738
- OpenAlex
- W2970104449
- Cited by
- 49
- References
- 4
- Citations by year
- 2026: 4 · 2025: 3 · 2024: 9 · 2023: 11 · 2022: 7 · 2021: 9 · 2020: 3 · 2019: 2
- FWCI
- 2.09
- Type
- journal article
- Language
- en
- Open access
- green
- doi.org
- Licence
- Locations
- Journal of Proteome Research (publishedVersion)
- bioRxiv (Cold Spring Harbor Laboratory) (acceptedVersion, cc-by)
- PubMed (publishedVersion)
- PubMed Central (acceptedVersion, cc-by-nc-nd)
- Funders
- Belgian American Educational Foundation
- Fonds Wetenschappelijk Onderzoek
- National Institutes of Health (R01 GM121818)
- Topics
- Physical Sciences › Chemistry › Spectroscopy › Advanced Proteomics Techniques and Applications
- Physical Sciences › Chemistry › Spectroscopy › Mass Spectrometry Techniques and Applications
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Machine Learning in Bioinformatics
- Keywords
- spectral library search, high-resolution mass spectrometry, feature hashing, graphics processing units, peptide identification, protein modification, computational efficiency, human proteome
- MeSH terms
- Humans, Peptides, Protein Processing, Post-Translational, Software, Peptide Library, Databases, Protein, Proteomics
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