Skip to main content


Fig. 4 | Algorithms for Molecular Biology

Fig. 4

From: Time-consistent reconciliation maps and forbidden time travel

Fig. 4

Shown are a gene tree \((T;t,\sigma )\) (right) and two identical (tube-like) species trees S (left and middle). There are two possible reconciliation maps for T and S that are given implicitly by drawing T within the species tree S. The left reconciliation maps each gene tree vertex as high as possible into the species tree. However, in this case only the middle reconciliation map is time-consistent

Back to article page