Cargando…
Comparing the Speed and Accuracy of the Smith and Waterman Algorithm as Implemented by Mpsrch with the Blast and Fasta Heuristics for Sequence Similarity Searching
Autor principal: | Muratet, Michael A. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
TheScientificWorldJOURNAL
2002
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6009308/ https://www.ncbi.nlm.nih.gov/pubmed/29973785 http://dx.doi.org/10.1100/tsw.2002.11 |
Ejemplares similares
-
A Review of Parallel Implementations for the Smith–Waterman Algorithm
por: Xia, Zeyu, et al.
Publicado: (2021) -
Proposal of Smith-Waterman algorithm on FPGA to accelerate the forward and backtracking steps
por: de Oliveira, Fabio F., et al.
Publicado: (2022) -
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
por: Rognes, Torbjørn
Publicado: (2011) -
Improving the Mapping of Smith-Waterman Sequence Database Searches onto CUDA-Enabled GPUs
por: Huang, Liang-Tsung, et al.
Publicado: (2015) -
SWIFOLD: Smith-Waterman implementation on FPGA with OpenCL for long DNA sequences
por: Rucci, Enzo, et al.
Publicado: (2018)