Skip to main content
Fig. 3 | BMC Bioinformatics

Fig. 3

From: DTL reconciliation repair

Fig. 3

a The reconciliation from Fig. 2 with unimportant edges removed and edges directed from parent to children nodes. b The temporal feasibility graph for this reconciliation. c A cycle in the temporal feasibility graph with a minimal vertex g in the gene tree. d The modified reconciliation after vertex g is pulled up one level in the species tree. e The resulting temporal feasibility graph is acyclic and thus the resulting reconciliation is temporally feasible

Back to article page