Families of FPGA-based accelerators for BLAST algorithm with multi-seeds detection and parallel extension

11Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

As one of the most widely used bio-sequence searching tools, BLAST adopts index-based approach to detect the matches between two substrings by looking up a large table and processing one match per query. In this paper, we propose a systolic array approach to detect string matches without using looking up tables. The pipelining systolic array is implemented as a multi-seeds detection and parallel extension pipeline engine to accelerate the first two stages of NCBI BLAST family algorithms. Different from the index-based approach, our implementation consumes little memory resources and eliminates redundant string extensions by merging multiple adjoin seeds into a valid seed. Our FPGA implementation achieves superior performance results in both of processing element number and clock frequency over related works in the area of FPGA BLAST accelerators. The experimental results also show the speedup can reach about 17, 48, 14, 71 and 10 compared to the NCBI BLASTp, TBLASTn, BLASTx, TBLASTx and BLASTn programs for 3072-residue queries on Intel P4 CPU, respectively. Furthermore, the idea of multi-seeds detection also can be adopted in other seed-based heuristic searching applications. © Springer-Verlag Berlin Heidelberg 2008.

Cite

CITATION STYLE

APA

Xia, F., Dou, Y., & Xu, J. (2008). Families of FPGA-based accelerators for BLAST algorithm with multi-seeds detection and parallel extension. Communications in Computer and Information Science, 13, 43–57. https://doi.org/10.1007/978-3-540-70600-7_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free