Katharina T. Huber, Vincent Moulton, Megan Owen, Andreas Spillner, Katherine St. John
{"title":"The Space of Equidistant Phylogenetic Cactuses","authors":"Katharina T. Huber, Vincent Moulton, Megan Owen, Andreas Spillner, Katherine St. John","doi":"10.1007/s00026-023-00656-0","DOIUrl":null,"url":null,"abstract":"<div><p>An <i>equidistant</i> <i>X</i>-<i>cactus</i> is a type of rooted, arc-weighted, directed acyclic graph with leaf set <i>X</i>, that is used in biology to represent the evolutionary history of a set <span>\\(X\\)</span> of species. In this paper, we introduce and investigate the space of equidistant <i>X</i>-cactuses. This space contains, as a subset, the space of ultrametric trees on <i>X</i> 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 <i>ranked</i> rooted <i>X</i>-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 <span>\\(X\\)</span> that satisfy certain set-theoretic properties. As a corollary, we also obtain an encoding of ranked, rooted <i>X</i>-trees in terms of partitions of <i>X</i>, which provides an alternative proof that the space of ultrametric trees on <i>X</i> is CAT(0). We expect that our results will provide the basis for novel ways to perform statistical analyses on collections of equidistant <i>X</i>-cactuses, as well as new directions for defining and understanding spaces of more general, arc-weighted phylogenetic networks.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":"28 1","pages":"1 - 32"},"PeriodicalIF":0.6000,"publicationDate":"2023-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10904525/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s00026-023-00656-0","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
An equidistantX-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.
等距 X 仙人掌是一种有根、弧加权、有向无环图,叶集为 X,在生物学中用来表示物种集 X 的进化史。本文介绍并研究了等距 X 仙人掌空间。该空间的子集包含加夫柳什金和德鲁蒙德提出的 X 上的超对称树空间。我们证明等距仙人掌空间是一个 CAT(0)-metric 空间,这意味着,例如,点与点之间存在唯一的大地路径。作为证明这一点的关键步骤,我们提出了一个关于有根 X 仙人掌的组合结果。特别是,我们证明了这种图可以用一个成对相容条件来编码,这个成对相容条件是由满足一定集合论性质的 X 子集的成对集合的正集产生的。作为一个推论,我们还得到了以 X 的分区为基础的有序有根 X 树的编码,这为 X 上的超对称树空间是 CAT(0) 提供了另一种证明。我们希望,我们的研究成果将为在等距 X 仙人掌集合上进行统计分析的新方法提供基础,并为定义和理解更一般的弧加权系统发育网络空间提供新的方向。
期刊介绍:
Annals of Combinatorics publishes outstanding contributions to combinatorics with a particular focus on algebraic and analytic combinatorics, as well as the areas of graph and matroid theory. Special regard will be given to new developments and topics of current interest to the community represented by our editorial board.
The scope of Annals of Combinatorics is covered by the following three tracks:
Algebraic Combinatorics:
Enumerative combinatorics, symmetric functions, Schubert calculus / Combinatorial Hopf algebras, cluster algebras, Lie algebras, root systems, Coxeter groups / Discrete geometry, tropical geometry / Discrete dynamical systems / Posets and lattices
Analytic and Algorithmic Combinatorics:
Asymptotic analysis of counting sequences / Bijective combinatorics / Univariate and multivariable singularity analysis / Combinatorics and differential equations / Resolution of hard combinatorial problems by making essential use of computers / Advanced methods for evaluating counting sequences or combinatorial constants / Complexity and decidability aspects of combinatorial sequences / Combinatorial aspects of the analysis of algorithms
Graphs and Matroids:
Structural graph theory, graph minors, graph sparsity, decompositions and colorings / Planar graphs and topological graph theory, geometric representations of graphs / Directed graphs, posets / Metric graph theory / Spectral and algebraic graph theory / Random graphs, extremal graph theory / Matroids, oriented matroids, matroid minors / Algorithmic approaches