Approximating SPR Distance Between Phylogenetic Trees with Graph Neural Networks
Not on the map. Why?
Abstract (arXiv)
Comparing phylogenetic tree topologies is essential for understanding epidemic dynamics, yet biologically meaningful distances such as the Subtree Prune and Regraft (SPR) distance are NP-hard to compute and intractable on large datasets. We investigate whether a Graph Neural Network (GNN) can approximate SPR distances in near-constant time per comparison after training. Our contributions are fourfold. First, we build and publicly release a dataset of 864 phylogenetic trees inferred with UPGMA and Neighbor-Joining over four bacterial species, spanning up to 9,500 isolates, together with 388 labelled tree pairs. Second, we establish a reproducible pre-processing pipeline including midpoint re-rooting, which reduces tree depth and supplies the rooting required for exact distance computation and for the model's root-based features. Third, we validate the supervision target: on small trees, where exact SPR is tractable, the unrooted phangorn::SPR.dist heuristic correlates almost perfectly with the exact rooted distance computed by rspr (Pearson 0.98--0.99), making it an excellent monotonic surrogate. Lastly, we train a Siamese Graph Isomorphism Network (GIN) regressor. In-distribution, i.e., held-out trees from the same species and size range as training, it explains roughly 87--90% of the variance (R2 ≈ 0.87 on a held-out split; 0.90 ± 0.19 under stratified cross-validation), with about four times lower error than a mean-predictor baseline, and shows partial transfer to unseen species (R2 ≈ 0.37). Its main limitation is extrapolation to trees larger than those seen in training, where accuracy collapses. The released dataset and the validated heuristic versus exact relationship provide a reproducible basis for scaling learned SPR approximation.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 11 of its 39 references that are in the map. First posted on arXiv 17 Jul 2026.
Builds on
11 of 39 references.
References · 11
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2019A Comprehensive Survey on Graph Neural Networkscited by 2,906
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
- 2019Graph Matching Networks for Learning the Similarity of Graph Structured Objectscited by 202
- 2018SimGNN: A Neural Network Approach to Fast Graph Similarity Computationcited by 89
- 2015Calculating the Unrooted Subtree Prune-and-Regraft Distancecited by 1
- 2020Distance-based phylogenetic inference from typing data: a unifying viewcited by 1
Built on by
Not cited yet.