Skip to main content

Advertisement

Fig. 10 | Algorithms for Molecular Biology

Fig. 10

From: Towards sub-quadratic time and space complexity solutions for the dated tree reconciliation problem

Fig. 10

Running time analysis for the biological data set. Comparison of running times of Bansal et al.’s reconciliation algorithm and the Node Mapping algorithm over a set of previously published biological data. The plot on the left is each algorithms running time in reference to the number of host taxa in each data set while the plot on the right is each algorithms running time in reference to the total number of taxa in the tanglegram considered

Back to article page