Fig. 2
From: On the complexity of non-binary tree reconciliation with endosymbiotic gene transfer
(1) A binary refinement \(\langle G,s_L\rangle\) of the multifurcated tree of Fig. 1.(2) and the corresponding b-constraint labeling (M, I): I is the set of nodes indicated by crosses, and for each such node x, M(x) is the table represented at that node; (2) The \(b_L\) assignment leading to the optimal DLE-Reconciliation, also represented in Fig. 1.(6). Here, the compressed DLE-Reconciliation is illustrated, where the edge labeled P is the only one where an EGTL event is present