Hardware acceleration of long read pairwise overlapping in genome sequencing: A race between fpga and gpu
In genome sequencing, it is a crucial but time-consuming task to detect potential overlaps
between any pair of the input reads, especially those that are ultra-long. The state-of-the-art …
between any pair of the input reads, especially those that are ultra-long. The state-of-the-art …
Parallel optimal pairwise biological sequence comparison: Algorithms, platforms, and classification
EFDO Sandes, A Boukerche… - ACM Computing Surveys …, 2016 - dl.acm.org
Many bioinformatics applications, such as the optimal pairwise biological sequence
comparison, demand a great quantity of computing resource, thus are excellent candidates …
comparison, demand a great quantity of computing resource, thus are excellent candidates …
OSWALD: OpenCL Smith–Waterman on Altera's FPGA for Large Protein Databases
The well-known Smith–Waterman algorithm is a high-sensitivity method for local sequence
alignment. Unfortunately, the Smith–Waterman algorithm has quadratic time complexity …
alignment. Unfortunately, the Smith–Waterman algorithm has quadratic time complexity …
Efficient distributed smith-waterman algorithm based on apache spark
The Smith-Waterman algorithm, which produces the optimal local alignment between
pairwise sequences, is universally used as a key component in bioinformatics fields. It is …
pairwise sequences, is universally used as a key component in bioinformatics fields. It is …
[PDF][PDF] A Review of the Smith-Waterman GPU Landscape
R Barnes - Berkeley: Electrical Engineering and …, 2020 - digitalassets.lib.berkeley.edu
A key step in the assembly of genomes is the identification of locally optimal alignments
between small subsections of the genome. The Smith-Waterman algorithm provides an …
between small subsections of the genome. The Smith-Waterman algorithm provides an …
An energy‐aware performance analysis of SWIMM: Smith–Waterman implementation on Intel's Multicore and Manycore architectures
Alignment is essential in many areas such as biological, chemical and criminal forensics.
The well‐known Smith–Waterman (SW) algorithm is able to retrieve the optimal local …
The well‐known Smith–Waterman (SW) algorithm is able to retrieve the optimal local …
Speeding-up bioinformatics algorithms with heterogeneous architectures: highly heterogeneous smith-waterman (HHeterSW)
J EstebanFrancisco, A CaballeroJuan - Journal of Computational …, 2016 - liebertpub.com
Abstract The Smith-Waterman algorithm has a great sensitivity when used for biological
sequence-database searches, but at the expense of high computing-power requirements …
sequence-database searches, but at the expense of high computing-power requirements …
Smith-Waterman protein search with OpenCL on an FPGA
The well-known Smith-Waterman (SW) algorithm is a high-sensitivity method for local
alignments. Unfortunately, SW is expensive in terms of both execution time and memory …
alignments. Unfortunately, SW is expensive in terms of both execution time and memory …
Comparação paralela de sequências biológicas em múltiplas GPUs com descarte de blocos e estratégias de distribuição de carga
MAC Figueirêdo Júnior - 2021 - realp.unb.br
A comparação de sequências biológicas é um problema bastante importante em
Bioinformática. A utilização de métodos exatos para a solução deste problema requer um …
Bioinformática. A utilização de métodos exatos para a solução deste problema requer um …
Parallel Smith-Waterman algorithm hardware implementation for ancestors and offspring gene tracer
Computational Molecular Biology, Bioinformatics and Genomics are the most intriguing
sciences to understand the human genome and diseases. These sciences use algorithms to …
sciences to understand the human genome and diseases. These sciences use algorithms to …