GATB-core 1.2.0 released

Get it on Github

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

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()).

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”

Breaking API changes (see release notes on Github)

Comments are closed.