10 papers
IMProofBench: Benchmarking AI on Research-Level Mathematical Proof Generation
Johannes Schmitt, Gergely Bérczi, Jasper Dekoninck +57
As the mathematical capabilities of large language models (LLMs) improve, it becomes increasingly important to evaluate their performance on research-level tasks at the frontier of…
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…
Bounds on the sequence length sufficient to reconstruct binary level- phylogenetic networks under the CFN model
Martin Frohn, Niels Holtgrefe, Leo van Iersel +2
Phylogenetic trees and networks are graphs used to model evolutionary relationships, with trees representing strictly branching histories and networks allowing for events in which…
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…
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.…
A strengthened bound on the number of states required to characterize maximum parsimony distance
Mareike Fischer, Steven Kelk, Sofia Vazquez Alferez
In this article we prove that the distance between two unrooted binary phylogenetic trees on the same set of taxa can be defined by a char…