arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.10015q-bio.PEcs.DM
收藏

果园网络的扩展$μ$表示法比较

Comparison of orchard networks using their extended $μ$-representation

Gabriel Cardona, Joan Carles Pons, Gerard Ribas, Tomás Martínez Coronado

摘要:

系统发生网络概括了系统发育树,以模拟网状事件。虽然系统发育树的比较已经得到了很好的研究,并且有多种方法可以有效地进行比较,但系统发育网络的情况却大不相同。已知某些类的系统发育网络,主要是树子网络,可以通过它们的$μ$表示有效地分类,该表示基本上为每个节点计算到每个叶子的路径的数量。在本文中,我们介绍了网络的扩展$μ$ -表示,其中的路径的数量,网状也考虑在内。这种修改使我们能够区分果园网络,并定义一个健全的度量空间,这样的网络,而且,可以有效地计算。果园网络类,以及作为具有生物学意义的类之一(一个这样的网络可以被解释为一棵树,它有额外的弧,涉及共存的生物体),是最通用的一类(在数学术语中),这种表示可以(在数学上)存在,因为稍微放松定义会导致图同构完全的问题。

英文摘要:

Phylogenetic networks generalize phylogenetic trees in order to model reticulation events. Although the comparison of phylogenetic trees is well studied, and there are multiple ways to do it in an efficient way, the situation is much different for phylogenetic networks. Some classes of phylogenetic networks, mainly tree-child networks, are known to be classified efficiently by their $μ$-representation, which essentially counts, for every node, the number of paths to each leaf. In this paper, we introduce the extended $μ$-representation of networks, where the number of paths to reticulations is also taken into account. This modification allows us to distinguish orchard networks and to define a sound metric on the space of such networks that can, moreover, be computed efficiently. The class of orchard networks, as well as being one of the classes with biological significance (one such network can be interpreted as a tree with extra arcs involving coexisting organisms), is one of the most generic ones (in mathematical terms) for which such a representation can (conjecturally) exist, since a slight relaxation of the definition leads to a problem that is Graph Isomorphism Complete.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