Fig. 4From: On weighted k-mer dictionariesAn end-point weighted graph G with \(m=32\) nodes that is used as example throughout this section. The graph has 3 connected components, highlighted with different background colors, and \(|\mathcal {W}|=16\) distinct weightsBack to article page