An information theory perspective on the balanced minimum evolution problem

DOI10.1016/J.ORL.2020.04.010OpenAlexW3019474735MaRDI QIDQ2183221FDOQ2183221

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

cross-entropyphylogeneticsKullback-Leibler divergencebalanced minimum evolution

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2183221)