Counting dendrograms: A survey

DOI10.1016/0166-218X(84)90066-0MaRDI QIDQ786492zbMATH OpenWikidataFDO

Authors F. Murtagh

Publication date 1984

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

zbMATH Keywords

labelledsurveybinaryrooted treesenumeration of non-isomorphic dendrogramshierarchic classificationranked

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Exact enumeration problems, generating functions (05A15)

Cites work

• scientific article; zbMATH DE number 3425611 (Why is no real title available?)
• scientific article; zbMATH DE number 3698160 (Why is no real title available?)
• scientific article; zbMATH DE number 3763082 (Why is no real title available?)
• scientific article; zbMATH DE number 3469876 (Why is no real title available?)
• scientific article; zbMATH DE number 3628185 (Why is no real title available?)
• scientific article; zbMATH DE number 3443655 (Why is no real title available?)
• scientific article; zbMATH DE number 3400297 (Why is no real title available?)
• Alternating permutations and binary increasing trees
• Hierarchical analysis: Classification with ordinal object dissimilarities
• On probability distributions of single-linkage dendrograms
• The probabilities of rooted tree-shapes generated by random bifurcation

Cited in

(17)

• Directed binary hierarchies and directed ultrametrics
• The permuted analogues of three Catalan sets
• Conformational characterization of disulfide bonds: a tool for protein classification
• Statistical tests on two characteristics of the shapes of cluster diagrams
• Variable selection in compositional data analysis using pairwise logratios
• Symmetry in data mining and analysis: a unifying view based on hierarchy
• Topological linkage disequilibrium calculated from coalescent genealogies
• A constructive algorithm for realizing a distance matrix
• Thinking ultrametrically, thinking \(p\)-adically
• Aitchison's compositional data analysis 40 years on: a reappraisal
• On the enumeration of leaf-labeled increasing trees with arbitrary node-degree
• On bounds for the rotation distance between binary coupling trees
• Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves
• Combinatorial structures and structures for classification
• The genealogy of Galton-Watson trees
• The generation of random, binary unordered trees
• Probabilistic models in cluster analysis

This page was built for publication: Counting dendrograms: A survey

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