Fig. 2From: Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear timeAn example de Bruijn graph with \(k = 4\) in which UST and ProphAsm may compute a suboptimal solution. The optimal solution here is a single string AGGTGCCGTGGGATBack to article page