Cargando…
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
BACKGROUND: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest approach to parallelisation with SIMD technology has previously been described by Farrar in 2007. The aim of this study was...
Autor principal: | Rognes, Torbjørn |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2011
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3120707/ https://www.ncbi.nlm.nih.gov/pubmed/21631914 http://dx.doi.org/10.1186/1471-2105-12-221 |
Ejemplares similares
-
CUDASW++ 3.0: accelerating Smith-Waterman protein database search by coupling CPU and GPU SIMD instructions
por: Liu, Yongchao, et al.
Publicado: (2013) -
SSW Library: An SIMD Smith-Waterman C/C++ Library for Use in Genomic Applications
por: Zhao, Mengyao, et al.
Publicado: (2013) -
CUDASW++2.0: enhanced Smith-Waterman protein database search on CUDA-enabled GPUs based on SIMT and virtualized SIMD abstractions
por: Liu, Yongchao, et al.
Publicado: (2010) -
Improving the Mapping of Smith-Waterman Sequence Database Searches onto CUDA-Enabled GPUs
por: Huang, Liang-Tsung, et al.
Publicado: (2015) -
CUDASW++: optimizing Smith-Waterman sequence database searches for CUDA-enabled graphics processing units
por: Liu, Yongchao, et al.
Publicado: (2009)