Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance
From MaRDI portal
Publication:2680228
DOI10.1016/j.ipl.2022.106336OpenAlexW4304124149MaRDI QIDQ2680228
Ruben Meuwese, Simone Linz, Steven Kelk
Publication date: 30 January 2023
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.09904
graph algorithmsfixed-parameter tractabilitysubtree prune and regraftkernelizationphylogenetic tree and network
Related Items (1)
Cites Work
- On the maximum parsimony distance between phylogenetic trees
- Kernelizations for the hybridization number problem on multiple nonbinary trees
- Computing the minimum number of hybridization events for a consistent evolutionary history
- On unrooted and root-uncertain variants of several well-known phylogenetic network problems
- On the computational complexity of the rooted subtree prune and regraft distance
- New reduction rules for the tree bisection and reconnection distance
- A parsimony-based metric for phylogenetic trees
- Bounding the number of hybridisation events for a consistent evolutionary history
- A quadratic kernel for computing the hybridization number of multiple trees
- Phylogeny
- Fixed-Parameter Algorithms for Maximum Agreement Forests
- Kernelization
- Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set
- A Tight Kernel for Computing the Tree Bisection and Reconnection Distance between Two Phylogenetic Trees
- Subtree transfer operations and their induced metrics on evolutionary trees
- On the complexity of comparing evolutionary trees
This page was built for publication: Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance
