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

preprint2013arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

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

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

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

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

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