Abstract
We study the problem of finding a genetic network from data obtained by multiple gene disruptions and overexpressions. We define a genetic network as a weighted graph, and analyze the computational complexity of the problem. We show that if there exists a weighted network which is consistent with given data, we can find it in polynomial time. Moreover, we also consider the optimization problem, where we try to find an optimally consistent weighted network with given data. We show that the problem is NP-hard. On the other hand, we give a polynomial-time approximation algorithm to solve it with approximation ratio 2. We report some simulation results on experiments.
