The Factor Graph Network Model for Biological Systems
We introduce an extended computational framework for studying biological systems. Our approach combines formalization of existing qualitative models that are in wide but informal use today, with probabilistic modeling and integration of high throughput experimental data. Using our methods, it is possible to interpret genomewide measurements in the context of prior knowledge on the system, to assign statistical meaning to the accuracy of such knowledge and to learn refined models with improved fit to the experiments. Our model is represented as a probabilistic factor graph and the framework accommodates partial measurements of diverse biological elements. We develop methods for inference and learning in the model. We compare the performance of standard inference algorithms and tailor-made ones and show that hidden variables can be reliably inferred even in the presence of feedback loops and complex logic. We develop a formulation for the learning problem in our model which is based on deterministic hypothesis testing, and show how to derive p-values for learned model features. We test our methodology and algorithms on both simulated and real yeast data. In particular, we use our method to study the response of S. cerevisiae to hyper-osmotic shock, and explore uncharacterized logical relations between important regulators in the system.
KeywordsBayesian Network Discretization Scheme Inference Algorithm Factor Graph Posterior Mode
Unable to display preview. Download preview PDF.
- 3.Chen, K.C., et al.: Kinetic analysis of a molecular model of the budding yeast cell cycle. Mol. Biol. Cell 11, 369–391 (2000)Google Scholar
- 7.Friedman, N., Murphy, K., Russell, S.: Learning the structure of dynamic probabilistic networks. In: Proc. 14th Conference on Uncertainty in Artificial Intelligence, pp. 139–147 (1998)Google Scholar
- 9.Hartemink, A., Gifford, D., Jaakkola, T., Young, R.: Combining location and expression data for principled discovery of genetic regulatory networks. In: Proceedings of the 2002 Pacific Symposioum in Biocomputing (PSB 2002), pp. 437–449 (2002)Google Scholar
- 13.Jaakkola, T.S.: Tutorial on variational approximation methods. In: Saad, D., Opper, M. (eds.) Advanced Mean Field Methods - Theory and Practice, pp. 129–160. MIT Press, Cambridge (2001)Google Scholar
- 15.MacKay, D.J.C.: Introduction to Monte Carlo methods. In: Jordan, M.I. (ed.) Learning in Graphical Models, pp. 175–204. Kluwer Academic Press, Dordrecht (1998)Google Scholar
- 18.Pearl, J.: Probabilistic Reasoning in intelligent systems. Morgan Kaufmann publishers, Inc., San Francisco (1988)Google Scholar
- 19.Proft, M., Serrano, R.: Repressors and upstream repressing sequences of the stress-regulated ena1 gene in saccharomyces cerevisiae: bzip protein sko1p confers hog-dependent osmotic regulation. Mol. Biol. Cell. 19, 537–546 (1999)Google Scholar
- 20.Rep, M., Krantz, M., Thevelein, J.M., Hohmann, S.: The transcriptional response of saccharomyces cerevisiae to osmotic shock. hot1p and msn2p/msn4p are required for the induction of subsets of high osmolarity glycerol pathway-dependent genes. J. Biol. Chem. 275, 8290–8300 (2000)CrossRefGoogle Scholar
- 21.Rep, M., Reiser, V., Holzmller, U., Thevelein, J.M., Hohmann, S., Ammerer, G., Ruis, H.: Osmotic stress-induced gene expression in saccharomyces cerevisiae requires msn1p and the novel nuclear factor hot1p. Mol. Cell. Biol. 19, 5474–5485 (1999)Google Scholar
- 24.Smith, V.A., Jarvis, E.D., Hartemink, A.J.: Evaluating functional network inference using simulations of complex biological systems. Bioinformatics 18, 216–224 (2002)Google Scholar
- 25.Tanay, A., Shamir, R.: Computational expansion of genetic networks. Bioinformatics 17, S270–S278 (2001)Google Scholar
- 28.Yedidia, S., Freeman, W.T., Weiss, Y.: Constructing free energy approximations and generalized belief propagation algorithms. Technical Report TR-2004-040, Mitsubishi electric resaerch laboratories (2004)Google Scholar