Linear algebra operators for GPU implementation of numerical algorithms
ACM SIGGRAPH 2003 Papers
ClawHMMER: A Streaming HMMer-Search Implementatio
SC '05 Proceedings of the 2005 ACM/IEEE conference on Supercomputing
Bio-sequence database scanning on a GPU
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Journal of VLSI Signal Processing Systems
Streaming Algorithms for Biological Sequence Alignment on GPUs
IEEE Transactions on Parallel and Distributed Systems
GPU parallelization of algebraic dynamic programming
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part II
Parallel Position Weight Matrices algorithms
Parallel Computing
A new parallel method of smith-waterman algorithm on a heterogeneous platform
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
Proceedings of the ATIP/A*CRC Workshop on Accelerator Technologies for High-Performance Computing: Does Asia Lead the Way?
International Journal of Computational Science and Engineering
Hi-index | 0.00 |
Molecular Biologists frequently compute multiple sequence alignments (MSAs) to identify similar regions in protein families. However, aligning hundreds of sequences by popular MSA tools such as ClustalW requires several hours on sequential computers. Due to the rapid growth of biological sequence databases biologists have to compute MSAs in a far shorter time. In this paper we present a new approach to reduce this runtime using graphics processing units (GPUs). To derive an efficient mapping onto this type of architecture, we have reformulated the computationally most expensive part of ClustalW in terms of computer graphics primitives. This results in a high-speed implementation with significant runtime savings on a commodity graphics card.