首页> 外文会议>2011 Eighth international conference on information technology: new generations >Design of a FPGA-Based Parallel Architecture for BLAST Algorithm with Multi-hits Detection
【24h】

Design of a FPGA-Based Parallel Architecture for BLAST Algorithm with Multi-hits Detection

机译:基于FPGA的BLAST多击中算法并行架构设计

获取原文

摘要

In this paper, a design of a Field Programmable Gate Array (FPGA)-based parallel architecture for Basic Local Alignment Search Tool (BLAST) Algorithm with multi-hits Detection is proposed. Basic Local Alignment Search Tool algorithm is a heuristic biological sequence alignment algorithm and has been widely used in the computational biology domain. The architecture contains several different blocks. Each block will perform a different step of National Center for Biotechnology Information (NCBI) BLAST family algorithms in parallel. The most appealing and distinguishing features of this architecture are the Multiple Hits Finder Array and Hits Combination Block. In the hits detection stage, we apply a Multiple Hits Finder Array approach to realize the multi-hits in one clock cycle. Then the multiple overlapping hits are merged together in the Hits Finder Block to reduce memory consumption and save implementation time. The parallel design makes this FPGA-based BLAST algorithm implementation much faster than an equivalent software program would in a PC. Multiple Hits Finder Array architecture prototype is implemented and the storage expense and synthesis performance of the prototype are discussed.
机译:本文提出了一种基于现场可编程门阵列(FPGA)的并行架构,用于具有多点击检测的基本局部比对搜索工具(BLAST)算法。基本局部比对搜索工具算法是一种启发式生物序列比对算法,已在计算生物学领域得到广泛应用。该体系结构包含几个不同的块。每个模块将并行执行国家生物技术信息中心(NCBI)BLAST系列算法的不同步骤。该体系结构最吸引人和最独特的功能是“多次命中查找器数组”和“命中组合框”。在命中检测阶段,我们应用“多个命中查找器数组”方法在一个时钟周期内实现多命中。然后,将多个重叠的匹配项在“匹配项查找器”模块中合并在一起,以减少内存消耗并节省实现时间。并行设计使这种基于FPGA的BLAST算法实现比PC中的等效软件程序快得多。实现了多个Hits Finder Array体系结构原型,并讨论了该原型的存储费用和综合性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号