Improved approximation algorithm for maximum agreement forest of two trees

DOI10.1007/978-3-319-08016-1_19MaRDI QIDQ3188849zbMATH OpenOpenAlexFDO

Authors Feng Shi, Jie You, Qilong Feng

Publication date 2 September 2014

Published in Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-08016-1_19

Mathematics Subject Classification ID

Approximation algorithms (68W25) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Problems related to evolution (92D15)

Recommendations

• Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees
• Approximation algorithms for maximum agreement forest on multiple trees
• Approximating maximum agreement forest on multiple binary trees
• Approximation algorithms for nonbinary agreement forests
• A faster FPT algorithm for the maximum agreement forest problem

Cited in

(11)

• The maximum agreement forest problem: Approximation algorithms and computational experiments
• A faster FPT algorithm for the maximum agreement forest problem
• A duality based 2-approximation algorithm for maximum agreement forest
• Approximation algorithms for maximum agreement forest on multiple trees
• Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees
• A duality based 2-approximation algorithm for maximum agreement forest
• scientific article; zbMATH DE number 1833410 (Why is no real title available?)
• Approximation algorithms for nonbinary agreement forests
• Computing maximum agreement forests without cluster partitioning is folly
• Approximating maximum agreement forest on multiple binary trees
• Approximating the maximum agreement forest on k trees

This page was built for publication: Improved approximation algorithm for maximum agreement forest of two trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3188849)