Bio-sequence database scanning on a GPU

Protein sequences with unknown functionality are often compared to a set of known sequences to detect functional similarities. Efficient dynamic programming algorithms exist for this problem, however current solutions still require significant scan times. These scan time requirements are likely to become even more severe due to the rapid growth in the size of these databases. In this paper, we present a new approach to bio-sequence database scanning using computer graphics hardware to gain high performance at low cost. To derive an efficient mapping onto this type of architecture, we have reformulated the SmithWaterman dynamic programming algorithm in terms of computer graphics primitives. Our OpenGL implementation achieves a speedup of approximately sixteen on a high-end graphics card over available straightforward and optimized CPU Smith-Waterman implementations.

• Type: Conference
• Year: 2006
• Where: IPPS
• Authors: Weiguo Liu, Bertil Schmidt, Gerrit Voss, Adrian Schröder, Wolfgang Müller-Wittig
• Keywords: Distributed And Parallel Computing, Dynamic Programming Algorithm, Efficient Dynamic Programming, IPPS 2006, Scan Time