Skip to main content
Fig. 3 | BMC Bioinformatics

Fig. 3

From: Inferring Pareto-optimal reconciliations across multiple event costs under the duplication-loss-coalescence model

Fig. 3

The DLCparETO algorithm, enumerating tiles. Example continued from Fig. 2. Tiles for each species enumerated via pre-order traversal of the species tree. Each tile consists of a sub-locus map with a singleton set of one event count v=〈d,,c〉 comprising the number of duplications, losses, and coalescences. v is Pareto-optimal for the sub-locus map across all partial orders. (The algorithm tracks descriptors rather than event counts, but for simplicity, only event counts are shown.) To propagate locus assignments across species, the set of top loci t and bottom loci b for each tile are compactly represented. Each unique relative locus pair (t,b) is associated with a set Cs(t,b) of Pareto-optimal event counts. In this example, species B and C have the same set of tiles, though in practice, these tiles are enumerated separately. [Figure and caption adapted with permission from Du et al. [11] and Wu et al. [10]. Gray boxes indicate new content]

Back to article page