y
|
Abstract:
A hot research topic in Genome Science is to analyze the interactions between genes by systematic gene disruptions and gene overexpressions. This paper analyzes the problem of identifying a gene regulatory network from data obtained by multiple gene disruptions and overexpressions in regard to the number of experiments and the complexity of experiments. An experiment consists of a parallel gene disruptions and overexpressions and the complexity of an experiment is the number of genes disrupted or overexpressed. We define a gene regulatory network as a boolean network and show a series of algorithms which describe methods for identifying the underlying gene regulatory network by such experiments. Some lower bounds on the number of experiments required for the identification are also proved for some cases. 1
Citations
| 528 | Queries and concept learning – Angluin - 1988 |
| 101 | Computational Learning Theory – Anthony, Biggs - 1992 |
| 74 | Exact Learning via the Monotone Theory – Bshouty - 1993 |
| 66 | Complexity of identification and dualization of positive Boolean functions – Bioch, Ibaraki - 1995 |
| 47 | Modeling the complexity of genetic networks: Understanding multigenic and pleiotropic regulation – Somogyi, Sniegoski - 1996 |
| 45 | Dynamical behaviour of biological regulatory networks: I. Biological rool of feedback loops and practical use of the concept of the loop-characteristicstate – Thomas, Thieffry, et al. - 1995 |
