Clustered SplitsNetworks

DOI10.1007/978-3-540-85097-7_44MaRDI QIDQ5505684zbMATH OpenOpenAlexFDO

Authors 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) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Problems related to evolution (92D15)

Recommendations

• The fine structure of galls in phylogenetic networks
• scientific article; zbMATH DE number 1945177
• Computational Science – ICCS 2005
• Phylogenetic networks
• Constructing the Simplest Possible Phylogenetic Network from Triplets

Cites work

• A canonical decomposition theory for metrics on a finite set
• A classification of the six-point prime metrics
• An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study
• scientific article; zbMATH DE number 1945177 (Why is no real title available?)
• The fine structure of galls in phylogenetic networks
• Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces

Cited in

(6)

• Consistency of the QNet algorithm for generating planar split networks from weighted quartets
• Phylogenetic graph models beyond trees
• Optimal algorithms for computing edge weights in planar split networks
• scientific article; zbMATH DE number 1945177 (Why is no real title available?)
• A fast quartet tree heuristic for hierarchical clustering
• Equidistant circular split networks

This page was built for publication: Clustered SplitsNetworks

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