Smith-Waterman is a dynamic programming algorithm that plays a key role in the modern genomics pipeline as it is guaranteed to find the optimal local alignment between two strings of data. The state of the art presents many hardware acceleration solutions that have been implemented in order to exploit the high degree of parallelism available in this algorithm. The majority of these implementations use heuristics to increase the performance of the system at the expense of the accuracy of the result. In this work, we present an implementation of the pure version of the algorithm. We include the key architectural optimizations to achieve highest possible performance for a given platform and leverage the Berkeley roofline model to track the per...
OpenCL has been proposed as a means of accelerating functional computation using FPGA and GPU accele...
Background: The Smith-Waterman (SW) algorithm is the best choice for searching similar regions betwe...
Summary Alignment is essential in many areas such as biological, chemical and criminal forensics. Th...
Smith-Waterman is a dynamic programming algorithm that plays a key role in the modern genomics pipel...
The well-known Smith-Waterman (SW) algorithm is a high-sensitivity method for local alignments. Unfo...
The Smith Waterman algorithm is used to perform local alignment on biological sequences by calculati...
With the greater importance of parallel architectures such as GPUs or Xeon Phi accelerators, the sci...
The application of accelerators in HPC applications has seen enormous growth in the last decade. In ...
The well-known Smith–Waterman algorithm is a high-sensitivity method for local sequence alignment. U...
Developments in sequencing technology have drastically reduced the cost of DNA sequencing. The raw s...
An innovative reconfigurable supercomputing platform – XD1000 is being developed by XtremeData to ex...
Detecting similarities between (RNA, DNA, and protein) sequences is an important part of bioinformat...
Abstract: Efficient sequence alignment is one of the most important and challenging activities in bi...
Background: The Smith-Waterman (SW) algorithm is the best choice for searching similar regions betwe...
Abstract Background To infer homology and subsequentl...
OpenCL has been proposed as a means of accelerating functional computation using FPGA and GPU accele...
Background: The Smith-Waterman (SW) algorithm is the best choice for searching similar regions betwe...
Summary Alignment is essential in many areas such as biological, chemical and criminal forensics. Th...
Smith-Waterman is a dynamic programming algorithm that plays a key role in the modern genomics pipel...
The well-known Smith-Waterman (SW) algorithm is a high-sensitivity method for local alignments. Unfo...
The Smith Waterman algorithm is used to perform local alignment on biological sequences by calculati...
With the greater importance of parallel architectures such as GPUs or Xeon Phi accelerators, the sci...
The application of accelerators in HPC applications has seen enormous growth in the last decade. In ...
The well-known Smith–Waterman algorithm is a high-sensitivity method for local sequence alignment. U...
Developments in sequencing technology have drastically reduced the cost of DNA sequencing. The raw s...
An innovative reconfigurable supercomputing platform – XD1000 is being developed by XtremeData to ex...
Detecting similarities between (RNA, DNA, and protein) sequences is an important part of bioinformat...
Abstract: Efficient sequence alignment is one of the most important and challenging activities in bi...
Background: The Smith-Waterman (SW) algorithm is the best choice for searching similar regions betwe...
Abstract Background To infer homology and subsequentl...
OpenCL has been proposed as a means of accelerating functional computation using FPGA and GPU accele...
Background: The Smith-Waterman (SW) algorithm is the best choice for searching similar regions betwe...
Summary Alignment is essential in many areas such as biological, chemical and criminal forensics. Th...