Cargando…
GPU-Based Cloud Service for Smith-Waterman Algorithm Using Frequency Distance Filtration Scheme
As the conventional means of analyzing the similarity between a query sequence and database sequences, the Smith-Waterman algorithm is feasible for a database search owing to its high sensitivity. However, this algorithm is still quite time consuming. CUDA programming can improve computations effici...
Autores principales: | Lee, Sheng-Ta, Lin, Chun-Yuan, Hung, Che Lun |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Hindawi Publishing Corporation
2013
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3638642/ https://www.ncbi.nlm.nih.gov/pubmed/23653898 http://dx.doi.org/10.1155/2013/721738 |
Ejemplares similares
-
Accelerating Smith-Waterman Alignment for Protein Database Search Using Frequency Distance Filtration Scheme Based on CPU-GPU Collaborative System
por: Liu, Yu, 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) -
A Review of Parallel Implementations for the Smith–Waterman Algorithm
por: Xia, Zeyu, et al.
Publicado: (2021) -
CUDASW++ 3.0: accelerating Smith-Waterman protein database search by coupling CPU and GPU SIMD instructions
por: Liu, Yongchao, et al.
Publicado: (2013) -
Proposal of Smith-Waterman algorithm on FPGA to accelerate the forward and backtracking steps
por: de Oliveira, Fabio F., et al.
Publicado: (2022)