- 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
-
Borst, Sander (author)We study the problem of finding a temporal hybridization network for a set of phylogenetic trees that minimizes the number of reticulations. First, we introduce an FPT algorithm for this problem on an arbitrary set of t binary trees with n leaves each with a running time of O(5^k*n*m) where k is the minimum temporal hybridization number. We also...master thesis 2020