An exact algorithm for the weighed mutually exclusive maximum set cover problem
Data Structures and Algorithms
2014-01-27 v1
Abstract
In this paper, we introduce an exact algorithm with a time complexity of for the {\sc weighted mutually exclusive maximum set cover} problem, where 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.
Cite
@article{arxiv.1401.6385,
title = {An exact algorithm for the weighed mutually exclusive maximum set cover problem},
author = {Songjian Lu and Xinghua Lu},
journal= {arXiv preprint arXiv:1401.6385},
year = {2014}
}