Sciweavers

Share
RIVF
2008

Speeding up subset seed algorithm for intensive protein sequence comparison

8 years 11 months ago
Speeding up subset seed algorithm for intensive protein sequence comparison
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.
Van Hoa Nguyen, Dominique Lavenier
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2008
Where RIVF
Authors Van Hoa Nguyen, Dominique Lavenier
Comments (0)
books