Approximating maximum agreement forest on multiple binary trees
From MaRDI portal
Publication:727962
DOI10.1007/S00453-015-0087-6zbMATH Open1352.68288OpenAlexW2231561873MaRDI QIDQ727962FDOQ727962
Feng Shi, Jianer Chen, Jianxin Wang
Publication date: 21 December 2016
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-015-0087-6
Recommendations
- Approximation algorithms for maximum agreement forest on multiple trees
- Approximating the maximum agreement forest on \(k\) trees
- Parameterized algorithms for maximum agreement forest on multiple trees
- Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees
- Fixed-parameter and approximation algorithms for maximum agreement forests of multifurcating trees
- scientific article; zbMATH DE number 1833410
- Improved approximation algorithm for maximum agreement forest of two trees
- Algorithms for parameterized maximum agreement forest problem on multiple trees
- A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees
- The maximum agreement forest problem: Approximation algorithms and computational experiments
Cites Work
- Fixed-parameter algorithms for maximum agreement forests
- Title not available (Why is that?)
- Title not available (Why is that?)
- Comparison of phylogenetic trees
- On the computational complexity of the rooted subtree prune and regraft distance
- Subtree transfer operations and their induced metrics on evolutionary trees
- On the complexity of comparing evolutionary trees
- The maximum agreement forest problem: Approximation algorithms and computational experiments
- A 3-approximation algorithm for the subtree distance between phylogenies
- Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees
- A faster FPT algorithm for the maximum agreement forest problem
- Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees
- Title not available (Why is that?)
- Approximating the maximum agreement forest on \(k\) trees
- Algorithms for parameterized maximum agreement forest problem on multiple trees
Cited In (12)
- On unrooted and root-uncertain variants of several well-known phylogenetic network problems
- Maximum parsimony distance on phylogenetic trees: a linear kernel and constant factor approximation algorithm
- Parameterized algorithms for edge biclique and related problems
- An improved kernel for max-bisection above tight lower bound
- An improved FPT algorithm for almost forest deletion problem
- Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition
- Improved approximation algorithms for two-stage flowshops scheduling problem
- Gene tree reconciliation including transfers with replacement is NP-hard and FPT
- New kernels for several problems on planar graphs
- The agreement metric for labeled binary trees
- A duality based 2-approximation algorithm for maximum agreement forest
- Dealing with several parameterized problems by random methods
Uses Software
This page was built for publication: Approximating maximum agreement forest on multiple binary trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q727962)
