Cargando…
160-fold acceleration of the Smith-Waterman algorithm using a field programmable gate array (FPGA)
BACKGROUND: To infer homology and subsequently gene function, the Smith-Waterman (SW) algorithm is used to find the optimal local alignment between two sequences. When searching sequence databases that may contain hundreds of millions of sequences, this algorithm becomes computationally expensive. R...
Autores principales: | Li, Isaac TS, Shum, Warren, Truong, Kevin |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2007
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1896180/ https://www.ncbi.nlm.nih.gov/pubmed/17555593 http://dx.doi.org/10.1186/1471-2105-8-185 |
Ejemplares similares
-
Proposal of Smith-Waterman algorithm on FPGA to accelerate the forward and backtracking steps
por: de Oliveira, Fabio F., et al.
Publicado: (2022) -
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) -
SWIFOLD: Smith-Waterman implementation on FPGA with OpenCL for long DNA sequences
por: Rucci, Enzo, et al.
Publicado: (2018) -
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
por: Rognes, Torbjørn
Publicado: (2011) -
CUDASW++ 3.0: accelerating Smith-Waterman protein database search by coupling CPU and GPU SIMD instructions
por: Liu, Yongchao, et al.
Publicado: (2013)