Cargando…
Fast and efficient short read mapping based on a succinct hash index
BACKGROUND: Various indexing techniques have been applied by next generation sequencing read mapping tools. The choice of a particular data structure is a trade-off between memory consumption, mapping throughput, and construction time. RESULTS: We present the succinct hash index – a novel data struc...
Autores principales: | Zhang, Haowen, Chan, Yuandong, Fan, Kaichao, Schmidt, Bertil, Liu, Weiguo |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5845352/ https://www.ncbi.nlm.nih.gov/pubmed/29523083 http://dx.doi.org/10.1186/s12859-018-2094-5 |
Ejemplares similares
-
Fast randomized approximate string matching with succinct hash data structures
por: Policriti, Alberto, et al.
Publicado: (2015) -
Accelerating read mapping with FastHASH
por: Xin, Hongyi, et al.
Publicado: (2013) -
Fast-HBR: Fast hash based duplicate read remover
por: Altayyar, Sami, et al.
Publicado: (2022) -
Alignment of short reads to multiple genomes using hashing
por: Tran, Quang, et al.
Publicado: (2014) -
MOSAIK: A Hash-Based Algorithm for Accurate Next-Generation Sequencing Short-Read Mapping
por: Lee, Wan-Ping, et al.
Publicado: (2014)