Carsten Conradi

Subnetwork analysis reveals dynamic features of complex (bio)chemical networks

In analyzing and mathematical modeling of complex (bio)chemical reaction networks, formal methods that connect network structure and dynamic behavior are needed because often, quantitative knowledge of the networks is very limited. This applies to many important processes in cell biology. Chemical reaction network theory allows for the classification of the potential network behavior—for instance, with respect to the existence of multiple steady states—but is computationally limited to small systems. Here, we show that by analyzing subnetworks termed elementary flux modes, the applicability of the theory can be extended to more complex networks. For an example network inspired by cell cycle control in budding yeast, the approach allows for model discrimination, identification of key mechanisms for multistationarity, and robustness analysis. The presented methods will be helpful in modeling and analyzing other complex reaction networks.

Chemical Reaction Systems with Toric Steady States

Mass-action chemical reaction systems are frequently used in computational biology. The corresponding polynomial dynamical systems are often large (consisting of tens or even hundreds of ordinary differential equations) and poorly parameterized (due to noisy measurement data and a small number of data points and repetitions). Therefore, it is often difficult to establish the existence of (positive) steady states or to determine whether more complicated phenomena such as multistationarity exist. If, however, the steady state ideal of the system is a binomial ideal, then we show that these questions can be answered easily. The focus of this work is on systems with this property, and we say that such systems have toric steady states. Our main result gives sufficient conditions for a chemical reaction system to have toric steady states. Furthermore, we analyze the capacity of such a system to exhibit positive steady states and multistationarity. Examples of systems with toric steady states include weakly-reversible zero-deficiency chemical reaction systems. An important application of our work concerns the networks that describe the multisite phosphorylation of a protein by a kinase/phosphatase pair in a sequential and distributive mechanism.

Sign Conditions for Injectivity of Generalized Polynomial Maps with Applications to Chemical Reaction Networks and Real Algebraic Geometry

We give necessary and sufficient conditions in terms of sign vectors for the injectivity of families of polynomial maps with arbitrary real exponents defined on the positive orthant. Our work relates and extends existing injectivity conditions expressed in terms of Jacobian matrices and determinants. In the context of chemical reaction networks with power-law kinetics, our results can be used to preclude as well as to guarantee multiple positive steady states. In the context of real algebraic geometry, our work recognizes a prior result of Craciun, Garcia-Puente, and Sottile, together with work of two of the authors, as the first partial multivariate generalization of the classical Descartes’ rule, which bounds the number of positive real roots of a univariate real polynomial in terms of the number of sign variations of its coefficients.

Multistationarity in mass action networks with applications to ERK activation

Ordinary Differential Equations (ODEs) are an important tool in many areas of Quantitative Biology. For many ODE systems multistationarity (i.e. the existence of at least two positive steady states) is a desired feature. In general establishing multistationarity is a difficult task as realistic biological models are large in terms of states and (unknown) parameters and in most cases poorly parameterized (because of noisy measurement data of few components, a very small number of data points and only a limited number of repetitions). For mass action networks establishing multistationarity hence is equivalent to establishing the existence of at least two positive solutions of a large polynomial system with unknown coefficients. For mass action networks with certain structural properties, expressed in terms of the stoichiometric matrix and the reaction rate-exponent matrix, we present necessary and sufficient conditions for multistationarity that take the form of linear inequality systems. Solutions of these inequality systems define pairs of steady states and parameter values. We also present a sufficient condition to identify networks where the aforementioned conditions hold. To show the applicability of our results we analyse an ODE system that is defined by the mass action network describing the extracellular signal-regulated kinase (ERK) cascade (i.e. ERK-activation).

Catalytic constants enable the emergence of bistability in dual phosphorylation

Dual phosphorylation of proteins is a principal component of intracellular signalling. Bistability is considered an important property of such systems and its origin is not yet completely understood. Theoretical studies have established parameter values for multistationarity and bistability for many types of proteins. However, up to now no formal criterion linking multistationarity and bistability to the parameter values characterizing dual phosphorylation has been established. Deciding whether an unclassified protein has the capacity for bistability, therefore requires careful numerical studies. Here, we present two general algebraic conditions in the form of inequalities. The first employs the catalytic constants, and if satisfied guarantees multistationarity (and hence the potential for bistability). The second involves the catalytic and Michaelis constants, and if satisfied guarantees uniqueness of steady states (and hence absence of bistability). Our method also allows for the direct computation of the total concentration values such that multistationarity occurs. Applying our results yields insights into the emergence of bistability in the ERK–MEK–MKP system that previously required a delicate numerical effort. Our algebraic conditions present a practical way to determine the capacity for bistability and hence will be a useful tool for examining the origin of bistability in many models containing dual phosphorylation.

Multistationarity in Sequential Distributed Multisite Phosphorylation Networks

Multisite phosphorylation networks are encountered in many intracellular processes like signal transduction, cell-cycle control, or nuclear signal integration. In this contribution, networks describing the phosphorylation and dephosphorylation of a protein at n sites in a sequential distributive mechanism are considered. Multistationarity (i.e., the existence of at least two positive steady state solutions of the associated polynomial dynamical system) has been analyzed and established in several contributions. It is, for example, known that there exist values for the rate constants where multistationarity occurs. However, nothing else is known about these rate constants.Here, we present a sign condition that is necessary and sufficient for multistationarity in n-site sequential, distributive phosphorylation. We express this sign condition in terms of linear systems, and show that solutions of these systems define rate constants where multistationarity is possible. We then present, for n≥2, a collection of feasible linear systems, and hence give a new and independent proof that multistationarity is possible for n≥2. Moreover, our results allow to explicitly obtain values for the rate constants where multistationarity is possible. Hence, we believe that, for the first time, a systematic exploration of the region in parameter space where multistationarity occurs has become possible. One consequence of our work is that, for any pair of steady states, the ratio of the steady state concentrations of kinase-substrate complexes equals that of phosphatase-substrate complexes.

