Release notes
Assembly-inspired de Bruijn graph simplifications
// removes tips, bubbles and erroneous connections,
// similar to some of the algorithms implemented in the SPAdes assembler
graph.simplify();
// similar to some of the algorithms implemented in the SPAdes assembler
graph.simplify();
Faster graph traversal can be activated using a single command.
// allocates 1 byte/node to precompute adjacency for each nodes in the MPHF.
// Faster graph traversal (especially using neighbors()).
graph.precomputeAdjacency();
// Faster graph traversal (especially using neighbors()).
graph.precomputeAdjacency();
Improvements in MPHF and kmer counting
- New implementation for the minimal perfect hash function (switched from emphf to BooPHF)
- Non-canonical k-mer counting is supported via “cmake -DNONCANONICAL=1”
