Cargando…
Indel-tolerant read mapping with trinucleotide frequencies using cache-oblivious kd-trees
Motivation: Mapping billions of reads from next generation sequencing experiments to reference genomes is a crucial task, which can require hundreds of hours of running time on a single CPU even for the fastest known implementations. Traditional approaches have difficulties dealing with matches of l...
Autores principales: | Mahmud, Md Pavel, Wiedenhoeft, John, Schliep, Alexander |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Oxford University Press
2012
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3436807/ https://www.ncbi.nlm.nih.gov/pubmed/22962448 http://dx.doi.org/10.1093/bioinformatics/bts380 |
Ejemplares similares
-
Cache-Oblivious parallel SIMD Viterbi decoding for sequence search in HMMER
por: Ferreira, Miguel, et al.
Publicado: (2014) -
Oblivious?
Publicado: (1871) -
A Novel Edge Cache-Based Private Set Intersection Protocol via Lightweight Oblivious PRF
por: Zhang, Jing, et al.
Publicado: (2023) -
Verbigeration of Oblivious Agony
por: Cherian, Ajith
Publicado: (2023) -
Compacting oblivious agents on dynamic rings
por: Das, Shantanu, et al.
Publicado: (2021)