Combinatorial properties of triplet covers for binary trees

DOI10.1016/j.aam.2018.04.002zbMath1388.05038arXiv1707.07908OpenAlexW2964341457MaRDI QIDQ1637594

Katharina T. Huber, Stefan Grünewald, Mike A. Steel, Vincent L. Moulton

Publication date: 8 June 2018

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

shellabilityphylogenetic treeHall's theoremtriplet coverample patchworktree-distances

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)

Related Items (1)

Phylogenetic flexibility via Hall-type inequalities and submodularity

Cites Work

• Tree reconstruction from triplet cover distances
• `Lassoing' a phylogenetic tree. I: Basic properties, shellings, and covers
• A Hall-type theorem for triplet set systems based on medians in trees
• On the extension of a partial metric to a tree metric
• On some relations between 2-trees and tree metrics
• Minimum triplet covers of binary phylogenetic \(X\)-trees
• A matroid associated with a phylogenetic tree
• Patchworks

This page was built for publication: Combinatorial properties of triplet covers for binary trees