A reduction algorithm for approximating a (nonmetric) dissimilarity by a tree distance
From MaRDI portal
Publication:2563540
DOI10.1007/BF01202585zbMATH Open1008.62615MaRDI QIDQ2563540FDOQ2563540
Authors: O. Gascuel, Denise Levy 
Publication date: 21 April 2003
Published in: Journal of Classification (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Canonical analysis of two convex polyhedral cones and applications
- Comparison of phylogenetic trees
- Reconstructing the shape of a tree from observed dissimilarity data
- Free trees and bidirectional trees as representations of psychological distance
- A note on the metric properties of trees
- Tree structures for proximity data
- A note on the tree realizability of a distance matrix
- Neural networks and physical systems with emergent collective computational abilities
- Title not available (Why is that?)
- Computational complexity of inferring phylogenies from dissimilarity matrices
- Least squares algorithms for constructing constrained ultrametric and additive tree representations of symmetric proximity data
- Spatial versus tree representations of proximity data
- Title not available (Why is that?)
- Construction de l'ultramétrique la plus proche d'une dissimilarité au sens des moindres carrés
- A method for the linear recording of graphs
- Monotone mapping of similarities into a general metric space
- Title not available (Why is that?)
Cited In (7)
- A `stochastic safety radius' for distance-based tree reconstruction
- Cluster analysis and mathematical programming
- Inferring evolutionary trees with strong combinatorial evidence
- Ordinal properties of tree distances
- The minimum evolution problem: Overview and classification
- Choosing the tree which actually best explains the data: another look at the bootstrap in phylogenetic reconstruction.
- A tutorial on the balanced minimum evolution problem
This page was built for publication: A reduction algorithm for approximating a (nonmetric) dissimilarity by a tree distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2563540)
