Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees
From MaRDI portal
Publication:476897
Recommendations
- 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
- Fixed-parameter and approximation algorithms for maximum agreement forests of multifurcating trees
- Algorithms for parameterized maximum agreement forest problem on multiple trees
- Parameterized algorithms for maximum agreement forest on multiple trees
Cites work
- scientific article; zbMATH DE number 1003280 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 1833410 (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
- Fixed-parameter algorithms for maximum agreement forests
- Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms
- On the complexity of comparing evolutionary trees
- On the computational complexity of the rooted subtree prune and regraft distance
- On the linear-cost subtree-transfer distance between phylogenetic trees
- Subtree transfer operations and their induced metrics on evolutionary trees
- The maximum agreement forest problem: Approximation algorithms and computational experiments
Cited in
(20)- Fixed-parameter algorithms for maximum agreement forests
- New reduction rules for the tree bisection and reconnection distance
- Deep kernelization for the tree bisection and reconnection (TBR) distance in phylogenetics
- Fixed-parameter and approximation algorithms for maximum agreement forests of multifurcating trees
- MUL-tree pruning for consistency and optimal reconciliation -- complexity and algorithms
- Convex Characters, Algorithms, and Matchings
- Parameterized and approximation algorithms for the MAF problem in multifurcating trees
- The agreement distance of unrooted phylogenetic networks
- Maximum parsimony distance on phylogenetic trees: a linear kernel and constant factor approximation algorithm
- A tight kernel for computing the tree bisection and reconnection distance between two phylogenetic trees
- A duality based 2-approximation algorithm for maximum agreement forest
- Approximating maximum agreement forest on multiple binary trees
- A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees
- A note on convex characters, Fibonacci numbers and exponential-time algorithms
- Reduction rules for the maximum parsimony distance on phylogenetic trees
- Reflections on kernelizing and computing unrooted agreement forests
- On the subnet prune and regraft distance
- On unrooted and root-uncertain variants of several well-known phylogenetic network problems
- The maximum agreement forest problem: Approximation algorithms and computational experiments
- A faster FPT algorithm for the maximum agreement forest problem
This page was built for publication: Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476897)
