Algorithmic issues in reverse engineering of protein and gene networks via the modular response analysis method

Annals of the New York Academy of Sciences

Volumn 1115, Issue , 2007, Pages 132-141

  Berman, Piotr ^a   DasGupta, Bhaskar ^b   Sontag, Eduardo ^c  

^a The Pennsylvania State University   (United States)

^b University of Illinois at Chicago   (United States)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

Biological networks; Randomized approximation algorithms; Reverse engineering; Set multicover

Indexed keywords

ALGORITHM; ANALYSIS; CONFERENCE PAPER; EXPERIMENTAL DESIGN; GENETICS; MODULAR RESPONSE ANALYSIS; MODULATION; PROTEIN ENGINEERING; THEORETICAL STUDY;

EID: 36248938269     PISSN: 00778923     EISSN: 17496632     Source Type: Book Series    
DOI: 10.1196/annals.1407.001     Document Type: Conference Paper

References (18)

1. KHOLODENKO, B.N., A. KIYATKIN, F. BRUGGEMAN, et al. 2002. Untangling the wires: a novel strategy to trace functional interactions in signaling and gene networks. Proc. Natl. Acad. Sci. USA 99: 12841-12846.
2. KHOLODENKO, B.N. & E.D. SONTAG. 2002. Determination of functional network structure from local parameter dependence data. arXiv physics/0205003, May 2002.
3. ANDREC, M., B.N. KHOLODENKO, R.M. LEVY & E.D. SONTAG. 2005. Inference of signaling and gene regulatory networks by steady-state perturbation experiments: structure and accuracy. J. Theoret. Biol. 232: 427-441.
4. SONTAG, E.D., A. KIYATKIN & B.N. KHOLODENKO. 2004. Inferring dynamic architecture of cellular networks using time series of gene expression, protein and metabolite data. Bioinformatics 20: 1877-1886.
5. CRAMPIN, E.J., S. SCHNELL & P.E. MCSHARRY. 2004. Mathematical and computational techniques to deduce complex biochemical reaction mechanisms. Prog.Biophys. Mol. Biol. 86: 77-112.
6. STARK, J., R. CALLARD & M. HUBANK. 2003. From the top down: towards a predictive biology of signaling networks. Trends Biotechnol. 21: 290-293.
7. SANTOS, S.D.M., P.J. VERVEER & P.I.H. BASTIAENS. 2007. Growth factor-induced MAPK network topology shapes Erk response determining PC-12 cell fate. Nat. Cell Biol. 9: 324-330.
8. BERMAN, P., B. DASGUPTA & E.D. SONTAG. 2007. Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks. Discrete Appl. Math [special series on computational molecular biology] 155: 733-749.
9. COVER, T. 1965. Geometrical and statistical properties of systems of linear inequalities with applications in pattern recognition. IEEE Trans. Electron. Comput. EC-14: 326-334.
10. (Reprinted [1992] in Artificial Neural Networks: Concepts and Theory. P. Mehra and B. Wah, Eds. IEEE Computer Society Press. Los Alamitos, CA.)
11. SCHLÄFLI, L. 1950. Theorie der vielfachen Kontinuitat (1852). In Gesammelte Mathematische Abhandlungen, Vol. 1: 177-392. Birkhäuser. Basel.
12. SONTAG, E.D. 1998. VC dimension of neural networks. In Neural Networks and Machine Learning. C.M. Bishop, Ed.: 69-95. Springer-Verlag. Berlin.
13. VAZIRANI, V. 2001. Approximation Algorithms. Springer-Verlag. Berlin.
14. FEIGE, U. 1998. A threshold for approximating set cover. JACM 45: 634-652.
15. RAZ, R. & S. SAFRA.1997. A sub-constant error-probability low-degree test and sub-constant error-probability PCP characterization of NP. Proceedings of the 29th Annual ACM Symposium on Theory of Computing, El Paso, Texas, ACM Press, NY, pp. 475-484.
16. TREVISAN, L. 2001. Non-approximability results for optimization problems on bounded degree instances. Proceedings of of the 33rd ACM Symposium on Theory of Computing, Hersonissos, Greece, ACM Press, NY, pp. 453-461.
17. GAREY, M.R. & D.S. JOHNSON. 1979. Computers and Intractability: a Guide to the Theory of NP-Completeness. W. H. Freeman & Co. New York.
18. JOHNSON, D.S. 1974. Approximation algorithms for combinatorial problems. J. Comput. Systems Sci. 9: 256-278.