Skip to main content
Fig. 12 | BMC Bioinformatics

Fig. 12

From: Computing all hybridization networks for multiple binary phylogenetic input trees

Fig. 12

The figure shows the number of tree sets that could be computed within the runtime given on the x-axis by considering the real-runtime of PIRN and both real- and user-runtime of Hybroscale. Only the rightmost bar group reveals that the massive parallelization with 16 cores can significantly improve the runtime of Hybroscale in this case. Note that this is, on the one hand, due to the low time limit of just 20 minutes and, on the other hand, due to the low computational complexity of the considered tree sets

Back to article page