Fig. 2

Different SPSSs computed on an arc-centric de Bruijn graph \(k = 5\). For simplicity, the reverse complements of all nodes and arcs are omitted. a The original de Bruijn graph in compacted form has 13 unitigs with 70 total characters. b Example of simplitigs with 7 strings and 43 total characters. c Example of greedily approximated matchtigs with 6 strings and 40 total characters. d Example of matchtigs with 5 strings and 39 total characters