Recognizing treelike \(k\)-dissimilarities
From MaRDI portal
Publication:263358
DOI10.1007/s00357-012-9115-2zbMath1360.62333arXiv1206.1374OpenAlexW1991581005MaRDI QIDQ263358
Andreas Spillner, Sven Herrmann, Katharina T. Huber, Vincent L. Moulton
Publication date: 4 April 2016
Published in: Journal of Classification (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.1374
metricphylogenetic tree\(k\)-dissimilarity4-point conditiondissimilarityequidistant treeultrametric condition
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Clustering in the social and behavioral sciences (91C20) Trees (05C05) Problems related to evolution (92D15)
Related Items (12)
Families of multiweights and pseudostars ⋮ Weighted graphs with distances in given ranges ⋮ Lassoing and corralling rooted phylogenetic trees ⋮ On the weights of simple paths in weighted complete graphs ⋮ On graphlike \(k\)-dissimilarity vectors ⋮ The split decomposition of a \(k\)-dissimilarity map ⋮ A characterization of dissimilarity families of trees ⋮ A characterization of distance matrices of weighted cubic graphs and Peterson graphs ⋮ Unnamed Item ⋮ Three-way symbolic tree-maps and ultrametrics ⋮ Treelike families of multiweights ⋮ Moduli space of families of positive \((n - 1)\)-weights
Cites Work
- \(n\)-way metrics
- Sets of double and triple weights of trees
- A tropical interpretation of \(m\)-dissimilarity maps
- A fast algorithm for constructing trees from distance matrices
- Two dimensional quantification based on the measure of dissimilarity among three elements
- An order theoretic framework for overlapping clustering
- Triadic distance models: axiomatization and least squares representation
- \(n\)-semimetrics
- Reconstructing trees from subtree weights.
- Three-way distances
- Phylogenetic diversity over an abelian group
- Basic Phylogenetic Combinatorics
- Recognition of Tree Metrics
- A Review of Hierarchical Classification
- A Note on Three-Way Dissimilarities and Their Relationship with Two-Way Dissimilarities
This page was built for publication: Recognizing treelike \(k\)-dissimilarities