TY - JOUR
T1 - The space of equidistant phylogenetic cactuses
AU - Huber, Katharina T.
AU - Moulton, Vincent
AU - Owen, Megan
AU - Spillner, Andreas
AU - St. John, Katherine
N1 - Funding information: MO is partially supported by the US National Science Foundation (DMS 1847271). This work was supported by a grant from the Simons Foundation (#355824, Megan Owen). KAS thanks the Simons Foundation (#316124) and the US National Science Foundation (#1461094) for research and travel support.
PY - 2024/3
Y1 - 2024/3
N2 - An equidistant X-cactus is a type of rooted, arc-weighted, directed acyclic graph with leaf set X, that is used in biology to represent the evolutionary history of a set X of species. In this paper, we introduce and investigate the space of equidistant X-cactuses. This space contains, as a subset, the space of ultrametric trees on X 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 ranked rooted X-cactuses. In particular, we show that such graphs can be encoded in terms of a pairwise compatibility condition arising from a poset of collections of pairs of subsets of X that satisfy certain set-theoretic properties. As a corollary, we also obtain an encoding of ranked, rooted X-trees in terms of partitions of X, which provides an alternative proof that the space of ultrametric trees on X is CAT(0). We expect that our results will provide the basis for novel ways to perform statistical analyses on collections of equidistant X-cactuses, as well as new directions for defining and understanding spaces of more general, arc-weighted phylogenetic networks.
AB - An equidistant X-cactus is a type of rooted, arc-weighted, directed acyclic graph with leaf set X, that is used in biology to represent the evolutionary history of a set X of species. In this paper, we introduce and investigate the space of equidistant X-cactuses. This space contains, as a subset, the space of ultrametric trees on X 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 ranked rooted X-cactuses. In particular, we show that such graphs can be encoded in terms of a pairwise compatibility condition arising from a poset of collections of pairs of subsets of X that satisfy certain set-theoretic properties. As a corollary, we also obtain an encoding of ranked, rooted X-trees in terms of partitions of X, which provides an alternative proof that the space of ultrametric trees on X is CAT(0). We expect that our results will provide the basis for novel ways to perform statistical analyses on collections of equidistant X-cactuses, as well as new directions for defining and understanding spaces of more general, arc-weighted phylogenetic networks.
KW - phylogenetic network
KW - network space
KW - combinatorial encoding
KW - CAT(0)-metric space
KW - Phylogenetic network
KW - Combinatorial encoding
KW - Network space
KW - 92D15
KW - 05C90
KW - 06A06
KW - 52B70
UR - http://www.scopus.com/inward/record.url?scp=85161426213&partnerID=8YFLogxK
U2 - 10.1007/s00026-023-00656-0
DO - 10.1007/s00026-023-00656-0
M3 - Article
VL - 28
SP - 1
EP - 32
JO - Annals of Combinatorics
JF - Annals of Combinatorics
SN - 0218-0006
ER -