Skip to main content


Figure 6 | Algorithms for Molecular Biology

Figure 6

From: Recursive algorithms for phylogenetic tree counting

Figure 6

Defining matrices m and M . Two trees that resolve a constraint tree from Figure‚ÄČ4 (only resolutions of subtree 2 are shown) and three ways to draw a horizontal line. The yellow lines correspond to the minimal number of intersections and the red line, to maximal. Thus, m 2,2 =2 and M 2,2 =3. We can also note that m 1,2 =M 1,2 =1.

Back to article page