2. Building unitigs with Bcalm2
Bcalm2 obtains unitigs by building a De Bruijn Graph (DBG). A DBG is built by superimposing k-mers on a length of k-1. This is kind of the reciprocal of k-mer obtention: you try to find a text that can yield the k-mers you have. Once the DBG is obtained, paths that are unique (non-ambiguous, without forks) are compacted into unitigs. An illustration:
