arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2607.08259cs.DM
收藏

用于比较系统发育网络的$\ominus$-度量

The $\ominus$-metric to compare phylogenetic networks

Leipzig University(莱比锡大学);Stockholm University(斯德哥尔摩大学);Université de Sherbrooke(舍布鲁克大学);Greifswald University(格赖夫斯瓦尔德大学)

Marc Hellmuth, Manuel Lafond, Guillaume E. Scholz

AI总结:

研究提出基于$\ominus$-算子的两种新距离比较有根系统发育网络,证明其度量性质,表明它们扩展了罗宾逊-福尔兹距离且有下限,指出$d_{\ominus}^-$可多项式时间计算,$d_{\ominus}$计算复杂,还给出特定网络类的计算情况。

摘要:

我们基于$\ominus$-算子引入了两种用于比较有根系统发育网络的新距离。该算子在保留其余顶点间祖先关系的同时移除一个顶点。距离$d_{\ominus}$衡量获得同构网络所需的最少移除次数,而$d_{\ominus}^-$忽略捷径弧并比较诱导的祖先结构。我们证明$d_{\ominus}$在叶固定同构下是度量,$d_{\ominus}^-$在无捷径同构下是度量。它们扩展了系统发育树上的罗宾逊-福尔兹距离且有下限。对于多种网络类,$d_{\ominus}^-$可多项式时间计算,而计算$d_{\ominus}$是NP难等。

英文摘要:

We introduce two novel distances for comparing rooted phylogenetic networks based on the $\ominus$-operator, which removes a vertex while preserving the ancestor relations among the remaining vertices. The distance $d_{\ominus}$ measures the minimum number of such removals needed to obtain isomorphic networks, whereas $d_{\ominus}^-$ ignores shortcut arcs and therefore compares the induced ancestry structures. We show that $d_{\ominus}$ is a metric up to leaf-fixing isomorphism and that $d_{\ominus}^-$ is a metric up to shortcut-free isomorphism. Moreover, both distances extend the Robinson--Foulds distance on phylogenetic trees and are bounded below by the hardwired cluster distances. For several broad network classes, including tree-child, normal, level-$1$, and regular networks, $d_{\ominus}^-$ can be computed in polynomial time. In contrast, computing $d_{\ominus}$ is NP-hard, W[2]-hard when parameterized by the distance value, and admits no polynomial-time constant-factor approximation unless $\mathrm{P}=\mathrm{NP}$. Although computing $d_{\ominus}^-$ is NP-hard in general, for distinct-cluster networks it reduces to \textsc{Vertex Cover}, yielding a fixed-parameter algorithm and a polynomial-time $2$-approximation.

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

↑