Parallel Megabase DNA Sequence Comparison with OpenCL
Local Sequence alignment is an important task for bioinformatics. The most widely used algorithm is Smith-Waterman  has a quadratic time complexity which is time consuming especially in large biological database search. Many attempts were made to accelerate Smith-Waterman using parallel architecture. In this paper a parallel implementation of Smith Waterman algorithm will be presented. This implementation will run on Graphics Processing Unit using an open standard (OpenCL) by carefully exploiting features of the graphics processing unit, this implementation will be more than two times faster than the other parallel implementation on the Graphics Processing Unit.