Cargando…
Proposal of Smith-Waterman algorithm on FPGA to accelerate the forward and backtracking steps
In bioinformatics, alignment is an essential technique for finding similarities between biological sequences. Usually, the alignment is performed with the Smith-Waterman (SW) algorithm, a well-known sequence alignment technique of high-level precision based on dynamic programming. However, given the...
Autores principales: | de Oliveira, Fabio F., Dias, Leonardo A., Fernandes, Marcelo A. C. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9246398/ https://www.ncbi.nlm.nih.gov/pubmed/35772072 http://dx.doi.org/10.1371/journal.pone.0254736 |
Ejemplares similares
-
160-fold acceleration of the Smith-Waterman algorithm using a field programmable gate array (FPGA)
por: Li, Isaac TS, et al.
Publicado: (2007) -
SWIFOLD: Smith-Waterman implementation on FPGA with OpenCL for long DNA sequences
por: Rucci, Enzo, et al.
Publicado: (2018) -
A Review of Parallel Implementations for the Smith–Waterman Algorithm
por: Xia, Zeyu, et al.
Publicado: (2021) -
Accelerating the Smith-Waterman algorithm with interpair pruning and band optimization for the all-pairs comparison of base sequences
por: Okada, Daiki, et al.
Publicado: (2015) -
CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment
por: Manavski, Svetlin A, et al.
Publicado: (2008)