Figure 3

Example of a DTL reconciliation. (a) A gene tree G, represented with lost copies of the gene (∘), and a subdivided species tree S^′. (b) A reconciliation α between G and S^′. The reconciliation maps each node of G onto a sequence of nodes in S^′, inducing evolutionary events. For instance, nodes w,d₁ and u from G are mapped as follows: α(w) = [y], where α₁(w) = y is an event; α(d₁) = [x^′,x,D], where α₁(d₁) = x^′ is a $\mathbb{T}\mathbb{L}$ event, α₂(d₁) = x is an $\mathbb{S}\mathbb{L}$ event, and α₃(d₁) = D is a event; α(u) = [y^′,x,C], where α₁(u) = y^′, α₂(u) = x, and α₃(u) = C are respectively a , an $\mathbb{S}\mathbb{L}$, and a event.