Afficher la couverture 'Speeding up Subset Seed Algorithm for Intensive Protein Sequence Comparison | Nguyen, van Hoa' en grand format
/5

0 avis

Speeding up Subset Seed Algorithm for Intensive Protein Sequence Comparison

Archive ouverte

Nguyen, van Hoa | Lavenier, Dominique

Edité par CCSD -

International audience. 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.

Suggestions

Du même auteur

Fine-grained parallelization of similarity search between protein sequences

Archive ouverte | Nguyen, van Hoa | CCSD

This report presents the implementation of a protein sequence comparison algorithm specifically designed for speeding up time consuming part on parallel hardware such as SSE instructions, multicore architectures or graphic boards....

Parallélisation de la recherche de similarités entre séquences protéiques sur GPU

Archive ouverte | Nguyen, van Hoa | CCSD

International audience. Ce papier présente une nouvelle approche pour accélérer la recherche de similarités entre séquences protéiques. Elle repose sur une indexation complète des données en mémoire permettant d'exh...

Seed-Based Parallel Protein SequenceComparison Combining Multithreading, GPU, and FPGA technologies

Archive ouverte | Lavenier, Dominique | CCSD

Chargement des enrichissements...