Skip to main content


Figure 3 | Biology Direct

Figure 3

From: Cubic time algorithms of amalgamating gene trees and building evolutionary scenarios

Figure 3

Tree S ( V ) for a fixed partition V = V 1 + V 2 . Here V, V1, V2 designates both the corresponding vertex and the edge upwards from this vertex. Trees S(V1) and S(V2), as well as their costs c(V1) and c(V2), are already known from induction, and C d + C l corresponds to evolutionary events in edges of V, V1, V2. Those are not known from induction and should be computed separately, as defined below in the text.

Back to article page