Figure 3
From: Maximum likelihood models and algorithms for gene tree evolution with duplications and losses
Experimental results. [Top part] Performance of DrML prototype. The left diagram presents the performance of DP Algorithm DP1 and DP with validation. The middle diagram shows the percentage of hard instances with the average validation time. The right diagram depicts the average time of computations for hard instances and the average number of branch and bound steps. [Bottom part] An optimal reconciliation for the empirical tree. Arrows denote the duplications that are not present in the lca-reconciliation.