Fig. 9
From: Computing all hybridization networks for multiple binary phylogenetic input trees
The figure shows the mean average runtime corresponding to Hybroscale and PIRNv2.0 grouped by parameter k denoting the hybridization number of the network that was used to obtain the tree set \(\mathcal {T}\) from. Thus, this parameter k acts as an upper bound of the hybridization number of \(\mathcal {T}\). Each percentage indicates the proportion of tree sets that could be computed within the time limit of 20 minutes