On the Distribution of Lengths of Evolutionary Trees

DOI10.1137/0403005zbMath0705.05017OpenAlexW1973899373MaRDI QIDQ3484847

No author found.

Publication date: 1990

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0403005

zbMATH Keywords

evolutionary treeminimal coloring

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Model theory of denumerable and separable structures (03C15)

Related Items (14)

Expected Number of Induced Subtrees Shared by Two Independent Copies of a Random Tree ⋮ Bounds on the Expected Size of the Maximum Agreement Subtree ⋮ Probabilistic models in cluster analysis ⋮ A few logs suffice to build (almost) all trees. II ⋮ On the information content of discrete phylogenetic characters ⋮ A new bijection on rooted forests ⋮ Significance of the length of the shortest tree ⋮ The complexity of reconstructing trees from qualitative characters and subtrees ⋮ Tree reconstruction from multi-state characters ⋮ Distributions on bicoloured binary trees arising from the principle of parsimony ⋮ Evolutionary trees: An integer multicommodity max-flow -- min-cut theorem ⋮ Applications of antilexicographic order. I: An enumerative theory of trees ⋮ A limiting theorem for parsimoniously bicoloured trees ⋮ Counting bichromatic evolutionary trees

This page was built for publication: On the Distribution of Lengths of Evolutionary Trees