Completing networks using observed data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5809 LNAI, Issue , 2009, Pages 126-140

  Akutsu, Tatsuya ^a   Tamura, Takeyuki ^a   Horimoto, Katsuhisa ^b  

^a KYOTO UNIVERSITY   (Japan)

^b Japan Biological Information Research Center   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ACYCLIC NETWORKS; BOOLEAN CIRCUIT; BOOLEAN NETWORKS; IN-DEGREE; INPUT/OUTPUT BEHAVIORS; NP COMPLETE; OBSERVED DATA; PARTIAL K-TREES; POLYNOMIAL-TIME; REPORTER PROTEIN; SIGNALING NETWORKS; STRUCTURED NETWORKS;

POLYNOMIAL APPROXIMATION; SIGNALING;

COMPUTATIONAL COMPLEXITY;

EID: 77952062748     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04414-4_14     Document Type: Conference Paper

References (16)

1. Akutsu, T., Miyano, S., Kuhara, S.: Identification of genetic networks from a small number of gene expression patterns under the Boolean network model. In: Proc. Pacific Symposium on Biocomputing 1999, pp. 17-28 (1999)
2. Akutsu, T., Kuhara, S., Maruyama, O., Miyano, S.: Identification of genetic networks by strategic gene disruptions and gene overexpressions under a Boolean model. Theoretical Computer Science 298, 235-251 (2003)
3. Akutsu, T., Hayashida, M., Ching, W.-K., Ng, M.K.: Control of Boolean networks: Hardness results and algorithms for tree structured networks. Journal of Theoretical Biology 244, 670-679 (2007) (Pubitemid 46148979)
4. Angluin, D., Aspnes, J., Chen, J., Wu, Y.: Learning a circuit by injecting values. In: Proc. 38th Annual ACM Symposium on Theory of Computing, pp. 584-593 (2006)
5. Angluin, D., Aspnes, J., Chen, J., Reyzin, L.: Learning large-alphabet and analog circuits with value injection queries. Machine Learning 72, 113-138 (2008)
6. Angluin, D., Aspnes, J., Chen, J., Eisenstat, D., Reyzin, L.: Learning acyclic probabilistic circuits using test paths. In: Proc. 21st Annual Conference on Learning Theory, pp. 169-180 (2008)
7. Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing 25, 1305-1317 (1996)
8. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)
9. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., New York (1979)
10. Gupta, S., Bisht, S.S., Kukreti, R., Jain, S., Brahmachari, S.K.: Boolean network analysis of a neurotransmitter signaling pathway. Journal of Theoretical Biology 244, 463-469 (2007) (Pubitemid 46027147)
11. Ideker, T.E., Thorsson, V., Karp, R.M.: Discovery of regulatory interactions through perturbation: inference and experimental design. In: Proc. Pacific Symposium on Biocomputing 2000, pp. 302-313 (2000)
12. Kauffman, S.A.: The Origins of Order: Self-organization and Selection in Evolution. Oxford Univ. Press, NY (1993)
13. Kearns, M.J., Vazirani, U.V.: An Introduction to Computational Learning Theory. MIT Press, Cambridge (1994)
14. Mochizuki, A.: Structure of regulatory networks and diversity of gene expression patterns. Journal of Theoretical Biology 250, 307-321 (2008)
15. Pitt, L., Valiant, L.G.: Computational limitations on learning from examples. Journal of the ACM 35, 965-984 (1988)
16. Tokumoto, Y., Horimoto, K., Miyake, J.: TRAIL inhibited the cyclic AMP responsible element mediated gene expression. Biochemical and Biophysical Research Communications 381, 533-536 (2009)