Reciprocal Enzyme Regulation as a Source of Bistability in Covalent Modification Cycles

Covalent modification cycles (CMCs) are the building blocks of many regulatory networks in biological systems. Under proper kinetic conditions such mono-cyclic enzyme systems can show a higher sensitivity to effectors than enzymes subject to direct allosteric regulation. Using methods from reaction network theory it has been argued that CMCs can potentially exhibit multiple steady states if the converter enzymes are regulated in a reciprocal manner, but the underlying mechanism as well as the kinetic requirements for the emergence of such a behavior remained unclear. Here, we reinvestigate CMCs with reciprocal regulation of the converter enzymes for two common regulatory mechanisms: allosteric regulation and covalent modification. To analyze the steady state behavior of the corresponding mass-action equations, we derive reduced models by means of a quasi-steady state approximation (QSSA). We also derive reduced models using the total QSSA which often better reproduces the transient dynamics of enzyme-catalyzed reaction systems. Through a steady state analysis of the reduced models we show that the occurrence of bistability can be associated with the presence of a double negative feedback loop. We also derive constraints for the model parameters which might help to evaluate the potential significance of the mechanisms described here for the generation of bistability in natural systems. In particular, our results support the view of a possible bistable response in the metabolic PFK1/F1,6BPase cycle as observed experimentally in rat liver extracts, and it suggests an alternative view on the origin of bistability in the Cdk1-Wee1-Cdc25 system.

Switching in Mass Action Networks Based on Linear Inequalities

Many biochemical processes can successfully be described by dynamical systems allowing some form of switching when, depending on their initial conditions, solutions of the dynamical system end up in different regions of state space (associated with different biochemical functions). Switching is often realized by a bistable system (i.e., a dynamical system allowing two stable steady state solutions) and, in the majority of cases, bistability is established numerically. In our view, this approach is too restrictive. On the one hand, due to predominant parameter uncertainty, numerical methods are generally difficult to apply to realistic models originating in systems biology. On the other hand, switching already arises with the occurrence of a saddle-type steady state (characterized by a Jacobian where exactly one eigenvalue is positive and the remaining eigenvalues have negative real part). Consequently we derive conditions based on linear inequalities that allow the analytic computation of states and param...

Identifying parameter regions for multistationarity

Mathematical modelling has become an established tool for studying the dynamics of biological systems. Current applications range from building models that reproduce quantitative data to identifying systems with predefined qualitative features, such as switching behaviour, bistability or oscillations. Mathematically, the latter question amounts to identifying parameter values associated with a given qualitative feature. We introduce a procedure to partition the parameter space of a parameterized system of ordinary differential equations into regions for which the system has a unique or multiple equilibria. The procedure is based on the computation of the Brouwer degree, and it creates a multivariate polynomial with parameter depending coefficients. The signs of the coefficients determine parameter regions with and without multistationarity. A particular strength of the procedure is the avoidance of numerical analysis and parameter sampling. The procedure consists of a number of steps. Each of these steps might be addressed algorithmically using various computer programs and available software, or manually. We demonstrate our procedure on several models of gene transcription and cell signalling, and show that in many cases we obtain a complete partitioning of the parameter space with respect to multistationarity.

The Process-Interaction-Model: a common representation of rule-based and logical models allows studying signal transduction on different levels of detail

BackgroundSignaling systems typically involve large, structured molecules each consisting of a large number of subunits called molecule domains. In modeling such systems these domains can be considered as the main players. In order to handle the resulting combinatorial complexity, rule-based modeling has been established as the tool of choice. In contrast to the detailed quantitative rule-based modeling, qualitative modeling approaches like logical modeling rely solely on the network structure and are particularly useful for analyzing structural and functional properties of signaling systems.ResultsWe introduce the Process-Interaction-Model (PIM) concept. It defines a common representation (or basis) of rule-based models and site-specific logical models, and, furthermore, includes methods to derive models of both types from a given PIM. A PIM is based on directed graphs with nodes representing processes like post-translational modifications or binding processes and edges representing the interactions among processes. The applicability of the concept has been demonstrated by applying it to a model describing EGF insulin crosstalk. A prototypic implementation of the PIM concept has been integrated in the modeling software ProMoT.ConclusionsThe PIM concept provides a common basis for two modeling formalisms tailored to the study of signaling systems: a quantitative (rule-based) and a qualitative (logical) modeling formalism. Every PIM is a compact specification of a rule-based model and facilitates the systematic set-up of a rule-based model, while at the same time facilitating the automatic generation of a site-specific logical model. Consequently, modifications can be made on the underlying basis and then be propagated into the different model specifications – ensuring consistency of all models, regardless of the modeling formalism. This facilitates the analysis of a system on different levels of detail as it guarantees the application of established simulation and analysis methods to consistent descriptions (rule-based and logical) of a particular signaling system.