Efficient Hardware Hashing Functions for High Performance Computers
IEEE Transactions on Computers
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Journal of Algorithms
RC-BLAST: Towards a Portable, Cost-Effective Open Source Hardware Implementation
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 7 - Volume 08
A Reconfigurable Index FLASH Memory tailored to Seed-Based Genomic Sequence Comparison Algorithms
Journal of VLSI Signal Processing Systems
Biosequence Similarity Search on the Mercury System
Journal of VLSI Signal Processing Systems
A Reconfigurable Bloom Filter Architecture for BLASTN
ARCS '09 Proceedings of the 22nd International Conference on Architecture of Computing Systems
FPGA based architecture for DNA sequence comparison and database search
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Fast and Scalable Pattern Matching for Network Intrusion Detection Systems
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
BLAST is one of the most popular sequence analysis tools used by molecular biologists. It is designed to efficiently find similar regions between two sequences that have biological significance. However, because the size of genomic databases is growing rapidly, the computation time of BLAST, when performing a complete genomic database search, is continuously increasing. Thus, there is a clear need to accelerate this process. In this paper, we present a new approach for genomic sequence database scanning utilizing reconfigurable field programmable gate array (FPGA)-based hardware. In order to derive an efficient structure for BLASTN, we propose a reconfigurable architecture to accelerate the computation of the word-matching stage. The experimental results show that the FPGA implementation achieves a speedup around one order of magnitude compared to the NCBI BLASTN software running on a general purpose computer.