Lars Langner:

Myers Bit-Vector Algorithm on GPU for Seqan

Abstract

This work will be about the possibilty to use GPGPU methodes in Seqan
(especially with NVidia CUDA) and the implementation and
parallelization of Myers fast bitvector algorithm for approximate
string matchings.
It is stated that using massive multiprocessor programming can
dramatically increases the speed and performance of algorithms,
depending on the amount that could be parallized and the efficiency it
is implemented.
Using hundreds or thousands of parallel threads for read mapping/
localizing/matching to a genom with the fast GPU cores and Myers fast
matching algorithm can give an great gain of speed for sequence
analyse and string matchings.