Skip to main content
Figure 4 | Algorithms for Molecular Biology

Figure 4

From: Constructing perfect phylogenies and proper triangulations for three-state characters

Figure 4

Bounding minimal separators of proper minimal triangulations. An example of the bound in Lemma 4.8. H has five minimal separators, obtained from every pair of vertices from the set { χ 1 1 , χ 2 2 , χ 0 3 , χ 0 4 } except { χ 1 1 , χ 0 4 } . There are four taxa, so Lemma 4.8 gives an upper bound of five minimal separators. Therefore, the bound in Lemma 4.8 is tight for n = 4 taxa.

Back to article page