Multi-parameter exploration of dynamics of regulatory networks

Multistability and predominant hybrid phenotypes in a four node mutually repressive network of Th1/Th2/Th17/Treg differentiation

Elucidating the emergent dynamics of cellular differentiation networks is crucial to understanding cell-fate decisions. Toggle switch - a network of mutually repressive lineage-specific transcription factors A and B - enables two phenotypes from a common progenitor: (high A, low B) and (low A, high B). However, the dynamics of networks enabling differentiation of more than two phenotypes from a progenitor cell has not been well-studied. Here, we investigate the dynamics of a four-node network A, B, C, and D inhibiting each other, forming a toggle tetrahedron. Our simulations show that this network is multistable and predominantly allows for the co-existence of six hybrid phenotypes where two of the nodes are expressed relatively high as compared to the remaining two, for instance (high A, high B, low C, low D). Finally, we apply our results to understand naïve CD4+ T cell differentiation into Th1, Th2, Th17 and Treg subsets, suggesting Th1/Th2/Th17/Treg decision-making to be a two-step process.

Network topology and interaction logic determine states it supports

In this review paper we summarize a recent progress on the problem of describing range of dynamics supported by a network. We show that there is natural connection between network models consisting of collections of multivalued monotone boolean functions and ordinary differential equations models. We show how to construct such collections and use them to answer questions about prevalence of cellular phenotypes that correspond to equilibria of network models.

Lattice structures that parameterize regulatory network dynamics

We consider two types of models of regulatory network dynamics: Boolean maps and systems of switching ordinary differential equations. Our goal is to construct all models in each category that are compatible with the directed signed graph that describe the network interactions. This leads to consideration of lattice of monotone Boolean functions (MBF), poset of non-degenerate MBFs, and a lattice of chains in these sets. We describe explicit inductive construction of these posets where the induction is on the number of inputs in MBF. Our results allow enumeration of potential dynamic behavior of the network for both model types, subject to practical limitation imposed by the size of the lattice of MBFs described by the Dedekind number.

Assessing biological network dynamics: comparing numerical simulations with analytical decomposition of parameter space

Mathematical modeling of the emergent dynamics of gene regulatory networks (GRN) faces a double challenge of (a) dependence of model dynamics on parameters, and (b) lack of reliable experimentally determined parameters. In this paper we compare two complementary approaches for describing GRN dynamics across unknown parameters: (1) parameter sampling and resulting ensemble statistics used by RACIPE (RAndom CIrcuit PErturbation), and (2) use of rigorous analysis of combinatorial approximation of the ODE models by DSGRN (Dynamic Signatures Generated by Regulatory Networks). We find a very good agreement between RACIPE simulation and DSGRN predictions for four different 2- and 3-node networks typically observed in cellular decision making. This observation is remarkable since the DSGRN approach assumes that the Hill coefficients of the models are very high while RACIPE assumes the values in the range 1-6. Thus DSGRN parameter domains, explicitly defined by inequalities between systems parameters, are highly predictive of ODE model dynamics within a biologically reasonable range of parameters.

Mathematical modeling of regulatory networks of intracellular processes - Aims and selected methods

Regulatory networks structure and signaling pathways dynamics are uncovered in time- and resource consuming experimental work. However, it is increasingly supported by modeling, analytical and computational techniques as well as discrete mathematics and artificial intelligence applied to to extract knowledge from existing databases. This review is focused on mathematical modeling used to analyze dynamics and robustness of these networks. This paper presents a review of selected modeling methods that facilitate advances in molecular biology.

Modeling Transport Regulation in Gene Regulatory Networks

A gene regulatory network summarizes the interactions between a set of genes and regulatory gene products. These interactions include transcriptional regulation, protein activity regulation, and regulation of the transport of proteins between cellular compartments. DSGRN is a network modeling approach that builds on traditions of discrete-time Boolean models and continuous-time switching system models. When all interactions are transcriptional, DSGRN uses a combinatorial approximation to describe the entire range of dynamics that is compatible with network structure. Here we present an extension of the DGSRN approach to transport regulation across a boundary between compartments, such as a cellular membrane. We illustrate our approach by searching a model of the p53-Mdm2 network for the potential to admit two experimentally observed distinct stable periodic cycles.

Application of Sensitivity Analysis to Discover Potential Molecular Drug Targets

Mathematical modeling of signaling pathways and regulatory networks has been supporting experimental research for some time now. Sensitivity analysis, aimed at finding model parameters whose changes yield significantly altered cellular responses, is an important part of modeling work. However, sensitivity methods are often directly transplanted from analysis of technical systems, and thus, they may not serve the purposes of analysis of biological systems. This paper presents a novel sensitivity analysis method that is particularly suited to the task of searching for potential molecular drug targets in signaling pathways. Using two sample models of pathways, p53/Mdm2 regulatory module and IFN-β-induced JAK/STAT signaling pathway, we show that the method leads to biologically relevant conclusions, identifying processes suitable for targeted pharmacological inhibition, represented by the reduction of kinetic parameter values. That, in turn, facilitates subsequent search for active drug components.

On convergence for hybrid models of gene regulatory networks under polytopic uncertainties: a Lyapunov approach

Hybrid models of genetic regulatory networks allow for a simpler analysis with respect to fully detailed quantitative models, still maintaining the main dynamical features of interest. In this paper we consider a piecewise affine model of a genetic regulatory network, in which the parameters describing the production function are affected by polytopic uncertainties. In the first part of the paper, after recalling how the problem of finding a Lyapunov function is solved in the nominal case, we present the considered polytopic uncertain system and then, after describing how to deal with sliding mode solutions, we prove a result of existence of a parameter dependent Lyapunov function subject to the solution of a feasibility linear matrix inequalities problem. In the second part of the paper, based on the previously described Lyapunov function, we are able to determine a set of domains where the system is guaranteed to converge, with the exception of a zero measure set of times, independently from the uncertainty realization. Finally a three nodes network example shows the validity of the results.

Rational design of complex phenotype via network models

We demonstrate a modeling and computational framework that allows for rapid screening of thousands of potential network designs for particular dynamic behavior. To illustrate this capability we consider the problem of hysteresis, a prerequisite for construction of robust bistable switches and hence a cornerstone for construction of more complex synthetic circuits. We evaluate and rank most three node networks according to their ability to robustly exhibit hysteresis where robustness is measured with respect to parameters over multiple dynamic phenotypes. Focusing on the highest ranked networks, we demonstrate how additional robustness and design constraints can be applied. We compare our results to more traditional methods based on specific parameterization of ordinary differential equation models and demonstrate a strong qualitative match at a small fraction of the computational cost.

A major challenge in the domains of systems and synthetic biology is an inability to efficiently predict function(s) of complex networks. This work demonstrates a modeling and computational framework that allows for a mathematically justifiable rigorous screening of thousands of potential network designs for a wide variety of dynamical behavior. We screen all 3-node genetic networks and rank them based on their ability to act as an inducible bistable switch. Our results are summarized in a searchable database that can be used to construct robust switches. The ability to quickly screen thousands of designs significantly reduces the set of viable designs and allows synthetic biologists to focus their experimental and more traditional modeling tools to this much smaller set.