196 research outputs found
When two trees go to war
Rooted phylogenetic networks are often constructed by combining trees,
clusters, triplets or characters into a single network that in some
well-defined sense simultaneously represents them all. We review these four
models and investigate how they are related. In general, the model chosen
influences the minimum number of reticulation events required. However, when
one obtains the input data from two binary trees, we show that the minimum
number of reticulations is independent of the model. The number of
reticulations necessary to represent the trees, triplets, clusters (in the
softwired sense) and characters (with unrestricted multiple crossover
recombination) are all equal. Furthermore, we show that these results also hold
when not the number of reticulations but the level of the constructed network
is minimised. We use these unification results to settle several complexity
questions that have been open in the field for some time. We also give explicit
examples to show that already for data obtained from three binary trees the
models begin to diverge
Kernelizations for the hybridization number problem on multiple nonbinary trees
Given a finite set , a collection of rooted phylogenetic
trees on and an integer , the Hybridization Number problem asks if there
exists a phylogenetic network on that displays all trees from
and has reticulation number at most . We show two kernelization algorithms
for Hybridization Number, with kernel sizes and
respectively, with the number of input trees and their maximum
outdegree. Experiments on simulated data demonstrate the practical relevance of
these kernelization algorithms. In addition, we present an -time
algorithm, with and some computable function of
On the enumeration of leaf-labelled increasing trees with arbitrary node-degree
We consider the counting problem of the number of \textit{leaf-labeled
increasing trees}, where internal nodes may have an arbitrary number of
descendants. The set of all such trees is a discrete representation of the
genealogies obtained under certain population-genetical models such as
multiple-merger coalescents. While the combinatorics of the binary trees among
those are well understood, for the number of all trees only an approximate
asymptotic formula is known. In this work, we validate this formula up to
constant terms and compare the asymptotic behavior of the number of all
leaf-labelled increasing trees to that of binary, ternary and quaternary trees
- …