Fig. 8From: On weighted k-mer dictionariesThe execution of algorithm greedy-cover on the graph from Fig. 7 after the execution of merge-even. The resulting minimum-size path cover has \(|C^*|=5\) pathsBack to article page