Cargando…
Kart: a divide-and-conquer algorithm for NGS read alignment
MOTIVATION: Next-generation sequencing (NGS) provides a great opportunity to investigate genome-wide variation at nucleotide resolution. Due to the huge amount of data, NGS applications require very fast and accurate alignment algorithms. Most existing algorithms for read mapping basically adopt see...
Autores principales: | Lin, Hsin-Nan, Hsu, Wen-Lian |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Oxford University Press
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5860120/ https://www.ncbi.nlm.nih.gov/pubmed/28379292 http://dx.doi.org/10.1093/bioinformatics/btx189 |
Ejemplares similares
-
DACTAL: divide-and-conquer trees (almost) without alignments
por: Nelesen, Serita, et al.
Publicado: (2012) -
A divide-and-conquer algorithm for quantum state preparation
por: Araujo, Israel F., et al.
Publicado: (2021) -
Cheaters divide and conquer
por: Bomblies, Kirsten
Publicado: (2014) -
A sample implementation for parallelizing Divide-and-Conquer algorithms on the GPU
por: Mei, Gang, et al.
Publicado: (2018) -
Angelika Amon: Conquering the divide
por: Short, Ben
Publicado: (2011)