Figure 2From: Fast algorithms and heuristics for phylogenomics under ILS and hybridizationThe running times (ln of number seconds) of the MUL-tree based ( t ( MUL )), and AC-based ( t ( AC )) methods for computing parsimonious reconciliations, as well as the speedup log 10 ( t ( MUL ) /t ( AC )).Back to article page