Evolutionary trees: An integer multicommodity max-flow -- min-cut theorem
From MaRDI portal
Publication:1802347
Recommendations
Cites work
- Distributions on bicoloured binary trees arising from the principle of parsimony
- Matching theory
- On the Distribution of Lengths of Evolutionary Trees
- On the multiway cut polyhedron
- The Complexity of Multiterminal Cuts
- The Steiner problem in phylogeny is NP-complete
- Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time
Cited in
(10)- On weighted multiway cuts in trees
- Minimum multiway cuts in trees
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
- Five surprising properties of parsimoniously colored trees
- Evolutionary model for the Steiner tree problem with flow-dependent weights
- An evolutionary approach for finding optimal trees in undirected networks
- Algorithmic aspects of homophyly of networks
- Exact algorithms for a discrete metric labeling problem
- Exact algorithms for a discrete metric labeling problem
- A parsimony-based metric for phylogenetic trees
This page was built for publication: Evolutionary trees: An integer multicommodity max-flow -- min-cut theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802347)