GPU Accelerated Smith-Waterman
We present a novel hardware implementation of the double affine Smith-Waterman (DASW) algorithm, which uses dynamic programming to compare and align genomic sequences such as DNA and proteins. We implement DASW on a commodity graphics card, taking advantage of the general purpose programmability of the graphics processing unit to leverage its cheap parallel processing power. The results demonstrate that our system’s performance is competitive with current optimized software packages.
KeywordsDynamic Programming Graphic Processing Unit Texture Memory Genomic Sequence Comparison Dynamic Programming Table
- 4.ClearSpeed: AdvanceTM Board (2006), http://www.clearspeed.com/index.html
- 5.Horn, R., Houston, M., Hanrahan, P.: ClawHMMer: A streaming HMMer-search implementation. In: Proc. Supercomputing (2005)Google Scholar
- 10.Green, P.: SWAT Optimization (2006), http://www.phrap.org/phredphrap/general.html