
Figure 5.
Overview of relationship between maximal unitigs in double and bidirected graph for odd k. We use the example from Figure 4, in which K = {AAC, ACT, CTA, CAC, ATA}. The set of maximal unitigs from Gdbl(K), D, is partitioned into Dpal and Dnon-pal. The set of maximal unitigs from Gbid(K), B, is partitioned into Blast-loop, Bfirst-loop, and Bno-loop. The arrows between different subsets of D and B denote bijections.











