CUDASW++2.0: enhanced Smith-Waterman protein database search on CUDA-enabled GPUs based on SIMT and virtualized SIMD abstractions
Top Cited Papers
Open Access
- 6 April 2010
- journal article
- Published by Springer Nature in BMC Research Notes
- Vol. 3 (1) , 93
Abstract
Due to its high sensitivity, the Smith-Waterman algorithm is widely used for biological database searches. Unfortunately, the quadratic time complexity of this algorithm makes it highly time-consuming. The exponential growth of biological databases further deteriorates the situation. To accelerate this algorithm, many efforts have been made to develop techniques in high performance architectures, especially the recently emerging many-core architectures and their associated programming models.Keywords
This publication has 26 references indexed in Scilit:
- CUDASW++: optimizing Smith-Waterman sequence database searches for CUDA-enabled graphics processing unitsBMC Research Notes, 2009
- CBESW: Sequence Alignment on the Playstation 3BMC Bioinformatics, 2008
- CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignmentBMC Bioinformatics, 2008
- SWPS3 – fast multi-threaded vectorized Smith-Waterman for IBM Cell/B.E. and ×86/SSE2BMC Research Notes, 2008
- Clustal W and Clustal X version 2.0Bioinformatics, 2007
- 160-fold acceleration of the Smith-Waterman algorithm using a field programmable gate array (FPGA)BMC Bioinformatics, 2007
- Model based analysis of real-time PCR data from DNA binding dye protocolsBMC Bioinformatics, 2007
- Gapped BLAST and PSI-BLAST: a new generation of protein database search programsNucleic Acids Research, 1997
- CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choiceNucleic Acids Research, 1994
- Basic local alignment search toolJournal of Molecular Biology, 1990