An efficient implementation of Smith Waterman algorithm on GPU using CUDA, for massively parallel scanning of sequence databases
Top Cited Papers
- 1 May 2009
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The Smith Waterman algorithm for sequence alignment is one of the main tools of bioinformatics. It is used for sequence similarity searches and alignment of similar sequences. The high end graphical processing unit (GPU), used for processing graphics on desktop computers, deliver computational capabilities exceeding those of CPUs by an order of magnitude. Recently these capabilities became accessible for general purpose computations thanks to CUDA programming environment on Nvidia GPUs and ATI Stream Computing environment on ATI GPUs. Here we present an efficient implementation of the Smith Waterman algorithm on the Nvidia GPU. The algorithm achieves more than 3.5 times higher per core performance than previously published implementation of the Smith Waterman algorithm on GPU, reaching more than 70% of theoretical hardware performance. The differences between current and earlier approaches are described showing the example for writing efficient code on GPU.Keywords
This publication has 21 references indexed in Scilit:
- The impact of next-generation sequencing technology on geneticsTrends in Genetics, 2008
- Genome sequencing in microfabricated high-density picolitre reactorsNature, 2005
- ParAlign: a parallel sequence alignment algorithm for rapid and sensitive database searchesNucleic Acids Research, 2001
- Comparison of sequence profiles. Strategies for structural predictions using sequence informationProtein Science, 2000
- Gapped BLAST and PSI-BLAST: a new generation of protein database search programsNucleic Acids Research, 1997
- Amino acid substitution matrices from protein blocks.Proceedings of the National Academy of Sciences of the United States of America, 1992
- Searching protein sequence libraries: Comparison of the sensitivity and selectivity of the Smith-Waterman and FASTA algorithmsGenomics, 1991
- Basic Local Alignment Search ToolJournal of Molecular Biology, 1990
- Improved tools for biological sequence comparison.Proceedings of the National Academy of Sciences of the United States of America, 1988
- Identification of common molecular subsequencesJournal of Molecular Biology, 1981