Ontology highlight
ABSTRACT:
SUBMITTER: Holley G
PROVIDER: S-EPMC7499882 | biostudies-literature | 2020 Sep
REPOSITORIES: biostudies-literature
Holley Guillaume G Melsted Páll P
Genome biology 20200917 1
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-efficient algorithm enabling the direct construction of the compacted de Bruijn graph without producing the intermediate uncompacted graph. Bifrost features a broad range of functions, such as indexing, edi ...[more]