,
Bertrand Marchand
,
Arnaud Mary
,
Sven Meyer
Creative Commons Attribution 4.0 International license
This is a description of the "sherby" solver for the exact track of PACE 2026, on the computation of maximum agreement forests between phylogenetic trees. We combine two approaches. One is a reduction to maximum weighted clique, where each vertex represents an "agreement leaf-set" between the input trees. The other is a Max-SAT formulation, on which an external solver (EvalMaxSAT) is called. Our code is available at https://github.com/bmarchand/sherby-pace-2026-solver
@InProceedings{bousquet_et_al:LIPIcs.IPEC.2026.40,
author = {Bousquet, Nicolas and Marchand, Bertrand and Mary, Arnaud and Meyer, Sven},
title = {{PACE Solver Description: Sherby}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {40:1--40:5},
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.40},
URN = {urn:nbn:de:0030-drops-282138},
doi = {10.4230/LIPIcs.IPEC.2026.40},
annote = {Keywords: PACE - Maximum Agreement Forests - Maximum Satisfiability}
}
archived version
archived version