اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAn analytic approximation of the feasible space of metabolic networks
78
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Assuming a steady-state condition within a cell, metabolic fluxes satisfy an under-determined linear system of stoichiometric equations. Characterizing the space of fluxes that satisfy such equations along with given bounds (and possibly additional relevant constraints) is considered of utmost importance for the understanding of cellular metabolism. Extreme values for each individual flux can be computed with Linear Programming (as Flux Balance Analysis), and their marginal distributions can be approximately computed with Monte-Carlo sampling. Here we present an approximate analytic method for the latter task based on Expectation Propagation equations that does not involve sampling and can achieve much better predictions than other existing analytic methods. The method is iterative, and its computation time is dominated by one matrix inversion per iteration. With respect to sampling, we show through extensive simulation that it has some advantages including computation time, and the ability to efficiently fix empirically estimated distributions of fluxes.
قيم البحث
اقرأ أيضاً
Homeostasis of protein concentrations in cells is crucial for their proper functioning, and this requires concentrations (at their steady-state levels) to be stable to fluctuations. Since gene expression is regulated by proteins such as transcription
factors (TFs), the full set of proteins within the cell constitutes a large system of interacting components. Here, we explore factors affecting the stability of this system by coupling the dynamics of mRNAs and protein concentrations in a growing cell. We find that it is possible for protein concentrations to become unstable if the regulation strengths or system size becomes too large, and that other global structural features of the networks can dramatically enhance the stability of the system. In particular, given the same number of proteins, TFs, number of interactions, and regulation strengths, a network that resembles a bipartite graph with a lower fraction of interactions that target TFs has a higher chance of being stable. By scrambling the $textit{E. coli.}$ transcription network, we find that the randomized network with the same number of regulatory interactions is much more likely to be unstable than the real network. These findings suggest that constraints imposed by system stability could have played a role in shaping the existing regulatory network during the evolutionary process. We also find that contrary to what one might expect from random matrix theory and what has been argued in the literature, the degradation rate of mRNA does not affect whether the system is stable.
Near a bifurcation point, the response time of a system is expected to diverge due to the phenomenon of critical slowing down. We investigate critical slowing down in well-mixed stochastic models of biochemical feedback by exploiting a mapping to the
mean-field Ising universality class. This mapping allows us to quantify critical slowing down in experiments where we measure the response of T cells to drugs. Specifically, the addition of a drug is equivalent to a sudden quench in parameter space, and we find that quenches that take the cell closer to its critical point result in slower responses. We further demonstrate that our class of biochemical feedback models exhibits the Kibble-Zurek collapse for continuously driven systems, which predicts the scaling of hysteresis in cellular responses to more gradual perturbations. We discuss the implications of our results in terms of the tradeoff between a precise and a fast response.
Biochemical reactions are fundamentally noisy at a molecular scale. This limits the precision of reaction networks, but also allows fluctuation measurements which may reveal the structure and dynamics of the underlying biochemical network. Here, we s
tudy non-equilibrium reaction cycles, such as the mechanochemical cycle of molecular motors, the phosphorylation cycle of circadian clock proteins, or the transition state cycle of enzymes. Fluctuations in such cycles may be measured using either of two classical definitions of the randomness parameter, which we show to be equivalent in general microscopically reversible cycles. We define a stochastic period for reversible cycles and present analytical solutions for its moments. Furthermore, we associate the two forms of the randomness parameter with the thermodynamic uncertainty relation, which sets limits on the timing precision of the cycle in terms of thermodynamic quantities. Our results should prove useful also for the study of temporal fluctuations in more general networks.
We cast the metabolism of interacting cells within a statistical mechanics framework considering both, the actual phenotypic capacities of each cell and its interaction with its neighbors. Reaction fluxes will be the components of high-dimensional sp
in vectors, whose values will be constrained by the stochiometry and the energy requirements of the metabolism. Within this picture, finding the phenotypic states of the population turns out to be equivalent to searching for the equilibrium states of a disordered spin model. We provide a general solution of this problem for arbitrary metabolic networks and interactions. We apply this solution to a simplified model of metabolism and to a complex metabolic network, the central core of the emph{E. coli}, and demonstrate that the combination of selective pressure and interactions define a complex phenotypic space. Cells may specialize in producing or consuming metabolites complementing each other at the population level and this is described by an equilibrium phase space with multiple minima, like in a spin-glass model.
The topological analysis of biological networks has been a prolific topic in network science during the last decade. A persistent problem with this approach is the inherent uncertainty and noisy nature of the data. One of the cases in which this situ
ation is more marked is that of transcriptional regulatory networks (TRNs) in bacteria. The datasets are incomplete because regulatory pathways associated to a relevant fraction of bacterial genes remain unknown. Furthermore, direction, strengths and signs of the links are sometimes unknown or simply overlooked. Finally, the experimental approaches to infer the regulations are highly heterogeneous, in a way that induces the appearance of systematic experimental-topological correlations. And yet, the quality of the available data increases constantly. In this work we capitalize on these advances to point out the influence of data (in)completeness and quality on some classical results on topological analysis of TRNs, specially regarding modularity at different levels. In doing so, we identify the most relevant factors affecting the validity of previous findings, highlighting important caveats to future prokaryotic TRNs topological analysis.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
