Improving the Mapping of Smith-Waterman Sequence Database Searches onto CUDA-Enabled GPUs

الملخص EN

Sequence alignment lies at heart of the bioinformatics.

The Smith-Waterman algorithm is one of the key sequence search algorithms and has gained popularity due to improved implementations and rapidly increasing compute power.

Recently, the Smith-Waterman algorithm has been successfully mapped onto the emerging general-purpose graphics processing units (GPUs).

In this paper, we focused on how to improve the mapping, especially for short query sequences, by better usage of shared memory.

We performed and evaluated the proposed method on two different platforms (Tesla C1060 and Tesla K20) and compared it with two classic methods in CUDASW++.

Further, the performance on different numbers of threads and blocks has been analyzed.

The results showed that the proposed method significantly improves Smith-Waterman algorithm on CUDA-enabled GPUs in proper allocation of block and thread numbers.