Agreement forests of caterpillar trees: complexity, kernelization and branching

DOI10.1016/J.TCS.2024.114608MaRDI QIDQ6444770zbMATH OpenFDO

Authors Steven Kelk, Ruben Meuwese

Publication date 22 July 2023

Full work available at URL https://doi.org/10.1016/J.TCS.2024.114608

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15)

Recommendations

• scientific article; zbMATH DE number 1833410
• The maximum agreement forest problem: Approximation algorithms and computational experiments
• The agreement problem for unrooted phylogenetic trees is FPT
• Computing the maximum agreement of phylogenetic networks

Cited in

(1)

• Split-or-decompose: improved FPT branching algorithms for maximum agreement forests

This page was built for publication: Agreement forests of caterpillar trees: complexity, kernelization and branching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6444770)