加权互斥最大集覆盖问题的一个精确算法
An exact algorithm for the weighed mutually exclusive maximum set cover problem
摘要:
本文给出了求解{ \sc加权互斥最大集覆盖}问题的一个时间复杂度为$O^*(1.325^m)$的精确算法,其中$m$是问题中子集的个数.这是一个NP难的动机和抽象的生物信息学问题的识别信号通路的基因突变。目前,这个问题是解决使用启发式算法,这不能保证解决方案的性能。通过提供一个相对有效的精确算法,我们的方法将增加在癌症研究的应用中找到更好的解决方案的能力。
英文摘要:
In this paper, we introduce an exact algorithm with a time complexity of $O^*(1.325^m)$ for the {\sc weighted mutually exclusive maximum set cover} problem, where $m$ is the number of subsets in the problem. This is an NP-hard motivated and abstracted from a bioinformatics problem of identifying signaling pathways based gene mutations. Currently, this problem is addressed using heuristic algorithms, which cannot guarantee the performance of the solution. By providing a relatively efficient exact algorithm, our approach will like increase the capability of finding better solutions in the application of cancer research.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。