Skip to main content
. 2019 Jul 5;35(14):i408–i416. doi: 10.1093/bioinformatics/btz312

Fig. 3.

Fig. 3.

Coordinate ascent (CA) algorithm computes consensus trees with similar mean distance as the MILP algorithm in only a fraction of the time. (a) Number of trees for each class of simulated instances. (b) Mean normalized distance for solutions for each method. (c) Running time in seconds for each method (logarithmic scale)