Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees
DOI10.1007/S10878-015-9921-7zbMATH Open1378.90085OpenAlexW798279669MaRDI QIDQ328699FDOQ328699
Authors: Feng Shi, Qilong Feng, Jie You, Jianxin Wang 
Publication date: 20 October 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9921-7
Recommendations
- Improved approximation algorithm for maximum agreement forest of two trees
- Approximating maximum agreement forest on multiple binary trees
- Approximation algorithms for maximum agreement forest on multiple trees
- Approximation algorithms for nonbinary agreement forests
- A faster FPT algorithm for the maximum agreement forest problem
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Problems related to evolution (92D15) Approximation algorithms (68W25)
Cites Work
- Fixed-parameter algorithms for maximum agreement forests
- Comparison of phylogenetic trees
- Ricci-Ollivier curvature of the rooted phylogenetic subtree-prune-regraft graph
- On the computational complexity of the rooted subtree prune and regraft distance
- Subtree transfer operations and their induced metrics on evolutionary trees
- On the complexity of comparing evolutionary trees
- The maximum agreement forest problem: Approximation algorithms and computational experiments
- Approximation algorithms for nonbinary agreement forests
- A 3-approximation algorithm for the subtree distance between phylogenies
- Bounding the number of hybridisation events for a consistent evolutionary history
- Fixed-parameter and approximation algorithms for maximum agreement forests of multifurcating trees
- A faster FPT algorithm for the maximum agreement forest problem
- Approximation algorithms for maximum agreement forest on multiple trees
- Title not available (Why is that?)
- Approximating the maximum agreement forest on \(k\) trees
Cited In (12)
- The maximum agreement forest problem: Approximation algorithms and computational experiments
- Approximating maximum agreement forest on multiple binary trees
- Approximation algorithms for nonbinary agreement forests
- Title not available (Why is that?)
- A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees
- Improved approximation algorithm for maximum agreement forest of two trees
- Approximating the maximum agreement forest on \(k\) trees
- Gene tree reconciliation including transfers with replacement is NP-hard and FPT
- An improved approximation algorithm for rSPR distance
- A duality based 2-approximation algorithm for maximum agreement forest
- Approximation algorithms for maximum agreement forest on multiple trees
- A duality based 2-approximation algorithm for maximum agreement forest
Uses Software
This page was built for publication: Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q328699)
