Cargando…
Compact representation of k-mer de Bruijn graphs for genome read assembly
BACKGROUND: Processing of reads from high throughput sequencing is often done in terms of edges in the de Bruijn graph representing all k-mers from the reads. The memory requirements for storing all k-mers in a lookup table can be demanding, even after removal of read errors, but can be alleviated b...
| Autor principal: | |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
BioMed Central
2013
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4015147/ https://www.ncbi.nlm.nih.gov/pubmed/24152242 http://dx.doi.org/10.1186/1471-2105-14-313 |