An SDP relaxation combined with a rounding scheme solves the balanced minimum evolution phylogenetic inference problem and produces accurate trees on simulated and empirical data.
On the approximability of the fixed-tree balanced minimum evolution problem
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
q-bio.PE 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Phylogenetic Inference under the Balanced Minimum Evolution Criterion via Semidefinite Programming
An SDP relaxation combined with a rounding scheme solves the balanced minimum evolution phylogenetic inference problem and produces accurate trees on simulated and empirical data.