An innovative reconfigurable supercomputing platform – XD1000 is being developed by XtremeData to exploit the rapid progress of FPGA technology and the high-performance of Hyper-Transport interconnection. In this paper, we present implementations of the Smith-Waterman algorithm for both DNA and protein sequences on the platform. The main features include: (1) we bring forward a multistage PE (processing element) design which significantly reduces the FPGA resource usage and hence allows more parallelism to be exploited; (2) our design features a pipelined control mechanism with uneven stage latencies – a key to minimize the overall PE pipeline cycle time; (3) we also present a compressed substitution matrix storage structure, resulting in s...
Background: The Smith-Waterman (SW) algorithm is the best choice for searching similar regions betwe...
The Smith Waterman algorithm is used to perform local alignment on biological sequences by calculati...
<p><b>Copyright information:</b></p><p>Taken from "160-fold acceleration of the Smith-Waterman algor...
The paper presents the results of design explorations for the implementation of the Smith-Waterman (...
Abstract: Efficient sequence alignment is one of the most important and challenging activities in bi...
Abstract Background To infer homology and subsequentl...
Due to advancing technology, genetic sequencing has become cheaper over the years. This has caused t...
With the sequencing of DNA becoming cheaper and the resulting stack of data growing bigger, there is...
With the dramatically increasing amounts of genomic sequence database, there is a need for faster an...
With the dramatically increasing amounts of genomic sequence database, there is a need for faster an...
This paper describes a multi-threaded parallel design and implementation of the Smith-Waterman (SM) ...
<p><b>Copyright information:</b></p><p>Taken from "160-fold acceleration of the Smith-Waterman algor...
Abstract—This paper describes a multi-threaded parallel design and implementation of the Smith-Water...
Hardware acceleration is needed to speed up DNA or protein alignment while keeping the accuracy of t...
Smith-Waterman is a dynamic programming algorithm that plays a key role in the modern genomics pipel...
Background: The Smith-Waterman (SW) algorithm is the best choice for searching similar regions betwe...
The Smith Waterman algorithm is used to perform local alignment on biological sequences by calculati...
<p><b>Copyright information:</b></p><p>Taken from "160-fold acceleration of the Smith-Waterman algor...
The paper presents the results of design explorations for the implementation of the Smith-Waterman (...
Abstract: Efficient sequence alignment is one of the most important and challenging activities in bi...
Abstract Background To infer homology and subsequentl...
Due to advancing technology, genetic sequencing has become cheaper over the years. This has caused t...
With the sequencing of DNA becoming cheaper and the resulting stack of data growing bigger, there is...
With the dramatically increasing amounts of genomic sequence database, there is a need for faster an...
With the dramatically increasing amounts of genomic sequence database, there is a need for faster an...
This paper describes a multi-threaded parallel design and implementation of the Smith-Waterman (SM) ...
<p><b>Copyright information:</b></p><p>Taken from "160-fold acceleration of the Smith-Waterman algor...
Abstract—This paper describes a multi-threaded parallel design and implementation of the Smith-Water...
Hardware acceleration is needed to speed up DNA or protein alignment while keeping the accuracy of t...
Smith-Waterman is a dynamic programming algorithm that plays a key role in the modern genomics pipel...
Background: The Smith-Waterman (SW) algorithm is the best choice for searching similar regions betwe...
The Smith Waterman algorithm is used to perform local alignment on biological sequences by calculati...
<p><b>Copyright information:</b></p><p>Taken from "160-fold acceleration of the Smith-Waterman algor...