Speeding up Subset Seed Algorithm for Intensive Protein Sequence Comparison

Van Hoa Nguyen 1, * Dominique Lavenier 1
* Auteur correspondant
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.
Type de document :
Communication dans un congrès
6th IEEE International Conference on research, innovation & vision for the future, Jul 2008, Ho Chi Minh Ville, Vietnam. 2008
Liste complète des métadonnées

Littérature citée [14 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00321457
Contributeur : Van Hoa Nguyen <>
Soumis le : lundi 15 septembre 2008 - 01:07:56
Dernière modification le : mercredi 11 avril 2018 - 01:54:16
Document(s) archivé(s) le : vendredi 4 juin 2010 - 11:21:12

Fichier

rivf08.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • 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. 2008. 〈inria-00321457〉

Partager

Métriques

Consultations de la notice

339

Téléchargements de fichiers

124