CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment

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 seq...

• Type: Journal
• Year: 2008
• Where: BMCBI
• Authors: Svetlin Manavski, Giorgio Valle
• Keywords: BMCBI 2008, Commodity Hardware, Smith-Waterman Algorithm, Solution