From Boolean to probabilistic Boolean networks as models of genetic regulatory networks
- Additional Document Info
- View All
Mathematical and computational modeling of genetic regulatory nehvorks promises to uncover the fundamental principles governing biological systems in an integralive and holistic manner. It also paves the way toward the development of systematic approaches for effective therapeutic intervention in disease. The central theme in this paper is the Boolean formalism as a building block for modeling complex, large-scale, and dynamical networks of genetic interactions. We discuss the goals of modeling genetic networks as well as the data requirements. The Boolean formalism is justified from several points of view. We then introduce Boolean networks and discuss their relationships to nonlinear digital filters. The role of Boolean neftvorks in understanding cell differentiation and cellular functional states is discussed. The inference of Boolean networks from real gene expression data is considered from the viewpoints of computational learning theory and nonlinear signal processing, touching on computational complexity of learning and robustness. Then, a discussion of the need to handle uncertainty in a probabilistic framework is presented, leading to an introduction of probabilistic Boolean nehvorks and their relationships to Markov chains. Methods for quantifying the influence of genes on other genes are presented. The general question of the potential effect of individual genes on the global dynamical network behavior is considered using stochastic perturbation analysis. This discussion then leads into the problem of target identification for therapeutic intervention via the development of several computational tools based onfirst-passage times in Markov chains. Examples from biology are presented throughout the paper. 2002 IEEE.
author list (cited authors)
Shmulevich, I., Dougherty, E. R., & Mang, W.
complete list of authors
Shmulevich, I||Dougherty, ER||Mang, W