Fig. 2From: Median quartet tree search algorithms using optimal subtree prune and regraftE1 Results. Running time versus A the query subtree size (m) or B the total tree size (n). We fix \(n=500\) in A and limit \(30< m < 70\) in B. Figures are log-log scale. Thus, the shown line slope is an empirical estimate of the asymptotic running time polynomial degree. Here, tripVote refers to the method described in Observation 2Back to article page