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

Fig. 10

From: Statistically consistent divide-and-conquer pipelines for phylogeny estimation using NJMerge

Fig. 10

RAxML vs. NJMerge given RAxML constraint trees and and average gene tree internode distance (AGID) matrix. Subplots on top row show species tree estimation error (defined as the normalized RF distance between true and estimated species trees); note that gray bars represent medians, gray squares represent means, gray circles represent outliers, box plots are defined by quartiles (extending from the first to the third quartiles), and whiskers extend to plus/minus 1.5 times the interquartile distance (unless greater/less than the maximum/minimum value). Subplots on bottom row show running time (in minutes); bars represent means and error bars represent standard deviations across replicate datasets. NJMerge running times are for computing the subset trees “in serial”; see Eq. (1) in the main text for more information. The numbers of replicates on which the methods completed is shown on the x-axis, e.g., \(N=X,Y\) indicates that RAxML completed on X out of 20 replicates and that NJMerge(\({\mathcal {T}}_{RAX},D_{AGID}\)) completed on Y out of 20 replicates. RAxML was only able to run on 1/40 intron-like datasets with 1000 taxa due to “Out of Memory” errors

Back to article page