اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA note on MAPK networks and their capacity for multistationarity due to toric steady states
93
0
0.0
(
0
)
تأليف
Matthew D. Johnston
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We provide a short supplement to the paper MAPK networks and their capacity for multistationarity due to toric steady states by Perez Millan and Turjanski. We show that the capacity for toric steady states in the three networks analyzed in that paper can be derived using the process of network translation, which corresponds the original mass action system to a generalized mass action system with the same steady states. In all three cases, the translated chemical reaction network is proper, weakly reversible, and has both a structural and kinetic deficiency of zero. This is sufficient to guarantee toric steady states by previously established work on network translations. A basis of the steady state ideal is then derived by consideration of the linkage classes of the translated chemical reaction network.
قيم البحث
اقرأ أيضاً
The multisite phosphorylation-dephosphorylation cycle is a motif repeatedly used in cell signaling. This motif itself can generate a variety of dynamic behaviors like bistability and ultrasensitivity without direct positive feedbacks. In this paper,
we study the number of positive steady states of a general multisite phosphorylation-dephosphorylation cycle, and how the number of positive steady states varies by changing the biological parameters. We show analytically that (1) for some parameter ranges, there are at least n+1 (if n is even) or n (if n is odd) steady states; (2) there never are more than 2n-1 steady states (in particular, this implies that for n=2, including single levels of MAPK cascades, there are at most three steady states); (3) for parameters near the standard Michaelis-Menten quasi-steady state conditions, there are at most n+1 steady states; and (4) for parameters far from the standard Michaelis-Menten quasi-steady state conditions, there is at most one steady state.
We derive a reduction formula for singularly perturbed ordinary differential equations (in the sense of Tikhonov and Fenichel) with a known parameterization of the critical manifold. No a priori assumptions concerning separation of slow and fast vari
ables are made, or necessary.We apply the theoretical results to chemical reaction networks with mass action kinetics admitting slow and fast reactions. For some relevant classes of such systems there exist canonical parameterizations of the variety of stationary points, hence the theory is applicable in a natural manner. In particular we obtain a closed form expression for the reduced system when the fast subsystem admits complex balanced steady states.
The goal of this paper is to gather and develop some necessary and sufficient criteria for injectivity and multistationarity in vector fields associated with a chemical reaction network under a variety of more or less general assumptions on the natur
e of the network and the reaction rates. The results are primarily linear algebraic or matrix-theoretic, with some graph-theoretic results also mentioned. Several results appear in, or are close to, results in the literature. Here, we emphasise the connections between the results, and where possible, present elementary proofs which rely solely on basic linear algebra and calculus. A number of examples are provided to illustrate the variety of subtly different conclusions which can be reached via different computations. In addition, many of the computations are implemented in a web-based open source platform, allowing the reader to test examples including and beyond those analysed in the paper.
We study two specific measures of quality of chemical reaction networks, Precision and Sensitivity. The two measures arise in the study of sensory adaptation, in which the reaction network is viewed as an input-output system. Given a step change in i
nput, Sensitivity is a measure of the magnitude of the response, while Precision is a measure of the degree to which the system returns to its original output for large time. High values of both are necessary for high-quality adaptation. We focus on reaction networks without dissipation, which we interpret as detailed-balance, mass-action networks. We give various upper and lower bounds on the optimal values of Sensitivity and Precision, characterized in terms of the stoichiometry, by using a combination of ideas from matroid theory and differential-equation theory. Among other results, we show that this class of non-dissipative systems contains networks with arbitrarily high values of both Sensitivity and Precision. This good performance does come at a cost, however, since certain ratios of concentrations need to be large, the network has to be extensive, or the network should show strongly different time scales.
We are concerned with polynomial ordinary differential systems that arise from modelling chemical reaction networks. For such systems, which may be of high dimension and may depend on many parameters, it is frequently of interest to obtain a reductio
n of dimension in certain parameter ranges. Singular perturbation theory, as initiated by Tikhonov and Fenichel, provides a path toward such reductions. In the present paper we discuss parameter values that lead to singular perturbation reductions (so-called Tikhonov-Fenichel parameter values, or TFPVs). An algorithmic approach is known, but it is feasible for small dimensions only. Here we characterize conditions for classes of reaction networks for which TFPVs arise by turning off reactions (by setting rate parameters to zero), or by removing certain species (which relates to the classical quasi-steady state approach to model reduction). In particular, we obtain definitive results for the class of complex balanced reaction networks (of deficiency zero) and first order reaction networks.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
