Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Net

In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as follows: bstract a combinatorial version of the problem and observe that this is “equivalent” to the set multicover problem when the “coverage” factor k is a function of the number of elements n of the universe. An important special case for our application

• Type: Conference
• Year: 2004
• Where: APPROX
• Authors: Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag
• Keywords: Algorithms, APPROX 2004, Combinatorial Problem, Computational Complexity, Set Multicover Problem