NOC NOC，谁在那里？树孩子网络和正规网络的聚类系统
NOC NOC, who's there? Clustering systems of tree-child and normal networks
查看机构详情
- Stockholm University（斯德哥尔摩大学）
- Leipzig University（莱比锡大学）
机构由 AI 辅助整理，请以论文原文为准。
浏览论文内容
中文总结 AI 辅助
本文通过非重叠覆盖（NOC）性质刻画正规和树孩子网络的聚类系统，证明NOC等价于包含可见性，给出二次上界与多项式时间识别算法，并探讨了其在枚举、序理论和最小集合覆盖等方面的推论。
中文摘要 AI 辅助
聚类系统为编码系统发育网络中的结构信息提供了一种自然的方式。在本笔记中，我们通过集合系统的一种基于重叠的性质（称为非重叠覆盖（NOC））来研究正规网络和树孩子网络的聚类系统。我们证明了NOC性质等价于包含可见性，这是先前用于树孩子聚类系统的严格兼容性条件的逐成员表述。我们将正规网络精确地刻画为聚类系统满足NOC的半正则网络。因此，一个聚类系统由正规网络实现当且仅当它满足NOC，或者等价地，当且仅当它的每个簇都是包含可见的。在这种情况下，哈斯图提供了规范的正规实现。这些正是由树孩子网络实现的聚类系统。NOC表述产生了关于树孩子网络和正规网络的不同簇数量的一个尖锐的二次上界，以及一个直接的多项式时间识别算法。最后，我们探讨了NOC视角在系统发育设置之外的几个推论。这些包括与正规网络枚举的联系、包含可见性的序理论解释、NOC集合系统的结构性质，以及最小集合覆盖的一个可处理的特殊情况，该问题在一般情况下是NP困难的。
英文摘要
Clustering systems provide a natural way to encode structural information contained in phylogenetic networks. In this note, we study the clustering systems of normal and tree-child networks through an overlap-based property of set systems, called not-overlap-covered (NOC). We show that the NOC property is equivalent to inclusion-visibility, a memberwise formulation of the strict-compatibility condition previously used for tree-child clustering systems. We characterize normal networks as precisely the semi-regular networks whose clustering systems satisfy NOC. Consequently, a clustering system is realized by a normal network if and only if it satisfies NOC, or equivalently, if every one of its clusters is inclusion-visible. In this case, the Hasse diagram provides a canonical normal realization. These are exactly the clustering systems realized by tree-child networks. The NOC formulation yields a sharp quadratic upper bound on the number of distinct clusters of tree-child and normal networks and a direct polynomial-time recognition algorithm. Finally, we explore several consequences of the NOC perspective beyond the phylogenetic setting. These include connections to the enumeration of normal networks, an order-theoretic interpretation of inclusion-visibility, structural properties of NOC set systems, and a tractable special case of Minimum Set Cover, which is NP-hard in general.
