Cargando…
Bifrost: highly parallel construction and indexing of colored and compacted de Bruijn graphs
Memory consumption of de Bruijn graphs is often prohibitive. Most de Bruijn graph-based assemblers reduce the complexity by compacting paths into single vertices, but this is challenging as it requires the uncompacted de Bruijn graph to be available in memory. We present a parallel and memory-effici...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
BioMed Central
2020
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7499882/ https://www.ncbi.nlm.nih.gov/pubmed/32943081 http://dx.doi.org/10.1186/s13059-020-02135-8 |