Parameterized algorithms for maximum agreement forest on multiple trees
From MaRDI portal
Publication:4925271
DOI10.1007/978-3-642-38768-5_50zbMATH Open1382.68124OpenAlexW104537753MaRDI QIDQ4925271FDOQ4925271
Authors: Feng Shi, Qilong Feng, Jianxin Wang, Jianer Chen
Publication date: 11 June 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38768-5_50
Recommendations
- Algorithms for parameterized maximum agreement forest problem on multiple trees
- Approximating maximum agreement forest on multiple binary trees
- Approximation algorithms for maximum agreement forest on multiple 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
Problems related to evolution (92D15) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)
Cited In (9)
- Parameterized and approximation algorithms for the MAF problem in multifurcating trees
- Fixed-parameter and approximation algorithms for maximum agreement forests of multifurcating trees
- Fixed-parameter algorithms for maximum agreement forests
- Approximating maximum agreement forest on multiple binary trees
- Algorithms for parameterized maximum agreement forest problem on multiple trees
- Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees
- A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees
- Computing maximum agreement forests without cluster partitioning is folly
- Approximation algorithms for maximum agreement forest on multiple trees
This page was built for publication: Parameterized algorithms for maximum agreement forest on multiple trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4925271)