A reduction algorithm for approximating a (nonmetric) dissimilarity by a tree distance
From MaRDI portal
Publication:2563540
DOI10.1007/BF01202585zbMath1008.62615MaRDI QIDQ2563540
Publication date: 21 April 2003
Published in: Journal of Classification (Search for Journal in Brave)
62H30: Classification and discrimination; cluster analysis (statistical aspects)
Related Items
The minimum evolution problem: Overview and classification, Cluster analysis and mathematical programming, Choosing the tree which actually best explains the data: another look at the bootstrap in phylogenetic reconstruction., Inferring evolutionary trees with strong combinatorial evidence, Ordinal properties of tree distances
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reconstructing the shape of a tree from observed dissimilarity data
- Computational complexity of inferring phylogenies from dissimilarity matrices
- Least squares algorithms for constructing constrained ultrametric and additive tree representations of symmetric proximity data
- Comparison of phylogenetic trees
- Spatial versus tree representations of proximity data
- Monotone mapping of similarities into a general metric space
- Free trees and bidirectional trees as representations of psychological distance
- A note on the metric properties of trees
- Canonical analysis of two convex polyhedral cones and applications
- Construction de l'ultramétrique la plus proche d'une dissimilarité au sens des moindres carrés
- Tree structures for proximity data
- A method for the linear recording of graphs
- Neural networks and physical systems with emergent collective computational abilities.
- A note on the tree realizability of a distance matrix
