On the approximability of the fixed-tree balanced minimum evolution problem

DOI10.1007/s11590-020-01677-xzbMath1475.90081OpenAlexW3119842321MaRDI QIDQ2047219

Martin Frohn

Publication date: 19 August 2021

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-020-01677-x

zbMATH Keywords

computational complexityphylogeneticsfixed-tree balanced minimum evolution problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (1)

A tutorial on the balanced minimum evolution problem

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Enumerating vertices of the balanced minimum evolution polytope
• An information theory perspective on the balanced minimum evolution problem
• Level-1 phylogenetic networks and their balanced minimum evolution polytopes
• Bioinformatics and phylogenetics. Seminal contributions of Bernard Moret
• Split-facets for balanced minimal evolution polytopes and the permutoassociahedron
• The balanced minimum evolution problem under uncertain data
• The Balanced Minimum Evolution Problem
• The minimum evolution problem: Overview and classification
• Representations of Partial Leaf Sets in Phylogenetic Tree Space

This page was built for publication: On the approximability of the fixed-tree balanced minimum evolution problem