scientific article; zbMATH DE number 637307

zbMATH Open0810.05021MaRDI QIDQ4304358

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

Publication date: 6 October 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

enumerationinversionreconstructionevolutionary trees

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15) Combinatorial probability (60C05)

Related Items (8)

Combinatorial views on persistent characters in phylogenetics ⋮ ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations ⋮ Exact enumeration of cherries and pitchforks in ranked trees under the coalescent model ⋮ A combinatorial description of the closest tree algorithm for finding evolutionary trees ⋮ Asymptotic enumeration, global structure, and constrained evolution ⋮ The probability distribution of the reconstructed phylogenetic tree with occurrence data ⋮ The number of evolutionary steps on random and minimum length trees for random evolutionary data ⋮ The reconstructed tree in the lineage-based model of protracted speciation

Recommendations

• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Finite phylogenetic complexity and combinatorics of tables 👍 👎
• A combinatorial description of the closest tree algorithm for finding evolutionary trees 👍 👎
• On the complexity of constructing evolutionary trees 👍 👎
• On the combinatorics of rooted binary phylogenetic trees 👍 👎
• Inferring evolutionary trees with strong combinatorial evidence 👍 👎
• Computing and Combinatorics 👍 👎
• The combinatorics of evolutionary trees---a survey 👍 👎

This page was built for publication: