[论文解读] Combinatorial comparison of general galled trees, time-consistent galled trees, and simplex time-consistent galled trees

Lily Agranat-Tamir, Michael Fuchs+3 more|arXiv (Cornell University)|Jan 12, 2026

Genomics and Phylogenetic Studies被引用 0

一句话总结

论文比较三类根二元发病树（一般的、时间一致的、以及简化的时间一致的），推导它们的无标签和叶节点标注的计数，证明在固定 gall 数量下它们在渐近意义上等价；而在不固定 gall 时它们则趋于发散。

ABSTRACT

Rooted binary phylogenetic networks are extensions of rooted binary trees, adding reticulation nodes that are designed to represent evolutionary processes that involve hybridization events. Enumerative combinatorics studies have counted leaf-labeled phylogenetic networks in a variety of classes, finding that when the number of reticulations is fixed, the time-consistent galled trees are asymptotically less numerous than each of several network classes that had been previously examined. Here we provide enumerative results on two additional network classes: general galled trees and simplex time-consistent galled trees. We show that for a fixed number of galls, as the number of leaves goes to infinity, the asymptotic count of general galled trees is identical to that of time-consistent galled trees, whereas the count of simplex time-consistent galled trees is smaller. If the number of galls is not restricted, then the asymptotic approximations all differ: simplex time-consistent galled trees are less numerous than time-consistent galled trees, which are in turn less numerous than general galled trees. We also report a variety of additional results: recursions to count the studied networks with small numbers of leaves a fixed number of galls, as well as enumerative results for unlabeled networks in the classes that we investigate.

研究动机与目标

• 激发并扩展带 gall 的叶标记和无标签根二元系统网络的枚举。
• 确定在固定 gall 数量下，一般 galled 树和简化时间一致 galled 树是否与时间一致 galled 树具有相同的渐近性质。
• 提供递推和生成函数框架，以计量小叶实例并推导跨类别的渐近行为。

提出的方法

• 为一般 galled 树、时间一致 galled 树和简化时间一致 galled 树建立无标签和叶标记的生成函数。
• 使用符号方法和双变量生成函数对叶和 gall 进行编码，包括对导数以固定 gall 数量。
• 在叶数增长时推导渐近近似，含固定 gall 和不固定 gall 的情况（第3–6节）。
• 通过从生成函数中提取系数并使用 Faà di Bruno 和 Leibniz 规则处理导数，比较各类别的渐近增长（第3.5–3.6节，4.5–4.6节）。
• 得到用于小叶数的 exact counts 的递推式（第7节）。

Figure 1: Three classes of phylogenetic networks. (A) A general galled tree. This galled tree is not a time-consistent galled tree because it has a gall (light blue) whose top node is not separated from the reticulation node by at least two edges (it is a parent of the reticulation node). (B) A time

实验结果

研究问题

• RQ1 当固定 gall 数量时，一般 galled 树和时间一致 galled 树是否具有相同的渐近计数？
• RQ2 简化时间一致类是否在固定 gall 的渐近性质上与其他时间一致族相同？
• RQ3 当 gall 数量不受限时，三类之间的渐近性质有何差异？
• RQ4 在各类别中，对小叶数的精确计数递推是什么？
• RQ5 对于这些类，标记与无标记枚举之间有何差异？

主要发现

• 在固定 gall 数量下，随着叶数增加，一般 galled 树的渐近计数与时间一致 galled 树相同；简化时间一致 gall ed 树的渐近计数较小。
• 当 gall 数量不固定时，简化时间一致 galled 树的数量少于时间一致 galled 树，后者又少于一般 galled 树。
• 论文给出对小叶数且 gall 固定时的网络计数递推，以及所研究类别中无标签网络的枚举结果。
• 在每个类别内推导出无标签和叶标记计数，并且在固定 gall 时其渐近行为与时间一致基线对齐；但在 gall 不受限时则出现分歧。
• 分析表明，固定 gall 时，一般 galled 树的渐近性与固定 gall 的时间一致树相似，但在固定 gall 约束下，简化时间一致 galled 树的行为不同。

Figure 2: The three structures possible for a (non-plane) unlabeled general galled tree with exactly one gall.