A faster FPT algorithm for the maximum agreement forest problem
From MaRDI portal
Publication:2464325
DOI10.1007/s00224-007-1329-zzbMath1148.68049OpenAlexW2062214685MaRDI QIDQ2464325
Catherine McCartin, Michael T. Hallett
Publication date: 19 December 2007
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-007-1329-z
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Problems related to evolution (92D15) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (8)
A Basic Parameterized Complexity Primer ⋮ Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees ⋮ A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees ⋮ The agreement distance of unrooted phylogenetic networks ⋮ Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees ⋮ Approximating maximum agreement forest on multiple binary trees ⋮ Algorithms for parameterized maximum agreement forest problem on multiple trees ⋮ A 3-approximation algorithm for the subtree distance between phylogenies
This page was built for publication: A faster FPT algorithm for the maximum agreement forest problem
