论文信息 - Towards Fast Bioinformatics Algorithms: Benchmarking the GPGPU

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.

Rodica Potolea | Andy S. Alic | Simona Visan

[1] P. Kollman,et al. A Second Generation Force Field for the Simulation of Proteins, Nucleic Acids, and Organic Molecules , 1995 .

[2] James A. Hutchby,et al. Limits to binary logic switch scaling - a gedanken model , 2003, Proc. IEEE.

[3] Juha Kärkkäinen,et al. One-Gapped q-Gram Filtersfor Levenshtein Distance , 2002, CPM.

[4] Pat Hanrahan,et al. Understanding the efficiency of GPU algorithms for matrix-matrix multiplication , 2004, Graphics Hardware.

[5] Vijay S. Pande,et al. Folding@Home and Genome@Home: Using distributed computing to tackle previously intractable problem , 2009, 0901.0866.

[7] Mark J. Harris,et al. Parallel Prefix Sum (Scan) with CUDA , 2011 .

[8] College Vijayawada. Unusual Pattern Detection in DNA Database Using KMP Algorithm , 2010 .