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

加权互斥集合覆盖问题的时间复杂度为$O^*(1.299^m)$的精确算法

An exact algorithm with the time complexity of $O^*(1.299^m)$ for the weighed mutually exclusive set cover problem

Songjian Lu, Xinghua Lu

摘要:

本文针对{ \sc加权互斥集合覆盖}问题,给出了一个时间复杂度为$O^*(1.299^m)$的精确算法,其中$m$是问题中子集的个数.这个问题在识别导致不同癌症疾病的突变基因方面具有重要的应用。

英文摘要:

In this paper, we will introduce an exact algorithm with a time complexity of $O^*(1.299^m)$ for the {\sc weighted mutually exclusive set cover} problem, where $m$ is the number of subsets in the problem. This problem has important applications in recognizing mutation genes that cause different cancer diseases.

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

↑