The following pages link to Counting dendrograms: A survey (Q786492):
Displaying 17 items.
- Directed binary hierarchies and directed ultrametrics (Q263288) (← links)
- A constructive algorithm for realizing a distance matrix (Q858334) (← links)
- Symmetry in data mining and analysis: a unifying view based on hierarchy (Q1048428) (← links)
- The generation of random, binary unordered trees (Q1068492) (← links)
- Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves (Q1091713) (← links)
- Statistical tests on two characteristics of the shapes of cluster diagrams (Q1107239) (← links)
- The permuted analogues of three Catalan sets (Q1209641) (← links)
- Probabilistic models in cluster analysis (Q1350792) (← links)
- Combinatorial structures and structures for classification (Q1350822) (← links)
- Topological linkage disequilibrium calculated from coalescent genealogies (Q1625428) (← links)
- Conformational characterization of disulfide bonds: a tool for protein classification (Q1733034) (← links)
- The genealogy of Galton-Watson trees (Q2274215) (← links)
- Variable selection in compositional data analysis using pairwise logratios (Q2325287) (← links)
- On bounds for the rotation distance between binary coupling trees (Q2741329) (← links)
- Thinking Ultrametrically, Thinking p-Adically (Q5270628) (← links)
- On the enumeration of leaf-labeled increasing trees with arbitrary node-degree (Q6065318) (← links)
- Aitchison's compositional data analysis 40 years on: a reappraisal (Q6181741) (← links)
