Acceleration of the Smith-Waterman algorithm using single and multiple graphics processors

作者：Khajeh Saeed Ali; Poole Stephen; Perot J Blair^*

来源：Journal of Computational Physics, 2010, 229(11): 4247-4258.

DOI：10.1016/j.jcp.2010.02.009

• Smith-Waterman
• Sequence matching
• Parallel scan
• GPU
• Graphics processor

Finding regions of similarity between two very long data streams is a computationally intensive problem referred to as sequence alignment. Alignment algorithms must allow for imperfect sequence matching with different starting locations and some gaps and errors between the two data sequences. Perhaps the most well known application of sequence matching is the testing of DNA or protein sequences against genome databases. The Smith-Waterman algorithm is a method for precisely characterizing how well two sequences can be aligned and for determining the optimal alignment of those two sequences. Like many applications in computational science, the Smith-Waterman algorithm is constrained by the memory access speed and can be accelerated significantly by using graphics processors (GPUs) as the compute engine. In this work we show that effective use of the GPU requires a novel reformulation of the Smith-Waterman algorithm. The performance of this new version of the algorithm is demonstrated using the SSCA#1 (Bioinformatics) benchmark running on one GPU and on up to four GPUs executing in parallel. The results indicate that for large problems a single GPU is up to 45 times faster than a GPU for this application, and the parallel implementation shows linear speed up on up to 4 GPUs.

• 出版日期2010-6-1