- document
-
Borst, Sander (author), van Iersel, L.J.J. (author), Jones, M.E.L. (author), Kelk, Steven (author)We study the problem of finding a temporal hybridization network containing at most k reticulations, for an input consisting of a set of phylogenetic trees. First, we introduce an FPT algorithm for the problem on an arbitrary set of m binary trees with n leaves each with a running time of O(5 <sup>k</sup>· n· m). We also present the concept...journal article 2022
- document
-
van Iersel, L.J.J. (author), Moulton, V.L. (author)An important problem in evolutionary biology is to reconstruct the evolutionary history of a set X of species. This history is often represented as a phylogenetic network, that is, a connected graph with leaves labelled by elements in X (for example, an evolutionary tree), which is usually also binary, i.e., all vertices have degree 1 or 3. A...journal article 2018