Skip to main content
Fig. 5 | Algorithms for Molecular Biology

Fig. 5

From: Median quartet tree search algorithms using optimal subtree prune and regraft

Fig. 5

E4 Results. A For each input model condition, we show the percentage of the replicates with improved quartet scores, starting from either ASTER or ASTRAL-III trees. B Improvement in the quartet score of the Q-SPR algorithm above the ASTER tree (under the High ILS model condition and \(k=50\)) with respect to the gene trees versus the improvement in the normalized RF or the quartet distance between the ASTER tree and the true species tree. The number of SPR rounds performed for each replicate is shown in colors. Restricted to high ILS, 50 genes, ASTER; see Additional file 1: Fig. S3 for all model conditions. C The difference between the normalized RF and the quartet distance of the Q-SPR tree and the starting tree with respect to the true species tree for all tested conditions. Positive (negative) values indicate an improvement (reduction) in the accuracy of the starting tree. D The normalized quartet score between the Q-SPR tree at the end of each SPR round and the gene trees under the High ILS (ILS rate \(= 500k\)) model conditions. The final improvement of the Q-SPR tree with respect to the true species tree is shown in colors. See Additional file 1: Fig. S2 for full results.

Back to article page