Skip to main content
Fig. 4 | Algorithms for Molecular Biology

Fig. 4

From: On weighted k-mer dictionaries

Fig. 4

An 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 weights

Back to article page