Tree reconstruction from triplet cover distances

zbMath1300.05182arXiv1209.2391MaRDI QIDQ405205

Katharina T. Huber, Mike A. Steel

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1209.2391

zbMATH Keywords

shellabilityX-treetree metrictree reconstructiontriplet cover

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Signed and weighted graphs (05C22)

Related Items

Combinatorial properties of triplet covers for binary trees ⋮ Minimum triplet covers of binary phylogenetic \(X\)-trees ⋮ Distinguished Minimal Topological Lassos

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• `Lassoing' a phylogenetic tree. I: Basic properties, shellings, and covers
• Patching up \(X\)-trees
• On the extension of a partial metric to a tree metric
• A robust model for finding optimal evolutionary tree
• Minimum spanning trees for tree metrics: Abridgements and adjustments
• A k-Tree Generalization that Characterizes Consistency of Dimensioned Engineering Drawings
• An Optimal Diagonal Tree Code