Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Computing the minimum number of hybridization events for a consistent evolutionary history
Discrete Applied Mathematics
Hybridization in Nonbinary Trees
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Computing galled networks from real data
Bioinformatics
Phylogenetic networks do not need to be complex
Bioinformatics
Bioinformatics
Phylogenetic Networks: Concepts, Algorithms and Applications
Phylogenetic Networks: Concepts, Algorithms and Applications
On the Elusiveness of Clusters
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Fast computation of minimum hybridization networks
Bioinformatics
| Hi-index | 0.00 |
Here, we present a new fixed parameter tractable algorithm to compute the hybridization number $(r)$ of two rooted, not necessarily binary phylogenetic trees on taxon set $({{\cal X}})$ in time $((6^r r!) \cdot poly(n))$, where $(n=\vert {{\cal X}}\vert)$. The novelty of this approach is its use of terminals, which are maximal elements of a natural partial order on $({{\cal X}})$, and several insights from the softwired clusters literature. This yields a surprisingly simple and practical bounded-search algorithm and offers an alternative perspective on the underlying combinatorial structure of the hybridization number problem.