Published September 25, 2026 | Version v1

The PACE 2026 Parameterized Algorithms and Computational Experiments Challenge: Maximum-Agreement Forest

  • 1. Centre National de la Recherche Scientifique
  • 2. ROR icon University of Southern Denmark

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.
 

Files

build_and_benchmark.zip

Files (526.5 MB)

Name Size
md5:8ebd1021013985d339abf3032332b346
46.2 kB Preview Download
md5:c259e54b32c566a90f4513b82e117ecf
271.5 MB Download
md5:2178428c6b4c258c76ac8001c451d77b
254.9 MB Download