Algorithms for parameterized maximum agreement forest problem on multiple trees

DOI10.1016/j.tcs.2013.12.025zbMath1382.68181OpenAlexW2048978656MaRDI QIDQ744101

Qilong Feng, Jianxin Wang, Feng Shi, Jiong Guo, Jian'er Chen

Publication date: 6 October 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.12.025

zbMATH Keywords

phylogenetic treefixed-parameter tractabilitymaximum agreement forest

Mathematics Subject Classification ID

Problems related to evolution (92D15) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees ⋮ Kernelization and parameterized algorithms for covering a tree by a set of stars or paths ⋮ Approximating maximum agreement forest on multiple binary trees

Cites Work

• Unnamed Item
• Approximating the maximum agreement forest on \(k\) trees
• A 3-approximation algorithm for the subtree distance between phylogenies
• The maximum agreement forest problem: Approximation algorithms and computational experiments
• Comparison of phylogenetic trees
• On the computational complexity of the rooted subtree prune and regraft distance
• A faster FPT algorithm for the maximum agreement forest problem
• Fixed-Parameter Algorithms for Maximum Agreement Forests
• Parameterized and Approximation Algorithms for the MAF Problem in Multifurcating Trees
• 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: Algorithms for parameterized maximum agreement forest problem on multiple trees