AND-NOT logic framework for steady state analysis of Boolean network models

Finite dynamical systems (e.g. Boolean networks and logical models) have been used in modeling biological systems to focus attention on the qualitative features of the system, such as the wiring diagram. Since the analysis of such systems is hard, it is necessary to focus on subclasses that have the properties of being general enough for modeling and simple enough for theoretical analysis. In this paper we propose the class of AND-NOT networks for modeling biological systems and show that it provides several advantages. Some of the advantages include: Any finite dynamical system can be written as an AND-NOT network with similar dynamical properties. There is a one-to-one correspondence between AND-NOT networks, their wiring diagrams, and their dynamics. Results about AND-NOT networks can be stated at the wiring diagram level without losing any information. Results about AND-NOT networks are applicable to any Boolean network. We apply our results to a Boolean model of Th-cell differentiation.

[1]  S. Orkin,et al.  Functional synergy and physical interactions of the erythroid transcription factor GATA-1 with the Krüppel family proteins Sp1 and EKLF , 1995, Molecular and cellular biology.

[2]  Kazuhisa Makino,et al.  New Algorithms for Enumerating All Maximal Cliques , 2004, SWAT.

[3]  Abdul Salam Jarrah,et al.  Nested Canalyzing, Unate Cascade, and Polynomial Functions. , 2006, Physica D. Nonlinear phenomena.

[4]  Brian M. Gummow,et al.  Reciprocal regulation of a glucocorticoid receptor-steroidogenic factor-1 transcription complex on the Dax-1 promoter by glucocorticoids and adrenocorticotropic hormone in the adrenal cortex. , 2006, Molecular endocrinology.

[5]  R. Albert.  Scale-free networks in cell biology , 2005, Journal of Cell Science.

[6]  R. Laubenbacher,et al.  On the computation of fixed points in Boolean networks , 2012 .

[7]  B. Elspas,et al.  The Theory of Autonomous Linear Sequential Networks , 1959 .

[8]  Roger Wattenhofer,et al.  Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs , 2005, DISC.

[9]  Lhouari Nourine,et al.  Enumeration aspects of maximal cliques and bicliques , 2009, Discret. Appl. Math..

[10]  Dominik M. Wittmann,et al.  Biologically meaningful update rules increase the critical connectivity of generalized Kauffman networks. , 2010, Journal of theoretical biology.

[11]  Steffen Klamt,et al.  A methodology for the structural and functional analysis of signaling and regulatory networks , 2006, BMC Bioinformatics.

[12]  Roger Wattenhofer,et al.  A log-star distributed maximal independent set algorithm for growth-bounded graphs , 2008, PODC '08.

[13]  Nagiza F. Samatova,et al.  A scalable, parallel algorithm for maximal clique enumeration , 2009, J. Parallel Distributed Comput..

[14]  Dat H. Nguyen,et al.  Deciphering principles of transcription regulation in eukaryotic genomes , 2006, Molecular systems biology.

[15]  Denis Thieffry,et al.  From Logical Regulatory Graphs to Standard Petri Nets: Dynamical Roles and Functionality of Feedback Circuits , 2006, Trans. Comp. Sys. Biology.

[16]  David Eppstein,et al.  All maximal independent sets and dynamic dominance for sparse graphs , 2004, TALG.

[17]  Bin Wu,et al.  Parallel Algorithm for Enumerating Maximal Cliques in Complex Network , 2009, Mining Complex Data.

[18]  É. Remy,et al.  Mapping multivalued onto Boolean dynamics. , 2011, Journal of theoretical biology.

[19]  S. Kauffman,et al.  Genetic networks with canalyzing Boolean rules are always stable. , 2004, Proceedings of the National Academy of Sciences of the United States of America.

[20]  Ioannis Xenarios,et al.  A method for the generation of standardized qualitative dynamical systems of regulatory networks , 2005, Theoretical Biology and Medical Modelling.

[21]  Eric Goles Ch.,et al.  Fixed points and maximal independent sets in AND-OR networks , 2004, Discret. Appl. Math..

[22]  Bin Wu,et al.  A New Algorithm for Enumerating All Maximal Cliques in Complex Network , 2006, ADMA.

[23]  L. Raeymaekers,et al.  Dynamics of Boolean networks controlled by biologically meaningful functions. , 2002, Journal of theoretical biology.

[24]  R. Laubenbacher,et al.  Regulatory patterns in molecular interaction networks. , 2011, Journal of theoretical biology.

[25]  R. Laubenbacher,et al.  The number of multistate nested canalyzing functions , 2011, 1108.0206.

[26]  Holger Fröhlich,et al.  Modeling ERBB receptor-regulated G1/S transition to find novel targets for de novo trastuzumab resistance , 2009, BMC Systems Biology.

[27]  Abdul Salam Jarrah,et al.  The effect of negative feedback loops on the dynamics of boolean networks. , 2007, Biophysical journal.

[28]  M. Huynen,et al.  The frequency distribution of gene family sizes in complete genomes. , 1998, Molecular biology and evolution.

[29]  Abdul Salam Jarrah,et al.  The Dynamics of Conjunctive and Disjunctive Boolean Network Models , 2010, Bulletin of mathematical biology.

[30]  Réka Albert,et al.  Elementary signaling modes predict the essentiality of signal transduction network components , 2011, BMC Systems Biology.

[31]  E. Sperner.  Ein Satz über Untermengen einer endlichen Menge , 1928 .

[32]  Adrien Richard,et al.  Positive circuits and maximal number of fixed points in discrete dynamical systems , 2008, Discret. Appl. Math..

[33]  J. Aracena.  Maximum Number of Fixed Points in Regulatory Boolean Networks , 2008, Bulletin of mathematical biology.

[34]  Doheon Lee,et al.  Inference of combinatorial Boolean rules of synergistic gene sets from cancer microarray datasets , 2010, Bioinform..

[35]  D Thieffry,et al.  GINsim: a software suite for the qualitative modelling, simulation and analysis of regulatory networks. , 2006, Bio Systems.

[36]  Carsten Peterson,et al.  Random Boolean network models and the yeast transcriptional network , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[37]  Denis Thieffry,et al.  Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework , 2008, Adv. Appl. Math..

[38]  S. Kauffman.  Homeostasis and Differentiation in Random Genetic Control Networks , 1969, Nature.

[39]  Jesper Makholm Byskov.  Enumerating maximal independent sets with applications to graph colouring , 2004, Oper. Res. Lett..

[40]  ParkByung-Hoon,et al.  A scalable, parallel algorithm for maximal clique enumeration , 2009 .

[41]  Eugene L. Lawler,et al.  Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms , 1980, SIAM J. Comput..