Skip to main content
Fig. 4 | Algorithms for Molecular Biology

Fig. 4

From: Isometric gene tree reconciliation revisited

Fig. 4

A counter-example for the original definition of isometric reconciliation. Trees \(G_I\) and \(S_I\) are the input trees, G is the rooted version of \(G_I\) and S is \(S_I\) with duplication nodes added. This reconciliation satisfies Definition 7, but it does not correspond to any evolutionary history

Back to article page

Algorithms for Molecular Biology

ISSN: 1748-7188