Fig. 1
From: Matchtigs: minimum plain text representation of k-mer sets
Examples of de Bruijn graphs. Binodes are surrounded by a dashed box, where self-complemental binodes contain only one graph node. a A de Bruijn graph of the strings TTCTGA and GTCTGT. The colored and patterned lines are an arc-covering set of biwalks. b A de Bruijn graph containing two self-complemental nodes. The colored and patterned lines are a set of biwalks that visit each biarc exactly once. c a de Bruijn graph containing a self-complemental biarc. The bold colored line is a biwalk that visits each biarc exactly once