## A Trade-Off between Sample Complexity and Computational Complexity in Learning Boolean Networks from Time-Series Data

- Theodore J. Perkins, Michael T. Hallett
- IEEE/ACM Transactions on Computational Biology…
- 2010

Highly Influenced

@inproceedings{Akutsu1996ApproximatingMK, title={Approximating Minimum Keys and Optimal Substructure Screens}, author={Tatsuya Akutsu and Feng Bao}, booktitle={COCOON}, year={1996} }

- Published 1996 in COCOON
DOI:10.1007/3-540-61332-3_163

In this paper, we study the set cover problems, the minimum cardinality key problems and the optimal screen problems. We consider SET COVER-II, a variant of SET COVER, i.e., nding L sets among given n sets such that the cardinality of their union maximizes. We give both a lower bound and an upper bound to the approximation ratio of SET COVER-II and obtain a new result on SET COVER by approaching it from SET COVER-II. The minimum cardinality key problems and the optimal screen problems are more… CONTINUE READING