title: CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment.
abstract: BACKGROUND
  Searching for similarities in protein and DNA databases has become a routine procedure in Molecular Biology. The Smith-Waterman algorithm has been available for more than 25 years. It is based on a dynamic programming approach that explores all the possible alignments between two sequences; as a result it returns the optimal local alignment. Unfortunately, the computational cost is very high, requiring a number of operations proportional to the product of the length of two sequences. Furthermore, the exponential growth of protein and DNA databases makes the Smith-Waterman algorithm unrealistic for searching similarities in large sets of sequences. For these reasons heuristic approaches such as those implemented in FASTA and BLAST tend to be preferred, allowing faster execution times at the cost of reduced sensitivity. The main motivation of our work is to exploit the huge computational power of commonly available graphic cards, to develop high performance solutions for sequence alignment.
  
  
  RESULTS
  In this paper we present what we believe is the fastest solution of the exact Smith-Waterman algorithm running on commodity hardware. It is implemented in the recently released CUDA programming environment by NVidia. CUDA allows direct access to the hardware primitives of the last-generation Graphics Processing Units (GPU) G80. Speeds of more than 3.5 GCUPS (Giga Cell Updates Per Second) are achieved on a workstation running two GeForce 8800 GTX. Exhaustive tests have been done to compare our implementation to SSEARCH and BLAST, running on a 3 GHz Intel Pentium IV processor. Our solution was also compared to a recently published GPU implementation and to a Single Instruction Multiple Data (SIMD) solution. These tests show that our implementation performs from 2 to 30 times faster than any other previous attempt available on commodity hardware.
  
  
  CONCLUSIONS
  The results show that graphic cards are now sufficiently advanced to be used as efficient hardware accelerators for sequence alignment. Their performance is better than any alternative available on commodity hardware platforms. The solution presented in this paper allows large scale alignments to be performed at low cost, using the exact Smith-Waterman algorithm instead of the largely adopted heuristic approaches.
authors.affiliation: CRIBI, University of Padova, Padova, Italy. svetlin.manavski@cribi.unipd.it
authors.forename: Svetlin A
authors.initials: SA
authors.lastname: Manavski
authors.forename: Giorgio
authors.initials: G
authors.lastname: Valle
mesh_terms: D003196:Computer Graphics; D004867:Equipment Design; D019544:Equipment Failure Analysis; D016247:Information Storage and Retrieval / Q000379:methods; D016415:Sequence Alignment / Q000295:instrumentation* / Q000379:methods; D017421:Sequence Analysis / Q000295:instrumentation* / Q000379:methods; D012815:Signal Processing, Computer-Assisted / Q000295:instrumentation*