Pages that link to "Item:Q295644"
From MaRDI portal
The following pages link to Kernelizations for the hybridization number problem on multiple nonbinary trees (Q295644):
Displaying 11 items.
- Treewidth distance on phylogenetic trees (Q1637220) (← links)
- Deciding the existence of a cherry-picking sequence is hard on two trees (Q1741507) (← links)
- On unrooted and root-uncertain variants of several well-known phylogenetic network problems (Q1755726) (← links)
- Reflections on kernelizing and computing unrooted agreement forests (Q2069261) (← links)
- A practical fixed-parameter algorithm for constructing tree-child networks from multiple binary trees (Q2118383) (← links)
- New FPT algorithms for finding the temporal hybridization number for sets of phylogenetic trees (Q2149104) (← links)
- Not all phylogenetic networks are leaf-reconstructible (Q2330626) (← links)
- Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance (Q2680228) (← links)
- Treewidth of display graphs: bounds, brambles and applications (Q5233142) (← links)
- A Tight Kernel for Computing the Tree Bisection and Reconnection Distance between Two Phylogenetic Trees (Q5233752) (← links)
- Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks (Q5377037) (← links)
