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

Fig. 4

From: Treewidth-based algorithms for the small parsimony problem on networks

Fig. 4

Example for the construction of \(\Gamma '\) (middle) from \(\Gamma \) (left) in Lemma 3. Repeated application yields \(\Gamma ^*\) (right), for which \({v\le _{\Gamma ^*} u\Rightarrow u\mathop {\leadsto }\limits ^{G,\Gamma ^*} v}\). The rooted trees \(\Gamma \), \(\Gamma '\), and \(\Gamma ^*\) are drawn with thick, gray lines. Thin, black lines are edges of G. For the indicated node u, the black nodes are in X, that is, they are below u in \(\Gamma \) but not connected to u in \(G[\Gamma _u]\)

Back to article page