Pages that link to "Item:Q1755726"
From MaRDI portal
The following pages link to On unrooted and root-uncertain variants of several well-known phylogenetic network problems (Q1755726):
Displaying 12 items.
- On the fixed parameter tractability of agreement-based phylogenetic distances (Q504072) (← links)
- Tree-based unrooted phylogenetic networks (Q1742650) (← links)
- Non-essential arcs in phylogenetic networks (Q2136848) (← links)
- New reduction rules for the tree bisection and reconnection distance (Q2210581) (← links)
- Uprooted phylogenetic networks (Q2408571) (← links)
- Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance (Q2680228) (← links)
- A QUBO formulation for the tree containment problem (Q2699952) (← 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)
- Orienting undirected phylogenetic networks (Q6142597) (← links)
- Deep kernelization for the tree bisection and reconnection (TBR) distance in phylogenetics (Q6152184) (← links)
- Embedding phylogenetic trees in networks of low treewidth (Q6599789) (← links)
