Towards Fast Bioinformatics Algorithms: Benchmarking the GPGPU

This paper studies the viability of GPGPU, by analyzing the speedup of 9 algorithms frequently used in practice. The speedup we have obtained suggests the possibility of implementing fast versions of Levenshtein distance and Knuth-Morris-Pratt exact search, required by many bioinformatics applications.