Skip to main content

Table 4 The costs of relevant edges in the auxiliary graph for computing the value of \(G'(c, ab)\): note that the cost for the edge (uv) is exactly value of G(uv), the size of the maximum common subtree between \(T_{1}(u)\) and \(T_{2}(v)\)

From: A multi-labeled tree dissimilarity measure for comparing “clonal trees” of tumor progression

  1. For computing \(G'(c, ab)\) we only need the values G between each child of vertex c in \(T_{1}\) (i.e. de and f) and that of vertex ab in \(T_{2}\) (i.e. cde, f, g)