Phylogenetic Inference under the Balanced Minimum Evolution Criterion via Semidefinite Programming
Year: 2026
Type: preprint
Abstract: In this study, we investigate the application of Semidefinite Programming (SDP) to phylogenetics. SDP is a powerful optimization framework that seeks to optimize a linear objective function over the cone of positive semidefinite matrices. As a convex optimization problem, SDP generalizes linear programming and provides tight relaxations for many combinatorial optimization problems. However, despite its many applications, SDP remains largely unused in computational biology. We argue that SDP relaxations are particularly well suited for phylogenetic inference. As a proof of concept, we focus on the Balanced Minimum Evolution (BME) problem, a widely used model in distance-based phylogenetics. We propose an algorithm combining an SDP relaxation with a rounding scheme that iteratively converts relaxed solutions into valid tree topologies. Experiments on simulated and empirical datasets show that the method enables accurate phylogenetic reconstruction. The approach is sufficiently general to be extendable to other phylogenetic problems.
Source: arXiv (Cornell University)
Author: Skums, P.
Institution: University of Connecticut
Subfield: Molecular Biology
Domain: Life Sciences
Open Access status: green
OpenAlex ID: W7154454322
Cites:
Cited by:
Related to: