Issue No.09 - September (2007 vol.18)
Sequence alignment is a common and often repeated task in molecular biology. Typical alignment operations consist of finding similarities between a pair of sequences (pairwise sequence alignment) or a family of sequences (multiple sequence alignment). The need for speeding up this treatment comes from the rapid growth rate of biological sequence databases: every year their size increases by a factor 1.5 to 2. In this paper we present a new approach to high performance biological sequence alignment based on commodity PC graphics hardware. Using modern graphics processing units (GPUs) for high performance computing is facilitated by their enhanced programmability and motivated by their attractive price/performance ratio and incredible growth in speed. To derive an efficient mapping onto this type of architecture, we have reformulated dynamic programming based alignment algorithms as streaming algorithms in terms of computer graphics primitives. Our experimental results show that the GPU-based approach allows speedups of over one order of magnitude with respect to optimized CPU implementations.
Streaming architectures, dynamic programming, pairwise sequence alignment, multiple sequence alignment, graphics hardware, GPGPU
Bertil Schmidt, Gerrit Voss, Wolfgang Muller-Wittig, "Streaming Algorithms for Biological Sequence Alignment on GPUs", IEEE Transactions on Parallel & Distributed Systems, vol.18, no. 9, pp. 1270-1281, September 2007, doi:10.1109/TPDS.2007.1069