Skip to main content


Fig. 3 | Algorithms for Molecular Biology

Fig. 3

From: Isometric gene tree reconciliation revisited

Fig. 3

An example of isometric reconciliation. The underlying history, depicted in the diagram on the right, consists of two speciations, one duplication and two losses. The two input trees \(G_I\) and \(S_I\) are shown on the left. Note that \(G_I\) does not contain the lost genes. Reconciliation results in a new species tree S, in which a new node for duplication was added. Isometric mapping \(\Phi \) is shown as labels in tree S. Input leaf mapping \(\mu \) agrees with leaf labels and is shown for completeness as labels in tree \(S_I\)

Back to article page