`Lassoing' a phylogenetic tree. I: Basic properties, shellings, and covers

DOI10.1007/s00285-011-0450-4zbMath1251.05030arXiv1102.0309OpenAlexW1995427389WikidataQ51550376 ScholiaQ51550376MaRDI QIDQ455729

Andreas W. M. Dress, Katharina T. Huber, Mike A. Steel

Publication date: 22 October 2012

Published in: Journal of Mathematical Biology (Search for Journal in Brave)

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

zbMATH Keywords

phylogenetic treetree metriclassotree reconstructioncord of a lasso

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15)

Related Items (9)

Do tree split probabilities determine the branch lengths? ⋮ Combinatorial properties of triplet covers for binary trees ⋮ Completion of tree metrics and rank 2 matrices ⋮ Lassoing and corralling rooted phylogenetic trees ⋮ On the weights of simple paths in weighted complete graphs ⋮ Minimum triplet covers of binary phylogenetic \(X\)-trees ⋮ Tree reconstruction from triplet cover distances ⋮ On dissimilarity vectors of general weighted trees ⋮ Distinguished Minimal Topological Lassos

Cites Work

• Constructing rooted supertrees using distances
• A Hall-type theorem for triplet set systems based on medians in trees
• Encoding phylogenetic trees in terms of weighted quartets
• The performance of neighbor-joining methods of phylogenetic reconstruction
• The complexity of reconstructing trees from qualitative characters and subtrees
• Patching up \(X\)-trees
• \(X\)-trees and weighted quartet systems
• On the extension of a partial metric to a tree metric
• A robust model for finding optimal evolutionary tree
• The triangles method to buildX-trees from incomplete distance matrices
• Basic Phylogenetic Combinatorics
• Tree structures for proximity data
• An Optimal Diagonal Tree Code

This page was built for publication: `Lassoing' a phylogenetic tree. I: Basic properties, shellings, and covers