Pages that link to "Item:Q1050346"
From MaRDI portal
The following pages link to Numbering binary trees with labeled terminal vertices (Q1050346):
Displayed 7 items.
- Reconstructing the shape of a tree from observed dissimilarity data (Q103560) (← links)
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces (Q1056946) (← links)
- A method for numbering binary rooted and unrooted phylogenies and their hypothetical taxonomic units (Q1065735) (← links)
- The generation of random, binary unordered trees (Q1068492) (← links)
- Optimal algorithms for comparing trees with labeled leaves (Q1074275) (← links)
- Probabilistic models in cluster analysis (Q1350792) (← links)
- On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis (Q1631807) (← links)