Design space exploration for the BLAST algorithm implementation

被引：13

作者：

Sotiriades, Euripides ^{[1
]}

Dollas, Apostolos ^{[1
]}

机构：

[1] Tech Univ Crete, Dept Elect & Comp Engn, Khania 73100, Crete, Greece

来源：

FCCM 2007: 15TH ANNUAL IEEE SYMPOSIUM ON FIELD-PROGRAMMABLE CUSTOM COMPUTING MACHINES, PROCEEDINGS | 2007年

关键词：

D O I：

10.1109/FCCM.2007.36

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

The most prevalent algorithm for DNA sequence matching is the BLAST algorithm. During recent years we have developed several FPGA-based architectures to speed up BLAST execution. In this work we present a new VLSI architecture as a followup to our reconfigurable logic-based architectures, and we compare the performance of several software and hardware implementations of BLAST.

引用

页码：323 / 325

页数：3