On some relations between 2-trees and tree metrics

DOI10.1016/S0012-365X(98)00073-9zbMath0958.05029OpenAlexW2057711015MaRDI QIDQ1584450

Vladimir Makarenkov, Bruno Leclerc

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00073-9

zbMATH Keywords

dissimilarity2-treetree functiontree metricsvalued tree

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12)

Related Items (5)

Combinatorial properties of triplet covers for binary trees ⋮ Minimum triplet covers of binary phylogenetic \(X\)-trees ⋮ On the extension of a partial metric to a tree metric ⋮ The specification of 2-trees ⋮ The triangles method to buildX-trees from incomplete distance matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Median linear orders: Heuristics and a branch and bound algorithm
• Minimum spanning trees for tree metrics: Abridgements and adjustments
• Minimum spanning trees and types of dissimilarities
• Tree structures for proximity data
• The distance matrix of a graph and its tree realization
• Recognition of Tree Metrics
• Unrooted trees for numerical taxonomy
• An Optimal Diagonal Tree Code
• SPANNING TREES AND ASPECTS OF CLUSTERING
• Symmetric Matrices Representable by Weighted Trees over a Cancellative Abelian Monoid
• On acyclic simplicial complexes
• The number of labeled k-dimensional trees
• The number of labeled k-trees

This page was built for publication: On some relations between 2-trees and tree metrics