An information theory perspective on the balanced minimum evolution problem
From MaRDI portal
Publication:2183221
Recommendations
Cites work
- A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
- Approximating the balanced minimum evolution problem
- Cyclic permutations and evolutionary trees
- Diagonal matrix scaling is NP-hard
- Facets of the balanced minimal evolution polytope
- scientific article; zbMATH DE number 1945176 (Why is no real title available?)
- scientific article; zbMATH DE number 2171552 (Why is no real title available?)
- On the balanced minimum evolution polytope
- Optimality of the neighbor joining algorithm and faces of the balanced minimum evolution polytope
- Polyhedral geometry of phylogenetic rogue taxa
- Split-facets for balanced minimal evolution polytopes and the permutoassociahedron
- The balanced minimum evolution problem
- The Construction of Huffman Codes is a Submodular ("Convex") Optimization Problem Over a Lattice of Binary Trees
- The DAD Theorem for Arbitrary Row Sums
Cited in
(3)
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)