Holley, Guillaume; Melsted, Páll
(Springer Science and Business Media LLC, 2020-09-17)
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 ...