Speeding up Subset Seed Algorithm for Intensive Protein Sequence Comparison

van Hoa Nguyen 1, * Dominique Lavenier 1
* Corresponding author
1 SYMBIOSE - Biological systems and models, bioinformatics and sequences
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : Sequence similarity search is a common and repeated task in molecular biology. The rapid growth of genomic databases leads to the need of speeding up the treatment of this task. In this paper, we present a subset seed algorithm for intensive protein sequence comparison. We have accelerated this algorithm by using indexing technique and fine grained parallelism of GPU and SIMD instructions. We have implemented two programs: iBLASTP, iTBLASTN. The GPU (SIMD) implementation of the two programs achieves a speed up ranging from 5.5 to 10 (4 to 5.6) compared to the BLASTP and TBLASTN of the BLAST program family, with comparable sensitivity.
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/inria-00321457
Contributor : van Hoa Nguyen <>
Submitted on : Monday, September 15, 2008 - 1:07:56 AM
Last modification on : Friday, November 16, 2018 - 1:25:17 AM
Long-term archiving on : Friday, June 4, 2010 - 11:21:12 AM

File

rivf08.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00321457, version 1

Citation

van Hoa Nguyen, Dominique Lavenier. Speeding up Subset Seed Algorithm for Intensive Protein Sequence Comparison. 6th IEEE International Conference on research, innovation & vision for the future, Jul 2008, Ho Chi Minh Ville, Vietnam. ⟨inria-00321457⟩

Share

Metrics

Record views

600

Files downloads

219