Cargando…
Bitpacking techniques for indexing genomes: I. Hash tables
BACKGROUND: Hash tables constitute a widely used data structure for indexing genomes that provides a list of genomic positions for each possible oligomer of a given size. The offset array in a hash table grows exponentially with the oligomer size and precludes the use of larger oligomers that could...
| Autor principal: | |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
BioMed Central
2016
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4835851/ https://www.ncbi.nlm.nih.gov/pubmed/27095998 http://dx.doi.org/10.1186/s13015-016-0069-5 |