The space of equidistant phylogenetic cactuses
From MaRDI portal
Publication:6192063
Abstract: We introduce and investigate the space of emph{equidistant} -emph{cactuses}. These are rooted, arc weighted, phylogenetic networks with leaf set , where is a finite set of species, and all leaves have the same distance from the root. The space contains as a subset the space of ultrametric trees on that was introduced by Gavryushkin and Drummond. We show that equidistant-cactus space is a CAT(0)-metric space which implies, for example, that there are unique geodesic paths between points. As a key step to proving this, we present a combinatorial result concerning emph{ranked} rooted -cactuses. In particular, we show that such networks can be encoded in terms of a pairwise compatibility condition arising from a poset of collections of pairs of subsets of that satisfy certain set-theoretic properties. As a corollary, we also obtain an encoding of ranked, rooted -trees in terms of partitions of , which provides an alternative proof that the space of ultrametric trees on is CAT(0). As with spaces of phylogenetic trees, we expect that our results should provide the basis for and new directions in performing statistical analyses for collections of phylogenetic networks with arc lengths.
Recommendations
Cites work
- scientific article; zbMATH DE number 4031953 (Why is no real title available?)
- scientific article; zbMATH DE number 3661335 (Why is no real title available?)
- scientific article; zbMATH DE number 49099 (Why is no real title available?)
- scientific article; zbMATH DE number 665694 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 1385418 (Why is no real title available?)
- scientific article; zbMATH DE number 1865935 (Why is no real title available?)
- scientific article; zbMATH DE number 863477 (Why is no real title available?)
- A space of phylogenetic networks
- All that glisters is not galled
- An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances
- Approximating geodesic tree distance
- Bijections for ranked tree-child networks
- CAT(0) Geometry, Robots, and Society
- Combinatorial and stochastic properties of ranked tree‐child networks
- Compatibility of partitions with trees, hierarchies, and split systems
- Computing consensus networks for collections of 1-nested phylogenetic networks
- Computing medians and means in Hadamard spaces
- Confidence Sets for Phylogenetic Trees
- Exploring the tiers of rooted phylogenetic network space using tail moves
- Geometry of the space of phylogenetic trees
- Graphs of some CAT(0) complexes
- Lost in space? Generalising subtree prune and regraft to spaces of phylogenetic networks
- Phylogeny. Discrete and random processes in evolution
- Polyhedral computational geometry for averaging metric phylogenetic trees
- Principal component analysis and the locus of the Fréchet mean in the space of phylogenetic trees
- Recognizing and realizing cactus metrics
- Split network polytopes and network spaces
- The Bergman complex of a matroid and phylogenetic trees
- The logarithm map, its limits and Fréchet means in orthant spaces
- The space of ultrametric phylogenetic trees
- Transforming phylogenetic networks: moving beyond tree space
This page was built for publication: The space of equidistant phylogenetic cactuses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6192063)