Bioinformatics Advance Access published online on November 16, 2006
Bioinformatics, doi:10.1093/bioinformatics/btl582
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
* To whom correspondence should be addressed.
Motivation: The only algorithm guaranteed to find the optimal local alignment is the Smith-Waterman. It is also one of the slowest due to the number of computations required for the search. To speed up the algorithm, Single Instruction Multiple Data instructions have been used to parallelize the algorithm at the instruction level. Results: A faster implementation of the Smith-Waterman algorithm is presented. This algorithm achieved 2-8 times performance improvement over other SIMD based Smith-Waterman implementations. On a 2.0GHz Xeon Core 2 Duo processor, speeds over 3.0 billion cell updates per second were achieved. Availability: http://farrar.michael.googlepages.com/smith-waterman.
Received June 22, 2006
Revised November 13, 2006
Accepted November 14, 2006
Article
Striped Smith-Waterman speeds database searches six times over other SIMD implementations
Michael Farrar *
Michael Farrar, E-mail: farrar.michael{at}gmail.com
![]()
Abstract
Associate Editor: Nikolaus Rajewsky
![]()
CiteULike
Connotea
Del.icio.us What's this?