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

Fig. 8

From: Relative timing information and orthology in evolutionary scenarios

Fig. 8

A A properly-colored perfect graph \((G, \sigma )\) on 8 vertices that is not an EDT graph. Next to the graph, the possible topologies of the species tree that are implied by the induced \(P_4\) according to Lemma 20 are shown. B A properly-colored cograph \((G',\sigma ')\) that is not an EDT graph. All possible assignments for the edges ac and ad are shown on the right-hand side together with the informative triples that they imply for the species tree according to Prop. 2. The assignment of the gray edges do not affect the respective triple

Back to article page