Approximation Algorithms for Nonbinary Agreement Forests

DOI10.1137/120903567zbMath1311.68193arXiv1210.3211OpenAlexW1634898999MaRDI QIDQ4979822

Leo van Iersel, Nela Lekić, Steven Kelk, Leen Stougie

Publication date: 19 June 2014

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.3211

zbMATH Keywords

approximation algorithmphylogenetic treefixed-parameter tractabilityphylogenetic networkagreement forests

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (8)

Fixed-parameter and approximation algorithms for maximum agreement forests of multifurcating trees ⋮ Kernelizations for the hybridization number problem on multiple nonbinary trees ⋮ 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 ⋮ A duality based 2-approximation algorithm for maximum agreement forest ⋮ Hybridization Number on Three Rooted Binary Trees is EPT ⋮ Computing Maximum Agreement Forests without Cluster Partitioning is Folly ⋮ On the maximum parsimony distance between phylogenetic trees

This page was built for publication: Approximation Algorithms for Nonbinary Agreement Forests