The triangles method to buildX-trees from incomplete distance matrices

DOI10.1051/ro:2001115zbMath0992.05036OpenAlexW2150003885MaRDI QIDQ2773174

Bruno Leclerc, Alain Guénoche

Publication date: 11 September 2002

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2001__35_2_283_0

zbMATH Keywords

spanning treevalued treesdistance arraystwotree

Mathematics Subject Classification ID

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

Related Items

Completion of tree metrics and rank 2 matrices ⋮ On the extension of a partial metric to a tree metric ⋮ `Lassoing' a phylogenetic tree. I: Basic properties, shellings, and covers

Uses Software

• BIONJ

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Separating subgraphs in k-trees: Cables and caterpillars
• An optimal algorithm to reconstruct trees from additive distance data
• Comparison of phylogenetic trees
• On some relations between 2-trees and tree metrics
• On simple characterizations of k-trees
• Minimum spanning trees for tree metrics: Abridgements and adjustments
• A k-Tree Generalization that Characterizes Consistency of Dimensioned Engineering Drawings
• On acyclic simplicial complexes