Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userTechniques of Model Reductions in Biochemical Cell Signaling Pathways
216
0
0.0
(
0
)
Added by
Sarbaz H. A. Khoshnaw
Publication date
2021
fields
Biology
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
There are many mathematical models of biochemical cell signaling pathways that contain a large number of elements (species and reactions). This is sometimes a big issue for identifying critical model elements and describing the model dynamics. Thus, techniques of model reduction can be used as a mathematical tool in order to minimize the number of variables and parameters. In this thesis, we review some well-known methods of model reduction for cell signaling pathways. We have also developed some approaches that provide us a great step forward in model reduction. The techniques are quasi steady state approximation (QSSA), quasi equilibrium approximation (QEA), lumping of species and entropy production analysis. They are applied on protein translation pathways with microRNA mechanisms, chemical reaction networks, extracellular signal regulated kinase (ERK) pathways, NFkB signal transduction pathways, elongation factors EFTu and EFTs signaling pathways and Dihydrofolate reductase (DHFR) pathways. The main aim of this thesis is to reduce the complex cell signaling pathway models. This provides one a better understanding of the dynamics of such models and gives an accurate approximate solution. Results show that there is a good agreement between the original models and the simplified models.
rate research
Read More
Signaling pathways serve to communicate information about extracellular conditions into the cell, to both the nucleus and cytoplasmic processes to control cell responses. Genetic mutations in signaling network components are frequently associated with cancer and can result in cells acquiring an ability to divide and grow uncontrollably. Because signaling pathways play such a significant role in cancer initiation and advancement, their constituent proteins are attractive therapeutic targets. In this review, we discuss how signaling pathway modeling can assist with identifying effective drugs for treating diseases, such as cancer. An achievement that would facilitate the use of such models is their ability to identify controlling biochemical parameters in signaling pathways, such as molecular abundances and chemical reaction rates, because this would help determine effective points of attack by therapeutics.
We present herein an extension of an algebraic statistical method for inferring biochemical reaction networks from experimental data, proposed recently in [3]. This extension allows us to analyze reaction networks that are not necessarily full-dimensional, i.e., the dimension of their stoichiometric space is smaller than the number of species. Specifically, we propose to augment the original algebraic-statistical algorithm for network inference with a preprocessing step that identifies the subspace spanned by the correct reaction vectors, within the space spanned by the species. This dimension reduction step is based on principal component analysis of the input data and its relationship with various subspaces generated by sets of candidate reaction vectors. Simulated examples are provided to illustrate the main ideas involved in implementing this method, and to asses its performance.
Transforming Growth Factor-beta (TGF-beta) signalling is an important regulator of cellular growth and differentiation. The principal intracellular mediators of TGF-beta signalling are the Smad proteins, which upon TGF-beta stimulation accumulate in the nucleus and regulate transcription of target genes. To investigate the mechanisms of Smad nuclear accumulation, we developed a simple mathematical model of canonical Smad signalling. The model was built using both published data and our experimentally determined cellular Smad concentrations (isoforms 2, 3, and 4). We found in mink lung epithelial cells that Smad2 (8.5-12 x 10^4 molecules/cell) was present in similar amounts to Smad4 (9.3-12 x 10^4 molecules/cell), while both were in excess of Smad3 (1.1-2.0 x 10^4 molecules/cell). Variation of the model parameters and statistical analysis showed that Smad nuclear accumulation is most sensitive to parameters affecting the rates of RSmad phosphorylation and dephosphorylation and Smad complex formation/dissociation in the nucleus. Deleting Smad4 from the model revealed that rate-limiting phospho-R-Smad dephosphorylation could be an important mechanism for Smad nuclear accumulation. Furthermore, we observed that binding factors constitutively localised to the nucleus do not efficiently mediate Smad nuclear accumulation if dephosphorylation is rapid. We therefore conclude that an imbalance in the rates of R-Smad phosphorylation and dephosphorylation is likely an important mechanism of Smad nuclear accumulation during TGF-beta signalling.
Anaerobic glycolysis in yeast perturbed by the reduction of xenobiotic ketones is studied numerically in two models which possess the same topology but different levels of complexity. By comparing both models predictions for concentrations and fluxes as well as steady or oscillatory temporal behavior we answer the question what phenomena require what kind of minimum model abstraction. While mean concentrations and fluxes are predicted in agreement by both models we observe different domains of oscillatory behavior in parameter space. Generic properties of the glycolytic response to ketones are discussed.
We introduce a minimal model for the evolution of functional protein-interaction networks using a sequence-based mutational algorithm, and apply the model to study neutral drift in networks that yield oscillatory dynamics. Starting with a functional core module, random evolutionary drift increases network complexity even in the absence of specific selective pressures. Surprisingly, we uncover a hidden order in sequence space that gives rise to long-term evolutionary memory, implying strong constraints on network evolution due to the topology of accessible sequence space.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
