Enumerating phylogenetic trees with multiple labels

DOI10.1016/0012-365X(88)90201-4zbMath0661.05023MaRDI QIDQ1112830

Robert W. Robinson, Les R. Foulds

Publication date: 1988

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

zbMATH Keywords

enumerationphylogenetic treeslabelled treesAsymptotic resultsEvolutionary

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Related Items (3)

Representing non-crossing cuts by phylogenetic trees ⋮ Counting General Phylogenetic networks ⋮ Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks

Cites Work

• Parallel concepts in graph theory
• Asymptotic Methods in Enumeration
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Enumerating phylogenetic trees with multiple labels