Reeb图的树分解、参数化复杂性及其在遗传学中的应用
Tree decomposition of Reeb graphs, parametrized complexity, and applications to phylogenetics
摘要:
受持续模块的区间分解和系统发育网络的扩展Newick格式的启发,我们证明了在\textit{ordered Reeb graphs}的大范畴内,每个具有$n$叶子和第一个贝蒂数$s$的Reeb图,都等于至多一个具有$(n + s)$叶子的$2^s$树的余积.因此,Reeb图通过它们的树分解被分类为同构。这个结果的一个推论是当参数是第一个贝蒂数时,Reeb图的同构问题是固定参数可处理的.我们提出了有序Reeb图作为时间一致的系统发育网络的模型,并提出了一定的Hausdorff距离作为这些结构的度量。
英文摘要:
Inspired by the interval decomposition of persistence modules and the extended Newick format of phylogenetic networks, we show that, inside the larger category of \textit{ordered Reeb graphs}, every Reeb graph with $n$ leaves and first Betti number $s$, is equal to a coproduct of at most $2^s$ trees with $(n + s)$ leaves. Reeb graphs are therefore classified up to isomorphism by their tree decomposition. An implication of this result, is that the isomorphism problem for Reeb graphs is fixed parameter tractable when the parameter is the first Betti number. We propose ordered Reeb graphs as a model for time consistent phylogenetic networks and propose a certain Hausdorff distance as a metric on these structures.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。