PACE 2026 Maximum Agreement Forest Solver
-
Updated
Jul 27, 2026 - Rust
#
maximum-agreement-forest
Here are 3 public repositories matching this topic...
A heuristic solver for the rooted Maximum Agreement Forest (MAF) problem on two phylogenetic trees, submitted to the PACE 2026 heuristic track.
-
Updated
Jul 8, 2026 - C++
This repository contains a Java implementation of algorithms for computing Maximum Agreement Forests (MAF) on unrooted phylogenetic trees. The project is based on Chen’s classical FPT branching algorithm and extends it with the Split-or-Decompose technique introduced by Mestel et al. (2024)
-
Updated
Sep 3, 2025 - Jupyter Notebook
Improve this page
Add a description, image, and links to the maximum-agreement-forest topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the maximum-agreement-forest topic, visit your repo's landing page and select "manage topics."