On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems
Sylvain Guillemot, Francois Nicolas, Vincent Berry, Christophe Paul
TL;DR
This paper investigates the computational difficulty of finding the largest agreement subtree and compatible tree in phylogenetic analysis, providing insights into their approximability limits.
Contribution
It offers new theoretical bounds and approximation algorithms for the Maximum Agreement SubTree and Maximum Compatible Tree problems.
Findings
Established hardness of approximation results
Developed improved approximation algorithms
Provided bounds on approximation ratios
Abstract
This paper has been withdrawn by the corresponding author because the newest version is now published in Discrete Applied Mathematics.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.