Pages that link to "Item:Q2450929"
From MaRDI portal
The following pages link to A quadratic kernel for computing the hybridization number of multiple trees (Q2450929):
Displaying 14 items.
- Kernelizations for the hybridization number problem on multiple nonbinary trees (Q295644) (← links)
- Computing the minimum number of hybridization events for a consistent evolutionary history (Q881571) (← links)
- Treewidth distance on phylogenetic trees (Q1637220) (← links)
- A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees (Q1671997) (← links)
- Attaching leaves and picking cherries to characterise the hybridisation number for a set of phylogenies (Q1738320) (← links)
- On unrooted and root-uncertain variants of several well-known phylogenetic network problems (Q1755726) (← links)
- A practical fixed-parameter algorithm for constructing tree-child networks from multiple binary trees (Q2118383) (← links)
- Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance (Q2680228) (← links)
- Hybridization number on three rooted binary trees is EPT (Q2818206) (← links)
- Heading in the right direction? Using head moves to traverse phylogenetic network space (Q4994346) (← links)
- Combining Networks Using Cherry Picking Sequences (Q5041128) (← links)
- Computing Maximum Agreement Forests without Cluster Partitioning is Folly (Q5111745) (← links)
- A Tight Kernel for Computing the Tree Bisection and Reconnection Distance between Two Phylogenetic Trees (Q5233752) (← links)
- Embedding phylogenetic trees in networks of low treewidth (Q6599789) (← links)
