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

Emergence of oscillations in a mixed-mechanism phosphorylation system

71   0   0.0 ( 0 )
 نشر من قبل Anne Shiu
 تاريخ النشر 2018
  مجال البحث علم الأحياء
والبحث باللغة English




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

This work investigates the emergence of oscillations in one of the simplest cellular signaling networks exhibiting oscillations, namely, the dual-site phosphorylation and dephosphorylation network (futile cycle), in which the mechanism for phosphorylation is processive while the one for dephosphorylation is distributive (or vice-versa). The fact that this network yields oscillations was shown recently by Suwanmajo and Krishnan. Our results, which significantly extend their analyses, are as follows. First, in the three-dimensional space of total amounts, the border between systems with a stable versus unstable steady state is a surface defined by the vanishing of a single Hurwitz determinant. Second, this surface consists generically of simple Hopf bifurcations. Next, simulations suggest that when the steady state is unstable, oscillations are the norm. Finally, the emergence of oscillations via a Hopf bifurcation is enabled by the catalytic and association constants of the distributive part of the mechanism: if these rate constants satisfy two inequalities, then the system generically admits a Hopf bifurcation. Our proofs are enabled by the Routh-Hurwitz criterion, a Hopf-bifurcation criterion due to Yang, and a monomial parametrization of steady states.



قيم البحث

اقرأ أيضاً

Protein phosphorylation cycles are important mechanisms of the post translational modification of a protein and as such an integral part of intracellular signaling and control. We consider the sequential phosphorylation and dephosphorylation of a pro tein at two binding sites. While it is known that proteins where phosphorylation is processive and dephosphorylation is distributive admit oscillations (for some value of the rate constants and total concentrations) it is not known whether or not this is the case if both phosphorylation and dephosphorylation are distributive. We study four simplified mass action models of sequential and distributive phosphorylation and show that for each of those there do not exist rate constants and total concentrations where a Hopf bifurcation occurs. To arrive at this result we use convex parameters to parameterize the steady state and Hurwitz matrices.
Multisite phosphorylation plays an important role in regulating switchlike protein activity and has been used widely in mathematical models. With the development of new experimental techniques and more molecular data, molecular phosphorylation proces ses emerge in many systems with increasing complexity and sizes. These developments call for simple yet valid stochastic models to describe various multisite phosphorylation processes, especially in large and complex biochemical networks. To reduce model complexity, this work aims to simplify the multisite phosphorylation mechanism by a stochastic Hill function model. Further, this work optimizes regions of parameter space to match simulation results from the stochastic Hill function with the distributive multisite phosphorylation process. While traditional parameter optimization methods have been focusing on finding the best parameter vector, in most circumstances modelers would like to find a set of parameter vectors that generate similar system dynamics and results. This paper proposes a general $alpha$-$beta$-$gamma$ rule to return an acceptable parameter region of the stochastic Hill function based on a quasi-Newton stochastic optimization (QNSTOP) algorithm. Different objective functions are investigated characterizing different features of the simulation-based empirical data, among which the approximate maximum log-likelihood method is recommended for general applications. Numerical results demonstrate that with an appropriate parameter vector value, the stochastic Hill function model depicts the multisite phosphorylation process well except the initial (transient) period.
The lactose operon in Escherichia coli was the first known gene regulatory network, and it is frequently used as a prototype for new modeling paradigms. Historically, many of these modeling frameworks use differential equations. More recently, Stigle r and Veliz-Cuba proposed a Boolean network model that captures the bistability of the system and all of the biological steady states. In this paper, we model the well-known arabinose operon in E. coli with a Boolean network. This has several complex features not found in the lac operon, such as a protein that is both an activator and repressor, a DNA looping mechanism for gene repression, and the lack of inducer exclusion by glucose. For 11 out of 12 choices of initial conditions, we use computational algebra and Sage to verify that the state space contains a single fixed point that correctly matches the biology. The final initial condition, medium levels of arabinose and no glucose, successfully predicts the systems bistability. Finally, we compare the state space under synchronous and asynchronous update, and see that the former has several artificial cycles that go away under a general asynchronous update.
We apply tools from real algebraic geometry to the problem of multistationarity of chemical reaction networks. A particular focus is on the case of reaction networks whose steady states admit a monomial parametrization. For such systems we show that in the space of total concentrations multistationarity is scale invariant: if there is multistationarity for some value of the total concentrations, then there is multistationarity on the entire ray containing this value (possibly for different rate constants) -- and vice versa. Moreover, for these networks it is possible to decide about multistationarity independent of the rate constants by formulating semi-algebraic conditions that involve only concentration variables. These conditions can easily be extended to include total concentrations. Hence quantifier elimination may give new insights into multistationarity regions in the space of total concentrations. To demonstrate this, we show that for the distributive phosphorylation of a protein at two binding sites multistationarity is only possible if the total concentration of the substrate is larger than either the total concentration of the kinase or the total concentration of the phosphatase. This result is enabled by the chamber decomposition of the space of total concentrations from polyhedral geometry. Together with the corresponding sufficiency result of Bihan et al. this yields a characterization of multistationarity up to lower dimensional regions.
Cells store information in DNA and in stable programs of gene expression, which thereby implement forms of long-term cellular memory. Cells must also possess short-term forms of information storage, implemented post-translationally, to transduce and interpret external signals. CaMKII, for instance, is thought to implement a one-bit (bistable) short-term memory required for learning at post-synaptic densities. Here we show by mathematical analysis that multisite protein phosphorylation, which is ubiquitous in all eukaryotic signalling pathways, exhibits multistability for which the maximal number of steady states increases with the number of sites. If there are n sites, the maximal information storage capacity is at least log_2 (n+2)/2 bits when n is even and log_2 (n+1)/2 bits when n is odd. Furthermore, when substrate is in excess, enzyme saturation together with an alternating low/high pattern in the site-specific relative catalytic efficiencies, enriches for multistability. That is, within physiologically plausible ranges for parameters, multistability becomes more likely than monostability. We discuss the experimental challenges in pursuing these predictions and in determining the biological role of short-term information storage.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
mircosoft-partner

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