A near-linear kernel for bounded-state parsimony distance
From MaRDI portal
Publication:6142596
DOI10.1016/j.jcss.2023.103477arXiv2211.00378MaRDI QIDQ6142596
No author found.
Publication date: 4 January 2024
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.00378
distance measureparsimonyphylogenetic treeparameterized complexitykernelizationphylogeneticsmaximum parsimony distance
Related Items (1)
Cites Work
- On the maximum parsimony distance between phylogenetic trees
- Reduction rules for the maximum parsimony distance on phylogenetic trees
- A note on convex characters, Fibonacci numbers and exponential-time algorithms
- On the complexity of computing MP distance between binary phylogenetic trees
- On the computational complexity of the rooted subtree prune and regraft distance
- Reflections on kernelizing and computing unrooted agreement forests
- Maximum parsimony distance on phylogenetic trees: a linear kernel and constant factor approximation algorithm
- A parsimony-based metric for phylogenetic trees
- 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
This page was built for publication: A near-linear kernel for bounded-state parsimony distance
