Skip to main content


Figure 3 | Algorithms for Molecular Biology

Figure 3

From: Reconciling taxonomy and phylogenetic inference: formalism and algorithms for describing discord and inferring taxonomic roots

Figure 3

Recursion example. A possible scenario encountered by the subcoloring recursion. The letters a, b, c and d represent the presence of leaves with those taxonomic labels; asssume these taxonomic labels do not occur elsewhere in the tree. The positions of colors b and c shows that this coloring is not convex, and a recursive subcoloring algorithm must decide at x in which subtrees to allow the b and c colors.

Back to article page