Counting bichromatic evolutionary trees

DOI10.1016/0166-218X(93)90147-GMaRDI QIDQ1314318zbMATH OpenOpenAlexFDO

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

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) Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Problems related to evolution (92D15)

Recommendations

• Decompositions of leaf-colored binary trees
• Distributions on bicoloured binary trees arising from the principle of parsimony
• On the Distribution of Lengths of Evolutionary Trees

Cites work

• A new bijection on rooted forests
• Applications of antilexicographic order. I: An enumerative theory of trees
• Distributions on bicoloured binary trees arising from the principle of parsimony
• scientific article; zbMATH DE number 3340110 (Why is no real title available?)
• On the Distribution of Lengths of Evolutionary Trees
• Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time

Cited in

(3)

• Distributions on bicoloured binary trees arising from the principle of parsimony
• Links between maximum likelihood and maximum parsimony under a simple model of site substitution
• Decompositions of leaf-colored binary trees

This page was built for publication: Counting bichromatic evolutionary trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1314318)