Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks
From MaRDI portal
Publication:876471
DOI10.1016/j.dam.2004.11.009zbMath1163.68045MaRDI QIDQ876471
Eduardo D. Sontag, Piotr Berman, Bhaskar Das Gupta
Publication date: 18 April 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2004.11.009
92C40: Biochemistry, molecular biology
92D10: Genetics and epigenetics
68W25: Approximation algorithms
68W20: Randomized algorithms
Related Items
Cites Work
- A new polynomial-time algorithm for linear programming
- Inference of signaling and gene regulatory networks by steady-state perturbation experiments: structure and accuracy
- Approximation algorithms for combinatorial problems
- A threshold of ln n for approximating set cover
- Enumeration of Seven-Argument Threshold Functions
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item