Skip to main content
. 2014 Jan 1;21(1):89–98. doi: 10.1089/cmb.2013.0078

FIG. 2.

FIG. 2.

Performance of DrML. (Left diagram) The performance of the main phases of DrML for randomly generated instances of uniquely labeled gene and species trees with the same set of leaf labels: DP (option −dm) - computing log L value by the dynamic programming algorithm; DP + validation (option −dr) - inferring optimal scenarios for non-hard instances, and full (option −dh). (Right diagram) The percentage of hard instances with the average number of branch and bound steps required to resolve a given hard instance. The values on the x-axis denote the number of leaves in a single tree.