Distributions on bicoloured binary trees arising from the principle of parsimony
From MaRDI portal
Publication:1208487
DOI10.1016/0166-218X(90)90058-KzbMATH Open0777.05046MaRDI QIDQ1208487FDOQ1208487
Authors: Mike Steel 
Publication date: 16 May 1993
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
Problems related to evolution (92D15) Trees (05C05) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30)
Cites Work
- Graph theory
- Title not available (Why is that?)
- The Steiner problem in phylogeny is NP-complete
- Title not available (Why is that?)
- Parallel concepts in graph theory
- Asymptotic Methods in Enumeration
- Distributions on bicoloured evolutionary trees
- On the Distribution of Lengths of Evolutionary Trees
- Hereditarily finite sets and identity trees
- Tree enumeration modulo a consensus
- Significance of the length of the shortest tree
Cited In (9)
- Evolutionary trees: An integer multicommodity max-flow -- min-cut theorem
- Counting bichromatic evolutionary trees
- Links between maximum likelihood and maximum parsimony under a simple model of site substitution
- Five surprising properties of parsimoniously colored trees
- Title not available (Why is that?)
- Decompositions of leaf-colored binary trees
- Parsimony and the rank of a flattening matrix
- Does random tree puzzle produce Yule-Harding trees in the many-taxon limit?
- Probabilistic models in cluster analysis
This page was built for publication: Distributions on bicoloured binary trees arising from the principle of parsimony
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1208487)
