Computing Maximum Agreement Forests without Cluster Partitioning is Folly
From MaRDI portal
Publication:5111745
DOI10.4230/LIPICS.ESA.2017.56zbMATH Open1442.68287OpenAlexW2758315610MaRDI QIDQ5111745FDOQ5111745
Publication date: 27 May 2020
Full work available at URL: https://doi.org/10.4230/LIPIcs.ESA.2017.56
Problems related to evolution (92D15) Trees (05C05) Analysis of algorithms (68W40) Parameterized complexity, tractability and kernelization (68Q27)
Cites Work
- Fixed-parameter algorithms for maximum agreement forests
- On the computational complexity of the rooted subtree prune and regraft distance
- Approximation Algorithms for Nonbinary Agreement Forests
- A cluster reduction for computing the subtree distance between phylogenies
- Bounding the number of hybridisation events for a consistent evolutionary history
- Fixed-parameter and approximation algorithms for maximum agreement forests of multifurcating trees
- Computing the minimum number of hybridization events for a consistent evolutionary history
- A quadratic kernel for computing the hybridization number of multiple trees
- Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable
- On the fixed parameter tractability of agreement-based phylogenetic distances
- Improved Approximation Algorithm for Maximum Agreement Forest of Two Trees
- Computing Maximum Agreement Forests without Cluster Partitioning is Folly
Cited In (3)
Uses Software
This page was built for publication: Computing Maximum Agreement Forests without Cluster Partitioning is Folly
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111745)
