Using video-oriented instructions to speed up sequence comparison.
BACKGROUND
This document presents an implementation of the well-known Smith-Waterman algorithm for comparison of proteic and nucleic sequences, using specialized video instructions. These instructions, SIMD-like in their design, make possible parallelization of the algorithm at the instruction level.


RESULTS
Benchmarks on an ULTRA SPARC running at 167 MHz show a speed-up factor of two compared to the same algorithm implemented with integer instructions on the same machine. Performance reaches over 18 million matrix cells per second on a single processor, giving to our knowledge the fastest implementation of the Smith-Waterman algorithm on a workstation. The accelerated procedure was introduced in LASSAP--a LArge Scale Sequence compArison Package software developed at INRIA--which handles parallelism at higher level. On a SUN Enterprise 6000 server with 12 processors, a speed of nearly 200 million matrix cells per second has been obtained. A sequence of length 300 amino acids is scanned against SWISSPROT R33 (1,8531,385 residues) in 29 s. This procedure is not restricted to databank scanning. It applies to all cases handled by LASSAP (intra- and inter-bank comparisons, Z-score computation, etc.
Wozniak
A
A
INRIA, Le Chesnay, France. Andrzej.Wozniak@inria.fr
D000465:Algorithms; D016288:Computer Terminals; D003194:Computer-Assisted Instruction / Q000379:methods*; D016208:Databases, Factual; D005069:Evaluation Studies as Topic; D009696:Nucleic Acids / Q000235:genetics; D011506:Proteins / Q000235:genetics; D016415:Sequence Alignment / Q000379:methods* / Q000706:statistics & numerical data; D017386:Sequence Homology, Amino Acid; D012689:Sequence Homology, Nucleic Acid; D012984:Software
D009696:Nucleic Acids; D011506:Proteins