Fig. 3
From: On the complexity of non-binary tree reconciliation with endosymbiotic gene transfer
(1) A species tree S on \(\Sigma = \{A,B,C\}\); (2) A binary gene tree G where leaves are identified by a species mapping s, and a b-Constraint (M, I) where \(I= r(G)\); (3) An optimal DL-Reconciliation of G with S; (4) The tree G accompanied with the arrays computed by Algorithm 6 (we consider here the costs \(\delta = \lambda = 1\) and \(\rho = \tau = 2\)) and the pointers for an optimal solution; (5) The optimal DLE-Reconciliation \({\mathcal {R}}_{DLE}(G,S)\) of \(\langle G,s_L,b_L\rangle\) (where \(b_L\) is consistent with (M, I)) returned by Algorithm 5. The cost \(minCostTransfer({\mathcal {R}}_{DLE}(G,S))\) is 3. Events are represented as in Fig. 1