Recognition of Tree Metrics
From MaRDI portal
Publication:4205451
DOI10.1137/0403001zbMATH Open0687.05017OpenAlexW2072029738MaRDI QIDQ4205451FDOQ4205451
Authors: Hans-Jürgen Bandelt
Publication date: 1990
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0403001
Recommendations
- Metric trees
- Reconstructing approximate tree metrics
- scientific article; zbMATH DE number 1775401
- Generalized trees related with tree metrics
- scientific article; zbMATH DE number 897899
- scientific article; zbMATH DE number 1775400
- scientific article; zbMATH DE number 1113982
- Recognizing treelike \(k\)-dissimilarities
- Some results on metric trees
Cited In (31)
- Testing metric properties
- Recognizing treelike \(k\)-dissimilarities
- Phylogenetic analysis and homology
- Computing the Gromov hyperbolicity of a discrete metric space
- Relaxed and approximate graph realizations
- Reconstructing phylogenies from nucleotide pattern probabilities: A survey and some new results
- A canonical decomposition theory for metrics on a finite set
- On some relations between 2-trees and tree metrics
- Metric family portraits
- Some uses of the Farris transform in mathematics and phylogenetics -- A review
- \(l_\infty\)-approximation via subdominants.
- Distance realization problems with applications to internet tomography
- Application of cut polyhedra. I
- Comparing resemblance measures
- Proper Gromov transforms of metrics are metrics
- Minimum spanning trees for tree metrics: Abridgements and adjustments
- Distance spectra of graphs: a survey
- \(\Delta\) additive and \(\Delta\) ultra-additive maps, Gromov's trees, and the Farris transform
- Graph realization of distance sets
- Caterpiller distances
- Retractions of finite distance functions onto tree metrics
- A note on tree realizations of matrices
- Three-way metrics: axiomatization and properties
- Scatter search with path relinking for phylogenetic inference
- Split decomposition over an Abelian group. I: Generalities
- Composed degree-distance realizations of graphs
- Composed degree-distance realizations of graphs
- Fitting semiparametric clustering models to dissimilarity data
- Recognizing and realizing cactus metrics
- Split decomposition over an Abelian group. II: Group-valued split systems with weakly compatible support
- Recovering symbolically dated, rooted trees from symbolic ultrametrics
This page was built for publication: Recognition of Tree Metrics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4205451)