Published September 25, 2026
| Version v1
Dataset
Open
The PACE 2026 Parameterized Algorithms and Computational Experiments Challenge: Maximum-Agreement Forest
Authors/Creators
Description
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.
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 repository contains:
- stride_solutions.tar.gz: A collection containing 1.6 million unique solutions for more than 30k instances.
- solvers.tar: Git repositories of all solvers submitted by the teams. The repositories are checked out to the commit that was benchmark. Please be aware that solver may declare their own licenses.
- build_and_benchmark.zip: Benchmark and build scripts.