Algorithms for parameterized maximum agreement forest problem on multiple trees
From MaRDI portal
Publication:744101
Recommendations
- Parameterized algorithms for maximum agreement forest on multiple trees
- Approximation algorithms for maximum agreement forest on multiple trees
- Approximating maximum agreement forest on multiple binary trees
- Parameterized and approximation algorithms for the MAF problem in multifurcating trees
- A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees
Cites work
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- A 3-approximation algorithm for the subtree distance between phylogenies
- A faster FPT algorithm for the maximum agreement forest problem
- Approximating the maximum agreement forest on \(k\) trees
- Comparison of phylogenetic trees
- Faster exact computation of rSPR distance
- Fixed-parameter algorithms for maximum agreement forests
- On the complexity of comparing evolutionary trees
- On the computational complexity of the rooted subtree prune and regraft distance
- Parameterized and approximation algorithms for the MAF problem in multifurcating trees
- Subtree transfer operations and their induced metrics on evolutionary trees
- The maximum agreement forest problem: Approximation algorithms and computational experiments
Cited in
(12)- Fixed-parameter algorithms for maximum agreement forests
- Fixed-parameter and approximation algorithms for maximum agreement forests of multifurcating trees
- Parameterized and approximation algorithms for the MAF problem in multifurcating trees
- Approximating the maximum agreement forest on \(k\) trees
- Kernelization and parameterized algorithms for covering a tree by a set of stars or paths
- Approximating maximum agreement forest on multiple binary trees
- A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees
- Parameterized algorithms for maximum agreement forest on multiple trees
- Computing maximum agreement forests without cluster partitioning is folly
- Approximation algorithms for maximum agreement forest on multiple trees
- Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees
- A faster FPT algorithm for the maximum agreement forest problem
This page was built for publication: Algorithms for parameterized maximum agreement forest problem on multiple trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744101)