Skip to main content
Fig. 6 | BMC Bioinformatics

Fig. 6

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

Fig. 6

An illustration of how the insertion of the input trees is conducted by the algorithm ALLHNETWORKS in respect of the parameter k bounding the maximal reticulation number of resulting networks. Beginning with the first input tree T 1, repeatedly, first, an embedded tree T of a so far computed network N is extracted, and, second, the current input tree T i is inserted into N by sequentially adding the components of a maximum acyclic agreement forest for T and T i . As soon as the reticulation number of a so far computed network exceeds k one can be sure that this network cannot lead to a network with reticulation number smaller or equal to k and, thus, the corresponding computational path can be aborted

Back to article page