The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
CUDASW++: optimizing Smith-Waterman sequence database searches for CUDA-enabled graphics processing units
Open accessAbstract
BACKGROUND: The Smith-Waterman algorithm is one of the most widely used tools for searching biological sequence databases due to its high sensitivity. Unfortunately, the Smith-Waterman algorithm is computationally demanding, which is further compounded by the exponential growth of sequence databases. The recent emergence of many-core architectures, and their associated programming interfaces, provides an opportunity to accelerate sequence database searches using commonly available and inexpensive hardware. FINDINGS: Our CUDASW++ implementation (benchmarked on a single-GPU NVIDIA GeForce GTX 280 graphics card and a dual-GPU GeForce GTX 295 graphics card) provides a significant performance improvement compared to other publicly available implementations, such as SWPS3, CBESW, SW-CUDA, and NCBI-BLAST. CUDASW++ supports query sequences of length up to 59K and for query sequences ranging in length from 144 to 5,478 in Swiss-Prot release 56.6, the single-GPU version achieves an average performance of 9.509 GCUPS with a lowest performance of 9.039 GCUPS and a highest performance of 9.660 GCUPS, and the dual-GPU version achieves an average performance of 14.484 GCUPS with a lowest performance of 10.660 GCUPS and a highest performance of 16.087 GCUPS. CONCLUSION: CUDASW++ is publicly available open-source software. It provides a significant performance improvement for Smith-Waterman-based protein sequence database searches by fully exploiting the compute capability of commonly used CUDA-enabled low-cost GPUs.
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
Basic local alignment search tool
Altschul, S. F., Gish, W., Miller, W., Myers, E. W., & Lipman, D. J. (1990) · Journal of Molecular Biology · doi:10.1006/jmbi.1990.9999 · Cited by 98,669
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
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
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
Nickolls, J., Buck, I., Garland, M., & Skadron, K. (2008) · Queue · doi:10.1145/1365490.1365500 · Cited by 1,610
(2008) · doi:10.1145/1401132.1401152 · Cited by 1,575
NVIDIA Tesla: A Unified Graphics and Computing Architecture
Lindholm, E., Nickolls, J., Oberman, S., & Montrym, J. (2008) · IEEE Micro · doi:10.1109/mm.2008.31 · Cited by 1,362
IEEE Transactions on Parallel and Distributed Systems
(2023) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.71 · Cited by 583
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
Striped Smith–Waterman speeds database searches six times over other SIMD implementations
Farrar, M. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btl582 · Cited by 415
Rognes, T., & Seeberg, E. (2000) · Bioinformatics · doi:10.1093/bioinformatics/16.8.699 · Cited by 240
Streaming Algorithms for Biological Sequence Alignment on GPUs
Weiguo, L., Schmidt, B., Voss, G., & Muller-Wittig, W. (2007) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2007.1069 · Cited by 168
Self-citation160-fold acceleration of the Smith-Waterman algorithm using a field programmable gate array (FPGA)
Li, I. T. S., Shum, W., & Truong, K. (2007) · BMC Bioinformatics · doi:10.1186/1471-2105-8-185 · Cited by 150
Using video-oriented instructions to speed up sequence comparison
Wozniak, A. (1997) · Computer applications in the biosciences · doi:10.1093/bioinformatics/13.2.145 · Cited by 146
SWPS3 – fast multi-threaded vectorized Smith-Waterman for IBM Cell/B.E. and ×86/SSE2
Szalkowski, A. M., Ledergerber, C., Krähenbühl, P., & Dessimoz, C. (2008) · BMC Research Notes · doi:10.1186/1756-0500-1-107 · Cited by 134
Model based analysis of real-time PCR data from DNA binding dye protocols
Alvarez, M. J., Vilá‐Ortíz, G. J., Salibe, M., Podhajcer, O. L., & Pitossi, F. J. (2007) · BMC Bioinformatics · doi:10.1186/1471-2105-8-85 · Cited by 47
Cited by
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
Computational solutions to large‐scale data management and analysis
Schadt, E. E., Linderman, M. D., Sorenson, J., Lee, L., & Nolan, G. P. (2010) · Nature Reviews Genetics · doi:10.1038/nrg2857 · Cited by 631
SOAP3-dp: Fast, Accurate and Sensitive GPU-Based Short Read Aligner
Luo, R., Wong, T., Zhu, J., Liu, C.-M., Zhu, X., Wu, E., Lee, L.-K., Lin, H., Zhu, W., Cheung, D. W., et al. (2013) · PLoS ONE · doi:10.1371/journal.pone.0065632 · Cited by 425
Metadata
- Authors
- Liu, Y., Maskell, D. L., & Schmidt, B.
- Venue
- BMC Research Notes
- Published
- 2009
- Volume
- 2
- Issue
- 1
- Pages
- 73
- ISSN
- 1756-0500 (ISSN-L)
- OpenAlex
- W2133540884
- Cited by
- 261
- References
- 17
- FWCI
- 51.68
- Type
- journal article
- Language
- en
- Open access
- gold
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.