Counting bichromatic evolutionary trees

DOI10.1016/0166-218X(93)90147-GzbMath0791.05056OpenAlexW2072536105MaRDI QIDQ1314318

László A. Székely, Péter L. Erdős

Publication date: 28 June 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(93)90147-g

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (1)

Links between maximum likelihood and maximum parsimony under a simple model of site substitution

Cites Work

• Unnamed Item
• A new bijection on rooted forests
• Applications of antilexicographic order. I: An enumerative theory of trees
• Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time
• Distributions on bicoloured binary trees arising from the principle of parsimony
• On the Distribution of Lengths of Evolutionary Trees

This page was built for publication: Counting bichromatic evolutionary trees