title: Striped Smith-Waterman speeds database searches six times over other SIMD implementations.
abstract: BACKGROUND
  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 (SIMD) 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.0 GHz Xeon Core 2 Duo processor, speeds of >3.0 billion cell updates/s were achieved.
  
  
  BACKGROUND
  http://farrar.michael.googlepages.com/Smith-waterman
authors.affiliation: farrar.michael@gmail.com
authors.forename: Michael
authors.initials: M
authors.lastname: Farrar
mesh_terms: D000465:Algorithms; D003628:Database Management Systems; D030541:Databases, Genetic; D016247:Information Storage and Retrieval / Q000379:methods*; D016415:Sequence Alignment / Q000379:methods*; D017421:Sequence Analysis / Q000379:methods*; D013997:Time Factors