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

系统发生网络中的线性时间树包含

Linear-Time Tree Containment in Phylogenetic Networks

Mathias Weller

摘要:

我们考虑在系统发育学中具有重要应用的NP难树包含问题。这个问题是问一个给定的叶子标记网络是否包含一个给定的叶子标记树的细分。我们开发了一个快速算法的情况下,输入网络确实是一棵树,其中多个叶子可能共享一个标签。通过将该算法与一个已知的分解方案的推广相结合,我们将网状可见网络和近稳定网络的运行时间提高到线性时间。虽然这些都是特殊的网络类别,但它们是以前考虑过的最一般的网络类别之一。

英文摘要:

We consider the NP-hard Tree Containment problem that has important applications in phylogenetics. The problem asks if a given leaf-labeled network contains a subdivision of a given leaf-labeled tree. We develop a fast algorithm for the case that the input network is indeed a tree in which multiple leaves might share a label. By combining this algorithm with a generalization of a previously known decomposition scheme, we improve the running time on reticulation visible networks and nearly stable networks to linear time. While these are special classes of networks, they rank among the most general of the previously considered classes.

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

↑