系统进化网络簇包含问题的快速求解方法
Fast Methods for Solving the Cluster Containment Problem for Phylogenetic Networks
摘要:
遗传学和比较基因组学研究表明,现存的基因组更恰当地被认为是世代随机突变和不同谱系个体之间基因组物质转移的融合产物。这促使研究人员采用系统发育网络和其他通用模型来研究基因组进化。一个重要的问题所产生的系统发育网络的重建和验证是集群包含问题,即确定是否集群的分类群中显示的系统发育网络。在这项工作中,这个NP完全问题的一个新的上限是通过一个有效的减少SAT问题。两个有效的(虽然指数时间)的方法也实现。它是在系统发育网络的所谓网状可见属性的推广基础上发展起来的。
英文摘要:
Genetic and comparative genomic studies indicate that extant genomes are more properly considered to be a fusion product of random mutations over generations and genomic material transfers between individuals of different lineages. This has motivated researchers to adopt phylogenetic networks and other general models to study genome evolution. One important problem arising from reconstruction and verification of phylogenetic networks is the cluster containment problem, namely determining whether or not a cluster of taxa is displayed in a phylogenetic network. In this work, a new upper bound for this NP-complete problem is established through an efficient reduction to the SAT problem. Two efficient (albeit exponential time) methods are also implemented. It is developed on the basis of generalization of the so-called reticulation-visible property of phylogenetic networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。