Literature DB >> 9146961

Using video-oriented instructions to speed up sequence comparison.

A Wozniak1.   

Abstract

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 (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.

Entities:  

Mesh:

Substances:

Year:  1997        PMID: 9146961     DOI: 10.1093/bioinformatics/13.2.145

Source DB:  PubMed          Journal:  Comput Appl Biosci        ISSN: 0266-7061


  23 in total

1.  ParAlign: a parallel sequence alignment algorithm for rapid and sensitive database searches.

Authors:  T Rognes
Journal:  Nucleic Acids Res       Date:  2001-04-01       Impact factor: 16.971

Review 2.  The limits of protein sequence comparison?

Authors:  William R Pearson; Michael L Sierk
Journal:  Curr Opin Struct Biol       Date:  2005-06       Impact factor: 6.809

3.  High-performance hardware implementation of a parallel database search engine for real-time peptide mass fingerprinting.

Authors:  István A Bogdán; Jenny Rivers; Robert J Beynon; Daniel Coca
Journal:  Bioinformatics       Date:  2008-05-03       Impact factor: 6.937

4.  GPU-based cloud service for Smith-Waterman algorithm using frequency distance filtration scheme.

Authors:  Sheng-Ta Lee; Chun-Yuan Lin; Che Lun Hung
Journal:  Biomed Res Int       Date:  2013-04-03       Impact factor: 3.411

5.  Coupling SIMD and SIMT architectures to boost performance of a phylogeny-aware alignment kernel.

Authors:  Nikolaos Alachiotis; Simon A Berger; Alexandros Stamatakis
Journal:  BMC Bioinformatics       Date:  2012-08-09       Impact factor: 3.169

6.  CUDASW++2.0: enhanced Smith-Waterman protein database search on CUDA-enabled GPUs based on SIMT and virtualized SIMD abstractions.

Authors:  Yongchao Liu; Bertil Schmidt; Douglas L Maskell
Journal:  BMC Res Notes       Date:  2010-04-06

7.  Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation.

Authors:  Torbjørn Rognes
Journal:  BMC Bioinformatics       Date:  2011-06-01       Impact factor: 3.169

8.  Accelerated Profile HMM Searches.

Authors:  Sean R Eddy
Journal:  PLoS Comput Biol       Date:  2011-10-20       Impact factor: 4.475

9.  Fast filtering for RNA homology search.

Authors:  Diana L Kolbe; Sean R Eddy
Journal:  Bioinformatics       Date:  2011-09-28       Impact factor: 6.937

10.  CUDASW++ 3.0: accelerating Smith-Waterman protein database search by coupling CPU and GPU SIMD instructions.

Authors:  Yongchao Liu; Adrianto Wirawan; Bertil Schmidt
Journal:  BMC Bioinformatics       Date:  2013-04-04       Impact factor: 3.169

View more

北京卡尤迪生物科技股份有限公司 © 2022-2023.