Completing Networks Using Observed Data

This paper studies problems of completing a given Boolean network (Boolean circuit) so that the input/output behavior is consistent with given examples, where we only consider acyclic networks. These problems arise in the study of inference of signaling networks using reporter proteins. We prove that these problems are NP-complete in general and a basic version remains NP-complete even for tree structured networks. On the other hand, we show that these problems can be solved in polynomial time for partial k-trees of bounded (constant) indegree if a logarithmic number of examples are given.

[1]  James Aspnes,et al.  Learning large-alphabet and analog circuits with value injection queries , 2008, Machine Learning.

[2]  M. Ng,et al.  Control of Boolean networks: hardness results and algorithms for tree structured networks. , 2007, Journal of theoretical biology.

[3]  V. Thorsson,et al.  Discovery of regulatory interactions through perturbation: inference and experimental design. , 1999, Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing.

[4]  David Eisenstat,et al.  Learning Acyclic Probabilistic Circuits Using Test Paths , 2008, COLT.

[5]  Satoru Miyano,et al.  Identification of Genetic Networks from a Small Number of Gene Expression Patterns Under the Boolean Network Model , 1998, Pacific Symposium on Biocomputing.

[6]  Satoru Miyano,et al.  Identification of genetic networks by strategic gene disruptions and gene overexpressions under a boolean model , 2003, Theor. Comput. Sci..

[7]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[8]  Jörg Flum,et al.  Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .

[9]  Umesh V. Vazirani,et al.  An Introduction to Computational Learning Theory , 1994 .

[10]  S. Brahmachari,et al.  Boolean network analysis of a neurotransmitter signaling pathway. , 2007, Journal of theoretical biology.

[11]  Stuart A. Kauffman,et al.  The origins of order , 1993 .

[12]  James Aspnes,et al.  Learning a circuit by injecting values , 2006, STOC '06.

[13]  A. Mochizuki.  Structure of regulatory networks and diversity of gene expression patterns. , 2008, Journal of theoretical biology.

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[15]  Hans L. Bodlaender,et al.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.

[16]  Katsuhisa Horimoto,et al.  TRAIL inhibited the cyclic AMP responsible element mediated gene expression. , 2009, Biochemical and biophysical research communications.

[17]  Leslie G. Valiant,et al.  Computational limitations on learning from examples , 1988, JACM.