Related Experiment Video
Updated: Jun 27, 2026

Scalable, Flexible, and Cost-Effective Seedling Grafting
Published on: January 6, 2023
A practical method for exact computation of subtree prune and regraft distance
1Department of Computer Science and Engineering, University of Connecticut, Storrs, CT 06269, USA. ywu@engr.uconn.edu
This study introduces a new computational method using integer linear programming to calculate the exact rooted subtree prune and regraft ((r)SPR) distance. This approach offers improved accuracy and efficiency for large biological trees compared to existing tools.
Area of Science:
- Computational Biology
- Bioinformatics
- Phylogenetics
Background:
- Subtree prune and regraft (SPR) operations are fundamental for analyzing evolutionary relationships represented by rooted binary trees.
- The rooted SPR ((r)SPR) distance quantifies the minimum operations to transform one tree into another, a key metric in phylogenetic analysis.
- Existing computational tools struggle with calculating (r)SPR distance for large trees or those with significant distances.
Purpose of the Study:
- To develop a practical and accurate method for computing the exact (r)SPR distance.
- To address the limitations of current software in handling large-scale phylogenetic tree comparisons.
Main Methods:
- Integer linear programming (ILP) was employed to formulate and solve the (r)SPR distance computation problem.
- The proposed ILP method was validated on both simulated and real biological datasets.
Main Results:
- The new ILP-based method demonstrates superior accuracy and efficiency over existing software tools.
- The approach successfully computes the exact (r)SPR distance for numerous large trees with substantial (r)SPR distances.
- Experimental results confirm the practical applicability and performance gains of the new method.
Conclusions:
- Integer linear programming provides an effective solution for calculating the exact (r)SPR distance.
- This method enhances the capability to analyze complex evolutionary histories represented by large phylogenetic trees.
- The developed tool offers a significant advancement for computational biology research requiring precise tree comparison.
Related Concept Videos
Survival Tree
Building a Survival Tree
Constructing a survival tree begins...
Distance Problem
The Distance Formula
Area Computation by the Alternative Coordinate Method
Construction of Root Locus
For positive gain values, the root locus exists on the real axis to the left of an odd number of finite open-loop poles or zeros. The root locus starts at the open-loop poles and traces the paths of the closed-loop poles as the gain increases.
Quantifying and Rejecting Outliers: The Grubbs Test

