3 papers
math.CO2026
A kernel for the maximum agreement forest problem on multiple binary phylogenetic trees
Steven Kelk, Ruben Meuwese, Leo van Iersel
The maximum agreement forest (MAF) problem in phylogenetics takes as input a set t >= 2 of binary phylogenetic trees T on the same set of taxa X. It asks for a partition of X into…
cs.DS2026
Split-or-decompose: Improved FPT branching algorithms for maximum agreement forests
David Mestel, Steven Chaplick, Steven Kelk +1
Phylogenetic trees are leaf-labelled trees used to model the evolution of species. In practice it is not uncommon to obtain two topologically distinct trees for the same set of spe…
q-bio.PE2025
Computational support for case-heavy proofs in mathematical phylogenetics
Luca Forte, Leo van Iersel, Steven Kelk +1
In this note we demonstrate that a number of case-heavy combinatorial proofs in the mathematical phylogenetics literature can be proven more compactly using computational support.…