Figure 6.

Tree-based comparison of networks. Illustration of the tree-based network comparison measure. (a) The weighted bipartite graph G that is constructed from the two networks N₁ and N₂ in Figure 2. On the left are four nodes that correspond to the four trees in $\mathcal{T}$(N₁) and on the right are four nodes that correspond to the four trees in $\mathcal{T}$(N₂). The weight of an edge between $T_1^i$ and $T_2^j$ is the values of the Robinson-Foulds (RF) distance between the two trees, which is computed as the number of clusters present in one but not both of the trees, divided by 2. (b) The edges that comprise the minimum-weight edge cover of the bipartite graph G. The weight of this cover is 2, which is the sum of the weights of the edges in the cover; therefore, m^tree(N₁, N₂) = 2.