arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2105.04802cs.DS
收藏

使用变量树编辑距离。数学公式之间的相似性度量

Tree Edit Distance with Variables. Measuring the Similarity between Mathematical Formulas

Tatsuya Akutsu, Tomoya Mori, Naotoshi Nakamura, Satoshi Kozawa, Yuhei Ueno, Thomas N. Sato

摘要:

在本文中,我们提出了树编辑距离的变量,这是一个扩展的树编辑距离处理树的变量,并有一个潜在的应用程序来衡量数学公式之间的相似性,特别是,那些出现在生物系统的数学模型。我们分析了这个新模型的几个变体的计算复杂性。特别是,我们证明了这个问题是NP-完全的有序树。我们还表明,无序树的问题,决定是否是0的距离是图同构完成,但可以解决在多项式时间,如果输入树的最大outdegree是由一个常数。然后,该距离模型被扩展用于测量两个微分方程系统之间的差异/相似性,为此提供了使用生物模型的初步计算实验的结果。

英文摘要:

In this article, we propose tree edit distance with variables, which is an extension of the tree edit distance to handle trees with variables and has a potential application to measuring the similarity between mathematical formulas, especially, those appearing in mathematical models of biological systems. We analyze the computational complexities of several variants of this new model. In particular, we show that the problem is NP-complete for ordered trees. We also show for unordered trees that the problem of deciding whether or not the distance is 0 is graph isomorphism complete but can be solved in polynomial time if the maximum outdegree of input trees is bounded by a constant. This distance model is then extended for measuring the difference/similarity between two systems of differential equations, for which results of preliminary computational experiments using biological models are provided.

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

↑