scientific article; zbMATH DE number 3693319

MaRDI QIDQ3887489zbMATH OpenFDO

Authors Les R. Foulds, R. W. Robinson

Publication date 1980

zbMATH Keywords

enumerationasymptotic behaviourgenerating functionsrecurrence relationnumber of phylogenetic trees

Mathematics Subject Classification ID

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

Cited in

(6)

• Enumerating phylogenetic trees with multiple labels
• Counting general phylogenetic networks
• Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time
• On the use of ordered sets in problems of comparison and consensus of classifications
• Branch and bound algorithms to determine minimal evolutionary trees
• Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks

This page was built for publication:

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