An information theory perspective on the balanced minimum evolution problem

DOI10.1016/j.orl.2020.04.010OpenAlexW3019474735MaRDI QIDQ2183221

Daniele Catanzaro, Martin Frohn, Raffaele Pesenti

Publication date: 26 May 2020

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2020.04.010

zbMATH Keywords

Kullback-Leibler divergencecross-entropybalanced minimum evolutionphylogenetics

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Related Items (3)

A tutorial on the balanced minimum evolution problem ⋮ A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem ⋮ On the approximability of the fixed-tree balanced minimum evolution problem

Cites Work

• Unnamed Item
• Unnamed Item
• Optimality of the neighbor joining algorithm and faces of the balanced minimum evolution polytope
• Facets of the balanced minimal evolution polytope
• Approximating the balanced minimum evolution problem
• Polyhedral geometry of phylogenetic rogue taxa
• On the balanced minimum evolution polytope
• Cyclic permutations and evolutionary trees
• Diagonal matrix scaling is NP-hard
• Split-facets for balanced minimal evolution polytopes and the permutoassociahedron
• The Balanced Minimum Evolution Problem
• The DAD Theorem for Arbitrary Row Sums
• The Construction of Huffman Codes is a Submodular ("Convex") Optimization Problem Over a Lattice of Binary Trees
• A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices

This page was built for publication: An information theory perspective on the balanced minimum evolution problem