Fig. 1
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 multifurcated gene tree \(G^M\) where leaves are identified by a species mapping \(s_L^M\) (a lowercase letter corresponds to the genome identified by the same uppercase letter) and a b-mapping \(b_L^M\) (the 0–1 index of each leaf); (3) a \(\langle G,s_L\rangle\) binary refinement of \(\langle G^M,s_L^M\rangle\) (i.e. \(\langle G^M,s_L^M,b_L^M\rangle\) ignoring the b-labeling) and (4) a \(\langle G,s_L,b_L\rangle\) binary refinement of \(\langle G^M,s_L^M,b_L^M\rangle\); (5) A DL-Reconciliation of \(\langle G,s_L\rangle\) and (6) a DLE-Reconciliation of \(\langle G,s_L,b_L\rangle\). The internal node labeling corresponds to the LCA-mapping with S, squares correspond to duplications, triangles to EGTs, dotted lines to losses and unary nodes to EGTLs. The s and b-labeling of nodes with a lost child are omitted. For a unitary cost of operations, the DLE-Reconciliation is of cost 9. It is optimal for the DLE-BinL problem