Reconstructing trees from subtree weights.
From MaRDI portal
Abstract: The tree-metric theorem provides a necessary and sufficient condition for a dissimilarity matrix to be a tree metric, and has served as the foundation for numerous distance-based reconstruction methods in phylogenetics. Our main result is an extension of the tree-metric theorem to more general dissimilarity maps. In particular, we show that a tree with n leaves is reconstructible from the weights of the m-leaf subtrees provided that n geq 2m-1.
Recommendations
Cites work
- A note on the metric properties of trees
- A note on the tree realizability of a distance matrix
- Biological Sequence Analysis
- Distance matrix of a graph and its realizability
- Distance realization problems with applications to internet tomography
- scientific article; zbMATH DE number 1865935 (Why is no real title available?)
- scientific article; zbMATH DE number 3243264 (Why is no real title available?)
- The performance of neighbor-joining methods of phylogenetic reconstruction
Cited in
(41)- Split decomposition over an Abelian group. II: Group-valued split systems with weakly compatible support
- A tropical interpretation of \(m\)-dissimilarity maps
- Patching up \(X\)-trees
- On the extension of a partial metric to a tree metric
- Equations for point configurations to Lie on a rational normal curve
- Reconstructing unrooted phylogenetic trees from symbolic ternary metrics
- Hyperconvexity and tight-span theory for diversities
- Tropical mixtures of star tree metrics
- Tree representations of non-symmetric group-valued proximities
- Initial ideals of Pfaffian ideals
- Smith normal form of a distance matrix inspired by the four-point condition
- Identifiability of 3-class Jukes-Cantor mixtures
- Treelike families of multiweights
- An operator theoretic approach to nonparametric mixture models
- A combinatorial formula for principal minors of a matrix with tree-metric exponents and its applications
- Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves
- Recognizing treelike k-dissimilarities
- Diversities, hyperconvexity and fixed points
- Families of multiweights and pseudostars
- Phylogenetic analysis and homology
- Weighted graphs with distances in given ranges
- scientific article; zbMATH DE number 3871410 (Why is no real title available?)
- Lassoing and corralling rooted phylogenetic trees
- On the weights of simple paths in weighted complete graphs
- On graphlike \(k\)-dissimilarity vectors
- The split decomposition of a \(k\)-dissimilarity map
- On dissimilarity vectors of general weighted trees
- `Lassoing' a phylogenetic tree. I: Basic properties, shellings, and covers
- Tree Reconstruction from Partial Orders
- Tropical geometry and Newton-Okounkov cones for Grassmannian of planes from compactifications
- A characterization of dissimilarity families of trees
- Characterization of distance matrices of weighted hypercube graphs and Petersen graphs
- A matroid associated with a phylogenetic tree
- Generalized constructive tree weights
- Reconstruction of trees from jumbled and weighted subtrees
- scientific article; zbMATH DE number 6857397 (Why is no real title available?)
- Sets of double and triple weights of trees
- Split decomposition over an Abelian group. I: Generalities
- Self-Dual Matroids from Canonical Curves
- Moduli space of families of positive \((n - 1)\)-weights
- Inferring metric trees from weighted quartets via an intertaxon distance
This page was built for publication: Reconstructing trees from subtree weights.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1764570)
