Clustered SplitsNetworks

DOI10.1007/978-3-540-85097-7_44zbMath1168.90648OpenAlexW2914972039MaRDI QIDQ5505684

Lichen Bao, Sergey Bereg

Publication date: 27 January 2009

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85097-7_44

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Problems related to evolution (92D15) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

A fast quartet tree heuristic for hierarchical clustering

Cites Work

• Unnamed Item
• An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study
• Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
• A canonical decomposition theory for metrics on a finite set
• A classification of the six-point prime metrics
• The Fine Structure of Galls in Phylogenetic Networks