The Space of Equidistant Phylogenetic Cactuses

IF 0.6 4区 数学 Q4 MATHEMATICS, APPLIED Annals of Combinatorics Pub Date : 2023-06-09 DOI:10.1007/s00026-023-00656-0
Katharina T. Huber, Vincent Moulton, Megan Owen, Andreas Spillner, Katherine St. John
{"title":"The Space of Equidistant Phylogenetic Cactuses","authors":"Katharina T. Huber,&nbsp;Vincent Moulton,&nbsp;Megan Owen,&nbsp;Andreas Spillner,&nbsp;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 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.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
等距系统发育仙人掌的空间
等距 X 仙人掌是一种有根、弧加权、有向无环图,叶集为 X,在生物学中用来表示物种集 X 的进化史。本文介绍并研究了等距 X 仙人掌空间。该空间的子集包含加夫柳什金和德鲁蒙德提出的 X 上的超对称树空间。我们证明等距仙人掌空间是一个 CAT(0)-metric 空间,这意味着,例如,点与点之间存在唯一的大地路径。作为证明这一点的关键步骤,我们提出了一个关于有根 X 仙人掌的组合结果。特别是,我们证明了这种图可以用一个成对相容条件来编码,这个成对相容条件是由满足一定集合论性质的 X 子集的成对集合的正集产生的。作为一个推论,我们还得到了以 X 的分区为基础的有序有根 X 树的编码,这为 X 上的超对称树空间是 CAT(0) 提供了另一种证明。我们希望,我们的研究成果将为在等距 X 仙人掌集合上进行统计分析的新方法提供基础,并为定义和理解更一般的弧加权系统发育网络空间提供新的方向。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Annals of Combinatorics
Annals of Combinatorics 数学-应用数学
CiteScore
1.00
自引率
0.00%
发文量
56
审稿时长
>12 weeks
期刊介绍: 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
期刊最新文献
Orientable Vertex Primitive Complete Maps Publisher Correction to: An Asymptotic Lower Bound on the Number of Polyominoes Efficient Representation of Lattice Path Matroids Partitions with Fixed Points in the Sequence of First-Column Hook Lengths Acyclic Reorientation Lattices and Their Lattice Quotients
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1