最优运行时间下网状可见网络树包含问题的求解
Solving Tree Containment Problem for Reticulation-visible Networks with Optimal Running Time
摘要：
树包含问题是系统发育研究中的一个基本问题，用于验证网络模型。它询问给定的网络是否包含类似于二叉树的子树。该问题在一般情况下是NP完全的，即使在二进制网络类中也是如此。最近，对于一般网状可见网络类，它被证明可以在立方时间内求解，后来又被证明可以在二次时间内求解。在本文中，我们进一步提高到线性时间的时间复杂度。
英文摘要：
Tree containment problem is a fundamental problem in phylogenetic study, as it is used to verify a network model. It asks whether a given network contain a subtree that resembles a binary tree. The problem is NP-complete in general, even in the class of binary network. Recently, it was proven to be solvable in cubic time, and later in quadratic time for the class of general reticulation visible networks. In this paper, we further improve the time complexity into linear time.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
