Numbering binary trees with labeled terminal vertices

MaRDI QIDQ1050346zbMATH OpenFDO

Authors F. James Rohlf

Publication date 1983

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

zbMATH Keywords

dendrogramrooted binary treestree enumeration

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(8)

• Labellable phylogenetic networks
• On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis
• Optimal algorithms for comparing trees with labeled leaves
• Reconstructing the shape of a tree from observed dissimilarity data
• A method for numbering binary rooted and unrooted phylogenies and their hypothetical taxonomic units
• The generation of random, binary unordered trees
• Probabilistic models in cluster analysis
• Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces

This page was built for publication: Numbering binary trees with labeled terminal vertices

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