Speeding up subset seed algorithm for intensive protein sequence comparison
IRISA/INRIA Rennes, Rennes, France
IEEE International Conference on Research, Innovation and Vision for the Future, 2008. RIVF 2008, p.57-63
@conference{lavenier2008speeding,
title={Speeding up subset seed algorithm for intensive protein sequence comparison},
author={Lavenier, D.},
booktitle={Research, Innovation and Vision for the Future, 2008. RIVF 2008. IEEE International Conference on},
pages={57–63},
year={2008},
organization={IEEE}
}
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.
January 4, 2011 by hgpu
