0-1 laws for pattern occurrences in phylogenetic trees and networks

DOI10.1007/S11538-024-01316-XzbMATH Open1545.92071MaRDI QIDQ6572113

François Bienvenu, Mike Steel

Publication date: 15 July 2024

Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)

zbMATH Keywords

binary treeslocal limitKesten treepattern occurrencesSnowflake

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15)

Cites Work

• Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
• Birth-death models and coalescent point processes: the shape and probability of reconstructed phylogenies
• Phylogeny. Discrete and random processes in evolution
• On the Distribution of Lengths of Evolutionary Trees
• Four Characters Suffice to Convexly Define a Phylogenetic Tree
• A branching process approach to level‐k phylogenetic networks
• Random Graphs and Complex Networks

Related Items (1)

Phylogenetic trees defined by at most three characters

This page was built for publication: 0-1 laws for pattern occurrences in phylogenetic trees and networks

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