Fig. 4

The DLCparETO algorithm, stitching together tiles. Example continued from Figs. 2 and 3. The dynamic programming structure for merging Pareto-optimal event counts across species, completed via post-order traversal of the species tree. Solutions F^s(t,·) (and F^s(t,b)) for sub-problems denote the set of Pareto-optimal event counts for the subtree rooted at species s with top loci t (and bottom loci b). Colored boxes indicate which tile from Fig. 3 and which bottom loci are used. The algorithm terminates at the species tree root and returns the set of Pareto-optimal event counts for the reconciliation of G and S. [Figure and caption adapted with permission from Du et al. [11] and Wu et al. [10]. Gray boxes indicate new content]