اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMultistationarity in the space of total concentrations for systems that admit a monomial parametrization
464
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We apply tools from real algebraic geometry to the problem of multistationarity of chemical reaction networks. A particular focus is on the case of reaction networks whose steady states admit a monomial parametrization. For such systems we show that in the space of total concentrations multistationarity is scale invariant: if there is multistationarity for some value of the total concentrations, then there is multistationarity on the entire ray containing this value (possibly for different rate constants) -- and vice versa. Moreover, for these networks it is possible to decide about multistationarity independent of the rate constants by formulating semi-algebraic conditions that involve only concentration variables. These conditions can easily be extended to include total concentrations. Hence quantifier elimination may give new insights into multistationarity regions in the space of total concentrations. To demonstrate this, we show that for the distributive phosphorylation of a protein at two binding sites multistationarity is only possible if the total concentration of the substrate is larger than either the total concentration of the kinase or the total concentration of the phosphatase. This result is enabled by the chamber decomposition of the space of total concentrations from polyhedral geometry. Together with the corresponding sufficiency result of Bihan et al. this yields a characterization of multistationarity up to lower dimensional regions.
قيم البحث
اقرأ أيضاً
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 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, Stigle
r and Veliz-Cuba proposed a Boolean network 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 systems 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.
This work investigates the emergence of oscillations in one of the simplest cellular signaling networks exhibiting oscillations, namely, the dual-site phosphorylation and dephosphorylation network (futile cycle), in which the mechanism for phosphoryl
ation is processive while the one for dephosphorylation is distributive (or vice-versa). The fact that this network yields oscillations was shown recently by Suwanmajo and Krishnan. Our results, which significantly extend their analyses, are as follows. First, in the three-dimensional space of total amounts, the border between systems with a stable versus unstable steady state is a surface defined by the vanishing of a single Hurwitz determinant. Second, this surface consists generically of simple Hopf bifurcations. Next, simulations suggest that when the steady state is unstable, oscillations are the norm. Finally, the emergence of oscillations via a Hopf bifurcation is enabled by the catalytic and association constants of the distributive part of the mechanism: if these rate constants satisfy two inequalities, then the system generically admits a Hopf bifurcation. Our proofs are enabled by the Routh-Hurwitz criterion, a Hopf-bifurcation criterion due to Yang, and a monomial parametrization of steady states.
Protein phosphorylation cycles are important mechanisms of the post translational modification of a protein and as such an integral part of intracellular signaling and control. We consider the sequential phosphorylation and dephosphorylation of a pro
tein at two binding sites. While it is known that proteins where phosphorylation is processive and dephosphorylation is distributive admit oscillations (for some value of the rate constants and total concentrations) it is not known whether or not this is the case if both phosphorylation and dephosphorylation are distributive. We study four simplified mass action models of sequential and distributive phosphorylation and show that for each of those there do not exist rate constants and total concentrations where a Hopf bifurcation occurs. To arrive at this result we use convex parameters to parameterize the steady state and Hurwitz matrices.
Biochemical mechanisms with mass action kinetics are often modeled by systems of polynomial differential equations (DE). Determining directly if the DE system has multiple equilibria (multistationarity) is difficult for realistic systems, since they
are large, nonlinear and contain many unknown parameters. Mass action biochemical mechanisms can be represented by a directed bipartite graph with species and reaction nodes. Graph-theoretic methods can then be used to assess the potential of a given biochemical mechanism for multistationarity by identifying structures in the bipartite graph referred to as critical fragments. In this article we present a graph-theoretic method for conservative biochemical mechanisms characterized by bounded species concentrations, which makes the use of degree theory arguments possible. We illustrate the results with an example of a MAPK network.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
