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.
Original language | English |
---|---|
Pages | 695-702 |
Number of pages | 8 |
Publication status | Published - 1998 |
Externally published | Yes |
Event | Proceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms - San Francisco, CA, USA Duration: Jan 25 1998 → Jan 27 1998 |
Other
Other | Proceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms |
---|---|
City | San Francisco, CA, USA |
Period | 1/25/98 → 1/27/98 |
All Science Journal Classification (ASJC) codes
- Software
- Mathematics(all)