Figure 3.

An example of execution of Algorithm 1 on the tree G in Figure 2(a) and the network N in Figure 1(a). (a) $G_{B_1}$ and a switching of N(B₁) on which its reconciliation with $G_{B_1}$ contains 1 duplication and 2 losses. (b) $G_{B_2}$ and a switching of N(B₂) on which the reconciliation with $G_{B_2}$ contains one loss. (c) $G_{B_3}$ and a switching of N(B₃) on which the reconciliation with $G_{B_3}$ contains 2 losses.