Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Wozniak, A.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Wozniak, A.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© Oxford University Press

Using video-oriented instructions to speed up sequence comparison

A. Wozniak

INRIA, BP 105, 78153 Le Chesnay Cedex, France

MOTIVATION: 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 (18 531 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.).

AVAILABILITY: This implementation is available through LASSAP package http://www-rocq.inria.fr/genome

CONTACT: E-mail: Andrzej.Wozniak{at}inria.fr

Received on September 20, 1996; revised on November 13, 1996; accepted on November 21, 1996

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 BioinformaticsHome page
I. A. Bogdan, J. Rivers, R. J. Beynon, and D. Coca
High-performance hardware implementation of a parallel database search engine for real-time peptide mass fingerprinting
Bioinformatics, July 1, 2008; 24(13): 1498 - 1502.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
I. Bogdan, D. Coca, J. Rivers, and R. J Beynon
Hardware acceleration of processing of mass spectrometric data for proteomics
Bioinformatics, March 15, 2007; 23(6): 724 - 731.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
M. Farrar
Striped Smith-Waterman speeds database searches six times over other SIMD implementations
Bioinformatics, January 15, 2007; 23(2): 156 - 161.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
T. Rognes
ParAlign: a parallel sequence alignment algorithm for rapid and sensitive database searches
Nucleic Acids Res., April 1, 2001; 29(7): 1647 - 1652.
[Abstract] [Full Text] [PDF]


Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.