Integer linear programming as a tool for constructing trees from quartet data
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 830380 (Why is no real title available?)
- A canonical decomposition theory for metrics on a finite set
- Analyzing and visualizing sequence and distance data using SPLITSTREE
- Inferring evolutionary trees with strong combinatorial evidence
- The complexity of reconstructing trees from qualitative characters and subtrees
- \(T\)-theory: An overview
Cited in
(6)- Quad-Trees and Linear Lists for Identifying Nondominated Criterion Vectors
- Improved metaheuristics for the quartet method of hierarchical clustering
- Characterizing weak compatibility in terms of weighted quartets
- Encoding phylogenetic trees in terms of weighted quartets
- A fast quartet tree heuristic for hierarchical clustering
- Consistency of the QNet algorithm for generating planar split networks from weighted quartets
This page was built for publication: Integer linear programming as a tool for constructing trees from quartet data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500302)