,
Manuel Penschuck
,
Mathias Weller
Creative Commons Attribution 4.0 International license
The 11th Parameterized Algorithms and Computational Experiments Challenge (PACE 2026) considered the Maximum-Agreement Forest problem: given a set of phylogenetic trees with identical leaf labels, it asks for a common forest with as few components as possible present in each input tree. Alongside the established exact and heuristic tracks, we introduced a lower-bound track focussing on fast solutions within a prescribed distance from the optimum. We also published STRIDE, a tool for testing solvers on thousands of instances and sharing solutions; a data repository containing 920k unique solutions for more than 30k instances is provided with this report. Each track used 400 benchmark instances drawn from biological data and several generators. Overall, PACE 2026 had 64 participants submitting 46 solvers on three tracks. This report describes the challenge setup, benchmark selection, results, and outlines the submitted solvers' approaches. We also report on an experiment in which an autonomous AI agent developed a competitive exact solver.
@InProceedings{leonhardt_et_al:LIPIcs.IPEC.2026.32,
author = {Leonhardt, Alexander and Penschuck, Manuel and Weller, Mathias},
title = {{The PACE 2026 Parameterized Algorithms and Computational Experiments Challenge: Maximum-Agreement Forest}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {32:1--32:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-456-7},
ISSN = {1868-8969},
year = {2026},
volume = {398},
editor = {Korhonen, Tuukka and Lampis, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2026.32},
URN = {urn:nbn:de:0030-drops-282053},
doi = {10.4230/LIPIcs.IPEC.2026.32},
annote = {Keywords: Phylogenetics, Maximum-Agreement Forest, Algorithm Engineering, FPT}
}