Fixed-parameter and approximation algorithms for maximum agreement forests of multifurcating trees
From MaRDI portal
Publication:270010
DOI10.1007/s00453-015-9983-zzbMath1333.68297arXiv1305.0512OpenAlexW2002094114MaRDI QIDQ270010
Robert G. Beiko, Chris Whidden, Norbert Zeh
Publication date: 6 April 2016
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1305.0512
Related Items (7)
Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees ⋮ A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees ⋮ Gene tree reconciliation including transfers with replacement is NP-hard and FPT ⋮ On the subnet prune and regraft distance ⋮ On the fixed parameter tractability of agreement-based phylogenetic distances ⋮ New Gromov-inspired metrics on phylogenetic tree space ⋮ Computing Maximum Agreement Forests without Cluster Partitioning is Folly
Uses Software
Cites Work
- Unnamed Item
- Computing the minimum number of hybridization events for a consistent evolutionary history
- A 3-approximation algorithm for the subtree distance between phylogenies
- The maximum agreement forest problem: Approximation algorithms and computational experiments
- On the computational complexity of the rooted subtree prune and regraft distance
- Bounding the number of hybridisation events for a consistent evolutionary history
- Fixed-Parameter Algorithms for Maximum Agreement Forests
- Approximation Algorithms for Nonbinary Agreement Forests
- Faster Exact Computation of rSPR Distance
- Subtree transfer operations and their induced metrics on evolutionary trees
- On the complexity of comparing evolutionary trees
This page was built for publication: Fixed-parameter and approximation algorithms for maximum agreement forests of multifurcating trees
