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

Fig. 3

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

Fig. 3

Illustrates how to obtain a maximum common tree of trees \(T_1\) and \(T_2\). We used dashed lines to denote pairs of vertices \(u_i, v_i\) from the proof of Observation 4. After the first step of proof we delete all vertices which do not belong to paths from roots to some crucial vertex and obtain from trees \(T_1\) and \(T_2\) trees \(T'_1\) and \(T'_2\) which are topologically isomorphic to each other. After applying the step two from proof we obtain by applying sequence of optimal operations to pairs of paths \(((a), (a')), ((c, g), (c', g')), ((b), (b')), ((d), (d')), ((e), (e'))\) from \(T'_1\) and \(T'_2\) trees \(\tilde{T}_1\) and \(\tilde{T}_2\) which are equal to each other and contain a maximum number of labels

Back to article page