The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Six-fold speed-up of Smith–Waterman sequence database searches using parallel processing on common microprocessors
Open accessAbstract
Motivation: Sequence database searching is among the most important and challenging tasks in bioinformatics. The ultimate choice of sequence-search algorithm is that of Smith–Waterman. However, because of the computationally demanding nature of this method, heuristic programs or special-purpose hardware alternatives have been developed. Increased speed has been obtained at the cost of reduced sensitivity or very expensive hardware. Results: A fast implementation of the Smith–Waterman sequence-alignment algorithm using Single-Instruction, Multiple-Data (SIMD) technology is presented. This implementation is based on the MultiMedia eXtensions (MMX) and Streaming SIMD Extensions (SSE) technology that is embedded in Intel’s latest microprocessors. Similar technology exists also in other modern microprocessors. Six-fold speed-up relative to the fastest previously known Smith–Waterman implementation on the same hardware was achieved by an optimized 8-way parallel processing approach. A speed of more than 150 million cell updates per second was obtained on a single Intel Pentium III 500 MHz microprocessor. This is probably the fastest implementation of this algorithm on a single general-purpose microprocessor described to date. Availability: Online searches with the software are available at http://dna.uio.no/search/ Contact: torbjorn.rognes@labmed.uio.no To whom correspondence should be addressed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Improved tools for biological sequence comparison.
Pearson, W. R., & Lipman, D. J. (1988) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.85.8.2444 · Cited by 11,227
Amino acid substitution matrices from protein blocks.
Henikoff, S., & Henikoff, J. G. (1992) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.89.22.10915 · Cited by 6,218
Cited by
Accelerated Profile HMM Searches
Eddy, S. R. (2011) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1002195 · Cited by 6,975
“Several vector methods have been described for accelerating classical Smith/Waterman local sequence alignment [34,35], and methods for accelerating Smith/Waterman dynamic programming (DP) recursions are readily adapted to profile HMMs.”
MethodFast and accurate de novo genome assembly from long uncorrected reads
Vaser, R., Sović, I., Nagarajan, N., & Šikić, M. (2017) · Genome Research · doi:10.1101/gr.214270.116 · Cited by 3,043
HH-suite3 for fast remote homology detection and deep protein annotation
Steinegger, M., Meier, M., Mirdita, M., Vöhringer, H., Haunsberger, S. J., & Söding, J. (2019) · BMC Bioinformatics · doi:10.1186/s12859-019-3019-7 · Cited by 1,145
SHRiMP: Accurate Mapping of Short Color-space Reads
Rumble, S. M., Lacroute, P., Dalca, A. V., Fiume, M., Sidow, A., & Brudno, M. (2009) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000386 · Cited by 575
CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment
Manavski, S. A., & Valle, G. (2008) · BMC Bioinformatics · doi:10.1186/1471-2105-9-s2-s10 · Cited by 468
Linear Motif Atlas for Phosphorylation-Dependent Signaling
Miller, M. L., Jensen, L. J., Diella, F., Jørgensen, C., Tinti, M., Li, L., Hsiung, M., Parker, S. A., Bordeaux, J., Sicheritz-Ponten, T., et al. (2008) · Science Signaling · doi:10.1126/scisignal.1159433 · Cited by 442
GMAP and GSNAP for Genomic Sequence Alignment: Enhancements to Speed, Accuracy, and Functionality
Wu, T. D., Reeder, J., Lawrence, M., Becker, G., & Brauer, M. J. (2016) · Methods in Molecular Biology · doi:10.1007/978-1-4939-3578-9_15 · Cited by 431
Striped Smith–Waterman speeds database searches six times over other SIMD implementations
Farrar, M. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btl582 · Cited by 415
Liu, Y., Maskell, D. L., & Schmidt, B. (2009) · BMC Research Notes · doi:10.1186/1756-0500-2-73 · Cited by 261
Optimal gap-affine alignment in O ( s ) space
Marco-Sola, S., Eizenga, J. M., Guarracino, A., Paten, B., Garrison, E., & Moreto, M. (2023) · Bioinformatics · doi:10.1093/bioinformatics/btad074 · Cited by 66
Metadata
- Authors
- Rognes, T., & Seeberg, E.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2000-08-01
- Volume
- 16
- Issue
- 8
- Pages
- 699-706
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2132967231
- Cited by
- 240
- References
- 2
- FWCI
- 3.33
- Type
- journal article
- Language
- en
- Open access
- bronze
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.