[图书][B] Reconfigurable computing: Accelerating computation with field-programmable gate arrays
MB Gokhale, PS Graham - 2006 - books.google.com
A one-of-a-kind survey of the field of Reconfigurable Computing Gives a comprehensive
introduction to a discipline that offers a 10X-100X acceleration of algorithms over …
introduction to a discipline that offers a 10X-100X acceleration of algorithms over …
A highly parameterized and efficient FPGA-based skeleton for pairwise biological sequence alignment
K Benkrid, Y Liu, AS Benkrid - IEEE Transactions on Very Large …, 2009 - ieeexplore.ieee.org
This paper presents the design and implementation of the most parameterisable field-
programmable gate array (FPGA)-based skeleton for pairwise biological sequence …
programmable gate array (FPGA)-based skeleton for pairwise biological sequence …
Bio-sequence database scanning on a GPU
W Liu, B Schmidt, G Voss, A Schroder… - … Parallel & Distributed …, 2006 - ieeexplore.ieee.org
Protein sequences with unknown functionality are often compared to a set of known
sequences to detect functional similarities. Efficient dynamic programming algorithms exist …
sequences to detect functional similarities. Efficient dynamic programming algorithms exist …
Hyper customized processors for bio-sequence database scanning on FPGAs
Protein sequences with unknown functionality are often compared to a set of known
sequences to detect functional similarities. Efficient dynamic-programming algorithms exist …
sequences to detect functional similarities. Efficient dynamic-programming algorithms exist …
Reconfigurable architectures for bio-sequence database scanning on FPGAs
TF Oliver, B Schmidt, DL Maskell - IEEE Transactions on …, 2005 - ieeexplore.ieee.org
Protein sequences with unknown functionality are often compared to a set of known
sequences to detect functional similarities. Efficient dynamic-programming algorithms exist …
sequences to detect functional similarities. Efficient dynamic-programming algorithms exist …
A reconfigurable accelerator for smith–waterman algorithm
X Jiang, X Liu, L Xu, P Zhang… - IEEE Transactions on …, 2007 - ieeexplore.ieee.org
Scanning bio-sequence database and finding similarities among DNA and protein
sequences is basic and important work in bioinformatics field. To solve this problem …
sequences is basic and important work in bioinformatics field. To solve this problem …
A multithreaded parallel implementation of a dynamic programming algorithm for sequence comparison
WS Martins, JB del Cuvillo, FJ Useche… - Biocomputing …, 2000 - World Scientific
This paper discusses the issues involved in implementing a dynamic programming
algorithm for biological sequence comparison on a general-purpose parallel computing …
algorithm for biological sequence comparison on a general-purpose parallel computing …
Multiple sequence alignment on an FPGA
Molecular Biologists frequently compute multiple sequence alignments (MSAs) to identify
similar regions in protein families. Progressive alignment is a widely used approach to …
similar regions in protein families. Progressive alignment is a widely used approach to …
[PDF][PDF] Massively Parallel Solutions for Molecular Sequence Analysis.
B Schmidt, H Schröder, M Schimmler - ipdps, 2002 - hicomb.org
In this paper we present new approaches to high performance protein database scanning
on two novel massively parallel architectures to gain supercomputer power at low cost. The …
on two novel massively parallel architectures to gain supercomputer power at low cost. The …
Definition and SIMD implementation of a multi-processing architecture approach on FPGA
P Bonnot, F Lemonnier, G Edelin, G Gaillat… - Proceedings of the …, 2008 - dl.acm.org
In a context of high performance, low technology access cost and application code
reusability objectives, this paper presents an" architectured FPGA" approach that consists in …
reusability objectives, this paper presents an" architectured FPGA" approach that consists in …