The space of equidistant phylogenetic cactuses
From MaRDI portal
Publication:6192063
DOI10.1007/S00026-023-00656-0arXiv2111.06115OpenAlexW3213815746MaRDI QIDQ6192063FDOQ6192063
Authors: Katharina T. Huber, Vincent Moulton, Megan Owen, Andreas Spillner, Katherine St. John
Publication date: 11 March 2024
Published in: Annals of Combinatorics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/2111.06115
Recommendations
Applications of graph theory (05C90) Problems related to evolution (92D15) Partial orders, general (06A06) Signed and weighted graphs (05C22) Polyhedral manifolds (52B70)
Cites Work
- Title not available (Why is that?)
- Geometry of the space of phylogenetic trees
- Polyhedral computational geometry for averaging metric phylogenetic trees
- Phylogeny. Discrete and random processes in evolution
- The space of ultrametric phylogenetic trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graphs of some CAT(0) complexes
- The Bergman complex of a matroid and phylogenetic trees
- Title not available (Why is that?)
- Computing medians and means in Hadamard spaces
- Transforming phylogenetic networks: moving beyond tree space
- An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances
- Title not available (Why is that?)
- All that glisters is not galled
- Approximating geodesic tree distance
- Title not available (Why is that?)
- Title not available (Why is that?)
- Compatibility of partitions with trees, hierarchies, and split systems
- Confidence Sets for Phylogenetic Trees
- Principal component analysis and the locus of the Fréchet mean in the space of phylogenetic trees
- The logarithm map, its limits and Fréchet means in orthant spaces
- Exploring the tiers of rooted phylogenetic network space using tail moves
- Lost in space? Generalising subtree prune and regraft to spaces of phylogenetic networks
- A space of phylogenetic networks
- Combinatorial and stochastic properties of ranked tree‐child networks
- Recognizing and realizing cactus metrics
- Split network polytopes and network spaces
- Bijections for ranked tree-child networks
- CAT(0) Geometry, Robots, and Society
- Computing consensus networks for collections of 1-nested phylogenetic networks
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)