ترغب بنشر مسار تعليمي؟ اضغط هنا

CLUE: Exact maximal reduction of kinetic models by constrained lumping of differential equations

71   0   0.0 ( 0 )
 نشر من قبل Alexey Ovchinnikov
 تاريخ النشر 2020
والبحث باللغة English




اسأل ChatGPT حول البحث

Motivation: Detailed mechanistic models of biological processes can pose significant challenges for analysis and parameter estimations due to the large number of equations used to track the dynamics of all distinct configurations in which each involved biochemical species can be found. Model reduction can help tame such complexity by providing a lower-dimensional model in which each macro-variable can be directly related to the original variables. Results: We present CLUE, an algorithm for exact model reduction of systems of polynomial differential equations by constrained linear lumping. It computes the smallest dimensional reduction as a linear mapping of the state space such that the reduced model preserves the dynamics of user-specified linear combinations of the original variables. Even though CLUE works with nonlinear differential equations, it is based on linear algebra tools, which makes it applicable to high-dimensional models. Using case studies from the literature, we show how CLUE can substantially lower model dimensionality and help extract biologically intelligible insights from the reduction. Availability: An implementation of the algorithm and relevant resources to replicate the experiments herein reported are freely available for download at https://github.com/pogudingleb/CLUE. Supplementary information: enclosed.



قيم البحث

اقرأ أيضاً

Motivation: Stochastic reaction networks are a widespread model to describe biological systems where the presence of noise is relevant, such as in cell regulatory processes. Unfortu-nately, in all but simplest models the resulting discrete state-spac e representation hinders analytical tractability and makes numerical simulations expensive. Reduction methods can lower complexity by computing model projections that preserve dynamics of interest to the user. Results: We present an exact lumping method for stochastic reaction networks with mass-action kinetics. It hinges on an equivalence relation between the species, resulting in a reduced network where the dynamics of each macro-species is stochastically equivalent to the sum of the original species in each equivalence class, for any choice of the initial state of the system. Furthermore, by an appropriate encoding of kinetic parameters as additional species, the method can establish equivalences that do not depend on specific values of the parameters. The method is supported by an efficient algorithm to compute the largest species equivalence, thus the maximal lumping. The effectiveness and scalability of our lumping technique, as well as the physical interpretability of resulting reductions, is demonstrated in several models of signaling pathways and epidemic processes on complex networks. Availability: The algorithms for species equivalence have been implemented in the software tool ERODE, freely available for download from https://www.erode.eu.
124 - V. Bytev , B. Kniehl 2013
HYPERDIRE is a project devoted to the creation of a set of Mathematica-based programs for the differential reduction of hypergeometric functions. The current version allows for manipulations involving the full set of Horn-type hypergeometric functions of two variables, including 30 functions.
63 - V. Bytev , B. Kniehl 2016
We present a further extension of the HYPERDIRE project, which is devoted to the creation of a set of Mathematica-based program packages for manipulations with Horn-type hypergeometric functions on the basis of differential equations. Specifically, w e present the implementation of the differential reduction for the Lauricella function $F_C$ of three variables.
142 - Vladimir V. Bytev 2009
The differential-reduction algorithm, which allows one to express generalized hypergeometric functions with parameters of arbitrary values in terms of such functions with parameters whose values differ from the original ones by integers, is discussed in the context of evaluating Feynman diagrams. Where this is possible, we compare our results with those obtained using standard techniques. It is shown that the criterion of reducibility of multiloop Feynman integrals can be reformulated in terms of the criterion of reducibility of hypergeometric functions. The relation between the numbers of master integrals obtained by differential reduction and integration by parts is discussed.
Non-conding RNAs play a key role in the post-transcriptional regulation of mRNA translation and turnover in eukaryotes. miRNAs, in particular, interact with their target RNAs through protein-mediated, sequence-specific binding, giving rise to extende d and highly heterogeneous miRNA-RNA interaction networks. Within such networks, competition to bind miRNAs can generate an effective positive coupling between their targets. Competing endogenous RNAs (ceRNAs) can in turn regulate each other through miRNA-mediated crosstalk. Albeit potentially weak, ceRNA interactions can occur both dynamically, affecting e.g. the regulatory clock, and at stationarity, in which case ceRNA networks as a whole can be implicated in the composition of the cells proteome. Many features of ceRNA interactions, including the conditions under which they become significant, can be unraveled by mathematical and in silico models. We review the understanding of the ceRNA effect obtained within such frameworks, focusing on the methods employed to quantify it, its role in the processing of gene expression noise, and how network topology can determine its reach.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا