On the relationship of steady states of continuous and discrete models arising from biology

Optimising Boolean Synthetic Regulatory Networks to Control Cell States

Controlling the dynamics of gene regulatory networks is a challenging problem. In recent years, a number of control methods have been proposed, but most of these approaches do not address the problem of how they could be implemented in practice. In this paper, we consider the idea of using a synthetic regulatory network as a closed-loop controller that can control and respond to the dynamics of a cell's native regulatory network in situ. We explore this idea using a computational model in which both native and synthetic regulatory networks are represented by Boolean networks. We then use an evolutionary algorithm to optimise both the structure and parameters of the synthetic Boolean network. To test this approach, we look at whether controllers can be optimised to target specific steady states in five different Boolean regulatory circuit models. Our results show that in most cases the controllers are able to drive the dynamics of the target system to a specified steady state, often using few interventions, and further experiments using random Boolean networks show that the approach scales well to larger controlled networks.

Evolution of Cellular Differentiation: From Hypotheses to Models

Cellular differentiation is one of the hallmarks of complex multicellularity, allowing individual organisms to capitalize on among-cell functional diversity. The evolution of multicellularity is a major evolutionary transition that allowed for the increase of organismal complexity in multiple lineages, a process that relies on the functional integration of cell-types within an individual. Multiple hypotheses have been proposed to explain the origins of cellular differentiation, but we lack a general understanding of what makes one cell-type distinct from others, and how such differentiation arises. Here, we describe how the use of Boolean networks (BNs) can aid in placing empirical findings into a coherent conceptual framework, and we emphasize some of the standing problems when interpreting data and model behaviors.

Bistability and Asynchrony in a Boolean Model of the L-arabinose Operon in Escherichia coli

The lactose operon in Escherichia coli was the first known gene regulatory network, and it is frequently used as a prototype for new modeling paradigms. Historically, many of these modeling frameworks use differential equations. More recently, Stigler and Veliz-Cuba proposed a Boolean model that captures the bistability of the system and all of the biological steady states. In this paper, we model the well-known arabinose operon in E. coli with a Boolean network. This has several complex features not found in the lac operon, such as a protein that is both an activator and repressor, a DNA looping mechanism for gene repression, and the lack of inducer exclusion by glucose. For 11 out of 12 choices of initial conditions, we use computational algebra and Sage to verify that the state space contains a single fixed point that correctly matches the biology. The final initial condition, medium levels of arabinose and no glucose, successfully predicts the system's bistability. Finally, we compare the state space under synchronous and asynchronous update and see that the former has several artificial cycles that go away under a general asynchronous update.

Identification of control targets in Boolean molecular network models via computational algebra

BACKGROUND

Many problems in biomedicine and other areas of the life sciences can be characterized as control problems, with the goal of finding strategies to change a disease or otherwise undesirable state of a biological system into another, more desirable, state through an intervention, such as a drug or other therapeutic treatment. The identification of such strategies is typically based on a mathematical model of the process to be altered through targeted control inputs. This paper focuses on processes at the molecular level that determine the state of an individual cell, involving signaling or gene regulation. The mathematical model type considered is that of Boolean networks. The potential control targets can be represented by a set of nodes and edges that can be manipulated to produce a desired effect on the system.

RESULTS

This paper presents a method for the identification of potential intervention targets in Boolean molecular network models using algebraic techniques. The approach exploits an algebraic representation of Boolean networks to encode the control candidates in the network wiring diagram as the solutions of a system of polynomials equations, and then uses computational algebra techniques to find such controllers. The control methods in this paper are validated through the identification of combinatorial interventions in the signaling pathways of previously reported control targets in two well studied systems, a p53-mdm2 network and a blood T cell lymphocyte granular leukemia survival signaling network. Supplementary data is available online and our code in Macaulay2 and Matlab are available via http://www.ms.uky.edu/~dmu228/ControlAlg .

CONCLUSIONS

This paper presents a novel method for the identification of intervention targets in Boolean network models. The results in this paper show that the proposed methods are useful and efficient for moderately large networks.

Complementing ODE-Based System Analysis Using Boolean Networks Derived from an Euler-Like Transformation

In this paper, we present a systematic transition scheme for a large class of ordinary differential equations (ODEs) into Boolean networks. Our transition scheme can be applied to any system of ODEs whose right hand sides can be written as sums and products of monotone functions. It performs an Euler-like step which uses the signs of the right hand sides to obtain the Boolean update functions for every variable of the corresponding discrete model. The discrete model can, on one hand, be considered as another representation of the biological system or, alternatively, it can be used to further the analysis of the original ODE model. Since the generic transformation method does not guarantee any property conservation, a subsequent validation step is required. Depending on the purpose of the model this step can be based on experimental data or ODE simulations and characteristics. Analysis of the resulting Boolean model, both on its own and in comparison with the ODE model, then allows to investigate system properties not accessible in a purely continuous setting. The method is exemplarily applied to a previously published model of the bovine estrous cycle, which leads to new insights regarding the regulation among the components, and also indicates strongly that the system is tailored to generate stable oscillations.

Logical-continuous modelling of post-translationally regulated bistability of curli fiber expression in Escherichia coli

BACKGROUND

Bacteria have developed a repertoire of signalling mechanisms that enable adaptive responses to fluctuating environmental conditions. The formation of biofilm, for example, allows persisting in times of external stresses, e.g. induced by antibiotics or a lack of nutrients. Adhesive curli fibers, the major extracellular matrix components in Escherichia coli biofilms, exhibit heterogeneous expression in isogenic cells exposed to identical external conditions. The dynamical mechanisms underlying this heterogeneity remain poorly understood. In this work, we elucidate the potential role of post-translational bistability as a source for this heterogeneity.

RESULTS

We introduce a structured modelling workflow combining logical network topology analysis with time-continuous deterministic and stochastic modelling. The aim is to evaluate the topological structure of the underlying signalling network and to identify and analyse model parameterisations that satisfy observations from a set of genetic knockout experiments. Our work supports the hypothesis that the phenotypic heterogeneity of curli expression in biofilm cells is induced by bistable regulation at the post-translational level. Stochastic modelling suggests diverse noise-induced switching behaviours between the stable states, depending on the expression levels of the c-di-GMP-producing (diguanylate cyclases, DGCs) and -degrading (phosphodiesterases, PDEs) enzymes and reveals the quantitative difference in stable c-di-GMP levels between distinct phenotypes. The most dominant type of behaviour is characterised by a fast switching from curli-off to curli-on with a slow switching in the reverse direction and the second most dominant type is a long-term differentiation into curli-on or curli-off cells. This behaviour may implicate an intrinsic feature of the system allowing for a fast adaptive response (curli-on) versus a slow transition to the curli-off state, in line with experimental observations.

CONCLUSION

The combination of logical and continuous modelling enables a thorough analysis of different determinants of bistable regulation, i.e. network topology and biochemical kinetics, and allows for an incorporation of experimental data from heterogeneous sources. Our approach yields a mechanistic explanation for the phenotypic heterogeneity of curli fiber expression. Furthermore, the presented work provides a detailed insight into the interactions between the multiple DGC- and PDE-type enzymes and the role of c-di-GMP in dynamical regulation of cellular decisions.

Piecewise linear and Boolean models of chemical reaction networks

Models of biochemical networks are frequently complex and high-dimensional. Reduction methods that preserve important dynamical properties are therefore essential for their study. Interactions in biochemical networks are frequently modeled using Hill functions ([Formula: see text]). Reduced ODEs and Boolean approximations of such model networks have been studied extensively when the exponent [Formula: see text] is large. However, while the case of small constant [Formula: see text] appears in practice, it is not well understood. We provide a mathematical analysis of this limit and show that a reduction to a set of piecewise linear ODEs and Boolean networks can be mathematically justified. The piecewise linear systems have closed-form solutions that closely track those of the fully nonlinear model. The simpler, Boolean network can be used to study the qualitative behavior of the original system. We justify the reduction using geometric singular perturbation theory and compact convergence, and illustrate the results in network models of a toggle switch and an oscillator.