The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Striped Smith–Waterman speeds database searches six times over other SIMD implementations
Open accessAbstract
Motivation: The only algorithm guaranteed to find the optimal local alignment is the Smith–Waterman. It is also one of the slowest due to the number of computations required for the search. To speed up the algorithm, Single-Instruction Multiple-Data (SIMD) instructions have been used to parallelize the algorithm at the instruction level. Results: A faster implementation of the Smith–Waterman algorithm is presented. This algorithm achieved 2–8 times performance improvement over other SIMD based Smith–Waterman implementations. On a 2.0 GHz Xeon Core 2 Duo processor, speeds of >3.0 billion cell updates/s were achieved. Availability: Contact: farrar.michael@gmail.com
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
Gapped BLAST and PSI-BLAST: a new generation of protein database search programs
Altschul, S. (1997) · Nucleic Acids Research · doi:10.1093/nar/25.17.3389 · Cited by 73,302
Needleman, S. B., & Wunsch, C. D. (1970) · Journal of Molecular Biology · doi:10.1016/0022-2836(70)90057-4 · Cited by 11,288
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
Identification of common molecular subsequences
Smith, T. F., & Waterman, M. S. (1981) · Journal of Molecular Biology · doi:10.1016/0022-2836(81)90087-5 · Cited by 9,940
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
Eddy, S. R. (1998) · Bioinformatics · doi:10.1093/bioinformatics/14.9.755 · Cited by 5,515
On Finding All Suboptimal Foldings of an RNA Molecule
Zuker, M. (1989) · Science · doi:10.1126/science.2468181 · Cited by 2,005
An improved algorithm for matching biological sequences
Gotoh, O. (1982) · Journal of Molecular Biology · doi:10.1016/0022-2836(82)90398-9 · Cited by 1,724
Profile analysis: detection of distantly related proteins.
Gribskov, M., McLachlan, A. D., & Eisenberg, D. (1987) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.84.13.4355 · Cited by 1,325
Benson, D. A. (2000) · Nucleic Acids Research · doi:10.1093/nar/28.1.15 · Cited by 833
Cited by
Minimap2: Pairwise alignment for nucleotide sequences
Li, H. (2018) · Bioinformatics · doi:10.1093/bioinformatics/bty191 · Cited by 14,807
Accelerated Profile HMM Searches
Eddy, S. R. (2011) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1002195 · Cited by 6,975
HMMER web server: interactive sequence similarity searching
Finn, R. D., Clements, J., & Eddy, S. R. (2011) · Nucleic Acids Research · doi:10.1093/nar/gkr367 · Cited by 5,952
Sensitive protein alignments at tree-of-life scale using DIAMOND
Buchfink, B., Reuter, K., & Drost, H.-G. (2021) · Nature Methods · doi:10.1038/s41592-021-01101-x · Cited by 5,097
Aligning sequence reads, clone sequences and assembly con*gs with BWA-MEM
Li, H. (2014) · arXiv (Cornell University) · doi:10.6084/m9.figshare.963153.v1 · Cited by 4,932
Fast and accurate protein structure search with Foldseek
van Kempen, M., Kim, S. S., Tumescheit, C., Mirdita, M., Lee, J., Gilchrist, C. L. M., Söding, J., & Steinegger, M. (2022) · doi:10.1101/2022.02.07.479398 · Cited by 2,598
Fast and accurate protein structure search with Foldseek
van Kempen, M., Kim, S. S., Tumescheit, C., Mirdita, M., Lee, J., Gilchrist, C. L. M., Söding, J., & Steinegger, M. (2024) · Nature Biotechnology · doi:10.1038/s41587-023-01773-0 · Cited by 2,596
“The seven features cos ϕ 12 , cos ϕ 34 , cos ϕ 15 , cos ϕ 35 , cos ϕ 14 , cos ϕ 23 , cos ϕ 13 and the distance ∣ C α , i − C α , j ∣ describe the conformation between the backbone fragments.”
MethodHHblits: lightning-fast iterative protein sequence searching by HMM-HMM alignment
Remmert, M., Biegert, A., Hauser, A., & Söding, J. (2012) · Nature Methods · doi:10.1038/nmeth.1818 · Cited by 2,288
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
Variation graph toolkit improves read mapping by representing genetic variation in the reference
Garrison, E., Sirén, J., Novak, A. M., Hickey, G., Eizenga, J. M., Dawson, E. T., Jones, W., Garg, S., Markello, C., Lin, M. F., et al. (2018) · Nature Biotechnology · doi:10.1038/nbt.4227 · Cited by 821
nhmmer: DNA homology search with profile HMMs
Wheeler, T. J., & Eddy, S. R. (2013) · Bioinformatics · doi:10.1093/bioinformatics/btt403 · Cited by 926
A survey of sequence alignment algorithms for next-generation sequencing
Li, H., & Homer, N. (2010) · Briefings in Bioinformatics · doi:10.1093/bib/bbq015 · Cited by 875
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
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
Protein-to-genome alignment with miniprot
Li, H. (2023) · Bioinformatics · doi:10.1093/bioinformatics/btad014 · Cited by 426
MOSAIK: A Hash-Based Algorithm for Accurate Next-Generation Sequencing Short-Read Mapping
Lee, W.-P., Stromberg, M. P., Ward, A., Stewart, C., Garrison, E. P., & Marth, G. T. (2014) · PLoS ONE · doi:10.1371/journal.pone.0090581 · Cited by 279
MMseqs software suite for fast and deep clustering and searching of large protein sequence sets
Hauser, M., Steinegger, M., & Söding, J. (2016) · Bioinformatics · doi:10.1093/bioinformatics/btw006 · Cited by 271
Liu, Y., Maskell, D. L., & Schmidt, B. (2009) · BMC Research Notes · doi:10.1186/1756-0500-2-73 · Cited by 261
Multiple protein structure alignment at scale with FoldMason
Gilchrist, C. L. M., Mirdita, M., & Steinegger, M. (2026) · Science · doi:10.1126/science.ads6733 · Cited by 117
GPU-accelerated homology search with MMseqs2
(2025) · doi:10.1038/s41592-025-02819-8 · Cited by 71
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
Ghaly, T. M., Rajabal, V., Russell, D., Colombi, E., & Tetu, S. G. (2025) · doi:10.1101/2025.04.02.646905 · Cited by 5
(2025) · doi:10.1111/1462-2920.70178 · Cited by 5
Metadata
- Authors
- Farrar, M.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2006-11-16
- Volume
- 23
- Issue
- 2
- Pages
- 156-161
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2146379626
- Cited by
- 415
- References
- 16
- FWCI
- 14.54
- 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.