Numbering binary trees with labeled terminal vertices
From MaRDI portal
Publication:1050346
zbMath0513.05027MaRDI QIDQ1050346
Publication date: 1983
Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)
Related Items (8)
On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis ⋮ Probabilistic models in cluster analysis ⋮ Labellable phylogenetic networks ⋮ Reconstructing the shape of a tree from observed dissimilarity data ⋮ Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces ⋮ A method for numbering binary rooted and unrooted phylogenies and their hypothetical taxonomic units ⋮ The generation of random, binary unordered trees ⋮ Optimal algorithms for comparing trees with labeled leaves
This page was built for publication: Numbering binary trees with labeled terminal vertices
