On the extension of a partial metric to a tree metric

DOI10.1016/S0012-365X(03)00294-2zbMath1031.05043MaRDI QIDQ1422428

Bruno Leclerc, Vladimir Makarenkov, Alain Guénoche

Publication date: 14 February 2004

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

zbMATH Keywords

2-treePartial distanceTree metric

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15) Distance in graphs (05C12)

Related Items (7)

Combinatorial properties of triplet covers for binary trees ⋮ Completion of tree metrics and rank 2 matrices ⋮ Minimum triplet covers of binary phylogenetic \(X\)-trees ⋮ Tree reconstruction from triplet cover distances ⋮ `Lassoing' a phylogenetic tree. I: Basic properties, shellings, and covers ⋮ New Gromov-inspired metrics on phylogenetic tree space ⋮ Distinguished Minimal Topological Lassos

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Separating subgraphs in k-trees: Cables and caterpillars
• On some relations between 2-trees and tree metrics
• On simple characterizations of k-trees
• A robust model for finding optimal evolutionary tree
• Minimum spanning trees for tree metrics: Abridgements and adjustments
• The triangles method to buildX-trees from incomplete distance matrices
• Steiner trees, partial 2–trees, and minimum IFI networks
• Complexity of Finding Embeddings in a k-Tree
• A k-Tree Generalization that Characterizes Consistency of Dimensioned Engineering Drawings
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs

This page was built for publication: On the extension of a partial metric to a tree metric