Cargando…
MaxSSmap: a GPU program for mapping divergent short reads to genomes with the maximum scoring subsequence
BACKGROUND: Programs based on hash tables and Burrows-Wheeler are very fast for mapping short reads to genomes but have low accuracy in the presence of mismatches and gaps. Such reads can be aligned accurately with the Smith-Waterman algorithm but it can take hours and days to map millions of reads...
Autores principales: | Turki, Turki, Roshan, Usman |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2014
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4289234/ https://www.ncbi.nlm.nih.gov/pubmed/25398475 http://dx.doi.org/10.1186/1471-2164-15-969 |
Ejemplares similares
-
GPU acceleration of Darwin read overlapper for de novo assembly of long DNA reads
por: Ahmed, Nauman, et al.
Publicado: (2020) -
A graphical, interactive and GPU-enabled workflow to process long-read sequencing data
por: Reddy, Shishir, et al.
Publicado: (2021) -
NMF-mGPU: non-negative matrix factorization on multi-GPU systems
por: Mejía-Roa, Edgardo, et al.
Publicado: (2015) -
ReadDB Provides Efficient Storage for Mapped Short Reads
por: Rolfe, P Alexander, et al.
Publicado: (2011) -
cudaMap: a GPU accelerated program for gene expression connectivity mapping
por: McArt, Darragh G, et al.
Publicado: (2013)