Bifrost: highly parallel construction and indexing of colored and compacted de Bruijn graphs
Abstract 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 memo...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
BMC
2020-09-01
|
| Series: | Genome Biology |
| Online Access: | http://link.springer.com/article/10.1186/s13059-020-02135-8 |