First FPT algorithm for minimum-reticulation tree-child networks from multiple binary trees via cherry-picking sequences, running in O((8k)^k poly(n,t)) time with a practical parallel version.
Attaching leaves and picking cherries to characterise the hybridisation number for a set of phylogenies
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees
First FPT algorithm for minimum-reticulation tree-child networks from multiple binary trees via cherry-picking sequences, running in O((8k)^k poly(n,t)) time with a practical parallel version.