Analysis of the interactions between genes by systematic gene disruptions and gene overexpressions is an important topic in molecular biology. This paper analyses the problem of identifying a genetic network from the data obtained by multiple gene disruptions and overexpressions in regard to the number of experiments and the complexity of experiments. An experiment consists of simultaneous gene disruptions and overexpressions and the complexity of an experiment is the number of genes disrupted or overexpressed. We deÿne a genetic network as a boolean network and show a series of algorithms which describe methods for identifying the underlying genetic network by such experiments. Some lower bounds on the number of experiments required for the identiÿcation are also proved for some cases.
Closer to experimental design, Akutsu et al. also have studied the problem of identifying a genetic Boolean network from experimental data in regard to the number and the complexity of experiments needed REF .
Identification of genetic networks by strategic gene disruptions and gene overexpressions under a boolean model
Theor. Comput. Sci.
Theor. Comput. Sci.
Mathematics Computer Science