اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدChemical reaction network decompositions and realizations of S-systems
76
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This paper presents novel decomposition classes of chemical reaction networks (CRNs) derived from S-system kinetics. Based on the network decomposition theory initiated by Feinberg in 1987, we introduce the concept of incidence independent decompositions and develop the theory of $mathscr{C}$- and $mathscr{C}^*$- decompositions which partition the set of complexes and the set of nonzero complexes respectively, including their structure theorems in terms of linkage classes. Analogous to Feinbergs independent decomposition, we demonstrate the important relationship between sets of complex balance equilibria for an incidence independent decomposition of weakly reversible subnetworks for any kinetics. We show that the $mathscr{C}^*$-decompositions are also incidence independent. We also introduce in this paper a new realization for an S-system that is analyzed using a newly defined class of species coverable CRNs. This led to the extension of the deficiency formula and characterization of fundamental decompositions of species decomposable reaction networks.
قيم البحث
اقرأ أيضاً
A chemical reaction network (CRN) is composed of reactions that can be seen as interactions among entities called species, which exist within the system. Endowed with kinetics, CRN has a corresponding set of ordinary differential equations (ODEs). In
Chemical Reaction Network Theory, we are interested with connections between the structure of the CRN and qualitative properties of the corresponding ODEs. One of the results in Decomposition Theory of CRNs is that the intersection of the sets of positive steady states of the subsystems is equal to the set of positive steady states of the whole system, if the decomposition is independent. Hence, computational approach using independent decompositions can be used as an efficient tool in studying large systems. In this work, we provide a necessary and sufficient condition for the existence of a nontrivial independent decomposition of a CRN, which leads to a novel step-by-step method to obtain such decomposition, if it exists. We also illustrate these results using real-life examples. In particular, we show that a CRN of a popular model of anaerobic yeast fermentation pathway has a nontrivial independent decomposition, while a particular biological system, which is a metabolic network with one positive feedforward and a negative feedback has none. Finally, we analyze properties of steady states of reaction networks of specific influenza virus models.
This paper studies chemical kinetic systems which decompose into weakly reversible complex factorizable (CF) systems. Among power law kinetic systems, CF systems (denoted as PL-RDK systems) are those where branching reactions of a reactant complex ha
ve identical rows in the kinetic order matrix. Mass action and generalized mass action systems (GMAS) are well-known examples. Schmitzs global carbon cycle model is a previously studied non-complex factorizable (NF) power law system (denoted as PL-NDK). We derive novel conditions for the existence of weakly reversible CF-decompositions and present an algorithm for verifying these conditions. We discuss methods for identifying independent decompositions, i.e., those where the stoichiometric subspaces of the subnetworks form a direct sum, as such decompositions relate positive equilibria sets of the subnetworks to that of the whole network. We then use the results to determine the positive equilibria sets of PL-NDK systems which admit an independent weakly reversible decomposition into PL-RDK systems of PLP type, i.e., the positive equilibria are log-parametrized, which is a broad generalization of a Deficiency Zero Theorem of Fortun et al. (2019).
In this paper we discuss the question of how to decide when a general chemical reaction system is incapable of admitting multiple equilibria, regardless of parameter values such as reaction rate constants, and regardless of the type of chemical kinet
ics, such as mass-action kinetics, Michaelis-Menten kinetics, etc. Our results relate previously described linear algebraic and graph-theoretic conditions for injectivity of chemical reaction systems. After developing a translation between the two formalisms, we show that a graph-theoretic test developed earlier in the context of systems with mass action kinetics, can be applied to reaction systems with arbitrary kinetics. The test, which is easy to implement algorithmically, and can often be decided without the need for any computation, rules out the possibility of multiple equilibria for the systems in question.
Many biochemical and industrial applications involve complicated networks of simultaneously occurring chemical reactions. Under the assumption of mass action kinetics, the dynamics of these chemical reaction networks are governed by systems of polyno
mial ordinary differential equations. The steady states of these mass action systems have been analysed via a variety of techniques, including elementary flux mode analysis, algebraic techniques (e.g. Groebner bases), and deficiency theory. In this paper, we present a novel method for characterizing the steady states of mass action systems. Our method explicitly links a networks capacity to permit a particular class of steady states, called toric steady states, to topological properties of a related network called a translated chemical reaction network. These networks share their reaction stoichiometries with their source network but are permitted to have different complex stoichiometries and different network topologies. We apply the results to examples drawn from the biochemical literature.
The fundamental decomposition of a chemical reaction network (also called its $mathscr{F}$-decomposition) is the set of subnetworks generated by the partition of its set of reactions into the fundamental classes introduced by Ji and Feinberg in 2011
as the basis of their higher deficiency algorithm for mass action systems. The first part of this paper studies the properties of the $mathscr{F}$-decomposition, in particular, its independence (i.e., the networks stoichiometric subspace is the direct sum of the subnetworks stoichiometric subspaces) and its incidence-independence (i.e., the image of the networks incidence map is the direct sum of the incidence maps images of the subnetworks). We derive necessary and sufficient conditions for these properties and identify network classes where the $mathscr{F}$-decomposition coincides with other known decompositions. The second part of the paper applies the above-mentioned results to improve the Multistationarity Algorithm for power-law kinetic systems (MSA), a general computational approach that we introduced in previous work. We show that for systems with non-reactant determined interactions but with an independent $mathscr{F}$-decomposition, the transformation to a dynamically equivalent system with reactant-determined interactions -- required in the original MSA -- is not necessary. We illustrate this improvement with the subnetwork of Schmitzs carbon cycle model recently analyzed by Fortun et al.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
