Some approximation results for the maximum agreement forest problem

DOI10.1007/3-540-44666-4_19MaRDI QIDQ4780791zbMATH OpenFDO

Authors Estela M. Rodrigues, Marie-France Sagot, Yoshiko Wakabayashi

Publication date 21 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2129/21290159

Mathematics Subject Classification ID

Trees (05C05) Complexity and performance of numerical algorithms (65Y20) Problems related to evolution (92D15)

Recommendations

• The maximum agreement forest problem: Approximation algorithms and computational experiments
• A duality based 2-approximation algorithm for maximum agreement forest
• A duality based 2-approximation algorithm for maximum agreement forest
• Improved approximation algorithm for maximum agreement forest of two trees
• Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees

Cited in

(17)

• A 3-approximation algorithm for the subtree distance between phylogenies
• The maximum agreement forest problem: Approximation algorithms and computational experiments
• A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees
• A faster FPT algorithm for the maximum agreement forest problem
• A duality based 2-approximation algorithm for maximum agreement forest
• Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees
• A Sublinear-Time Randomized Approximation Scheme for the Robinson-Foulds Metric
• APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD
• A duality based 2-approximation algorithm for maximum agreement forest
• scientific article; zbMATH DE number 742977 (Why is no real title available?)
• Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees
• The agreement distance of rooted phylogenetic networks
• On agreement forests
• Agreement forests of caterpillar trees: complexity, kernelization and branching
• Approximating maximum agreement forest on multiple binary trees
• Approximating the maximum agreement forest on k trees
• Computing the minimum number of hybridization events for a consistent evolutionary history

This page was built for publication: Some approximation results for the maximum agreement forest problem

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