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

Fig. 1

From: Reconstruction of time-consistent species trees

Fig. 1

Taken from [3, Fig. 4]. From the binary gene tree \((T;t,\sigma )\) (right) we obtain the species triplets \(\mathcal {R}(T;t,\sigma ) = \{AB|D,AC|D\}\) . Note, vertices v of T with \(t(v)=\mathfrak {s}\) and \(t(v)=\mathfrak {t}\) are highlighted by “\(\bullet\)” and “\(\triangle\)”, respectively. Transfer edges are marked with an “arrow”. Shown are two (tube-like) species trees (left and middle) where planted roots are omitted that display \(\mathcal {R}(T;t,\sigma )\). Thus, Theorem 1 implies that for both trees a reconciliation map from \((T;t,\sigma )\) exists. The respective reconciliation maps for \((T;t,\sigma )\) and the species tree are given implicitly by drawing \((T;t,\sigma )\) within the species tree. The left species tree S is least resolved for \(\mathcal {R}(T;t,\sigma )\). The reconciliation map from \((T;t,\sigma )\) to S is unique, however, not time-consistent. Thus, no time-consistent reconciliation between T and S exists at all. On the other hand, for T and the middle species tree (that is a refinement of S) there is a time-consistent reconciliation map

Back to article page