Pages that link to "Item:Q5233752"
From MaRDI portal
The following pages link to A Tight Kernel for Computing the Tree Bisection and Reconnection Distance between Two Phylogenetic Trees (Q5233752):
Displaying 6 items.
- Reflections on kernelizing and computing unrooted agreement forests (Q2069261) (← links)
- New reduction rules for the tree bisection and reconnection distance (Q2210581) (← links)
- Maximum parsimony distance on phylogenetic trees: a linear kernel and constant factor approximation algorithm (Q2221808) (← links)
- Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance (Q2680228) (← links)
- A near-linear kernel for bounded-state parsimony distance (Q6142596) (← links)
- Deep kernelization for the tree bisection and reconnection (TBR) distance in phylogenetics (Q6152184) (← links)
