اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA computational approach to persistence, permanence, and endotacticity of biochemical reaction systems
180
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We introduce a mixed-integer linear programming (MILP) framework capable of determining whether a chemical reaction network possesses the property of being endotactic or strongly endotactic. The network property of being strongly endotactic is known to lead to persistence and permanence of chemical species under genetic kinetic assumptions, while the same result is conjectured but as yet unproved for general endotactic networks. The algorithms we present are the first capable of verifying endotacticity of chemical reaction networks for systems with greater than two constituent species. We implement the algorithms in the open-source online package CoNtRol and apply them to several well-studied biochemical examples, including the general $n$-site phosphorylation / dephosphorylation networks and a circadian clock mechanism.
قيم البحث
اقرأ أيضاً
We present conditions which guarantee a parametrization of the set of positive equilibria of a generalized mass-action system. Our main results state that (i) if the underlying generalized chemical reaction network has an effective deficiency of zero
, then the set of positive equilibria coincides with the parametrized set of complex-balanced equilibria and (ii) if the network is weakly reversible and has a kinetic deficiency of zero, then the equilibrium set is nonempty and has a positive, typically rational, parametrization. Via the method of network translation, we apply our results to classical mass-action systems studied in the biochemical literature, including the EnvZ-OmpR and shuttled WNT signaling pathways. A parametrization of the set of positive equilibria of a (generalized) mass-action system is often a prerequisite for the study of multistationarity and allows an easy check for the occurrence of absolute concentration robustness (ACR), as we demonstrate for the EnvZ-OmpR pathway.
Recent work of M.D. Johnston et al. has produced sufficient conditions on the structure of a chemical reaction network which guarantee that the corresponding discrete state space system exhibits an extinction event. The conditions consist of a series
of systems of equalities and inequalities on the edges of a modified reaction network called a domination-expanded reaction network. In this paper, we present a computational implementation of these conditions written in Python and apply the program on examples drawn from the biochemical literature, including a model of polyamine metabolism in mammals and a model of the pentose phosphate pathway in Trypanosoma brucei. We also run the program on 458 models from the European Bioinformatics Institutes BioModels Database and report our results.
Persistence and permanence are properties of dynamical systems that describe the long-term behavior of the solutions, and in particular specify whether positive solutions approach the boundary of the positive orthant. Mass-action systems (or more gen
erally power-law systems) are very common in chemistry, biology, and engineering, and are often used to describe the dynamics in interaction networks. We prove that two-species mass-action systems derived from weakly reversible networks are both persistent and permanent, for any values of the reaction rate parameters. Moreover, we prove that a larger class of networks, called endotactic networks, also give rise to permanent systems, even if we allow the reaction rate parameters to vary in time. These results also apply to power-law systems and other nonlinear dynamical systems. In addition, ideas behind these results allow us to prove the Global Attractor Conjecture for three-species systems.
A persistent dynamical system in $mathbb{R}^d_{> 0}$ is one whose solutions have positive lower bounds for large $t$, while a permanent dynamical system in $mathbb{R}^d_{> 0}$ is one whose solutions have uniform upper and lower bounds for large $t$.
These properties have important applications for the study of mathematical models in biochemistry, cell biology, and ecology. Inspired by reaction network theory, we define a class of polynomial dynamical systems called tropically endotactic. We show that two-dimensional tropically endotactic polynomial dynamical systems are permanent, irrespective of the values of (possibly time-dependent) parameters in these systems. These results generalize the permanence of two-dimensional reversible, weakly reversible, and endotactic mass action systems.
Analyzing qualitative behaviors of biochemical reactions using its associated network structure has proven useful in diverse branches of biology. As an extension of our previous work, we introduce a graph-based framework to calculate steady state sol
utions of biochemical reaction networks with synthesis and degradation. Our approach is based on a labeled directed graph $G$ and the associated system of linear non-homogeneous differential equations with first order degradation and zeroth order synthesis. We also present a theorem which provides necessary and sufficient conditions for the dynamics to engender a unique stable steady state. Although the dynamics are linear, one can apply this framework to nonlinear systems by encoding nonlinearity into the edge labels. We answer open question from our previous work concerning the non-positiveness of the elements in the inverse of a perturbed Laplacian matrix. Moreover, we provide a graph theoretical framework for the computation of the inverse of a such matrix. This also completes our previous framework and makes it purely graph theoretical. Lately, we demonstrate the utility of this framework by applying it to a mathematical model of insulin secretion through ion channels and glucose metabolism in pancreatic $beta$-cells.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
