Ras GTPases are lipid-anchored G proteins, which play a fundamental role in cell signaling processes. Electron micrographs of immunogold-labeled Ras have shown that membrane-bound Ras molecules segregate into nanocluster domains. Several models have been developed in attempts to obtain quantitative descriptions of nanocluster formation, but all have relied on assumptions such as a constant, expression-level independent ratio of Ras in clusters to Ras monomers (cluster/monomer ratio). However, this assumption is inconsistent with the law of mass action. Here, we present a biophysical model of Ras clustering based on short-range attraction and long-range repulsion between Ras molecules in the membrane. To test this model, we performed Monte Carlo simulations and compared statistical clustering properties with experimental data. We find that we can recover the experimentally-observed clustering across a range of Ras expression levels, without assuming a constant cluster/monomer ratio or the existence of lipid rafts. In addition, our model makes predictions about the signaling properties of Ras nanoclusters in support of the idea that Ras nanoclusters act as an analog-digital-analog converter for high fidelity signaling.

Recent research adds to a growing body of literature on the essential role of ceramides in glucose homeostasis and insulin signaling, while the mechanistic interplay between various components of ceramide metabolism remains to be quantified. We present an extended model of C16:0 ceramide production through both the de novo synthesis and the salvage pathways. We verify our model with a combination of published models and independent experimental data. In silico experiments of the behavior of ceramide and related bioactive lipids in accordance with the observed transcriptomic changes in obese/diabetic murine macrophages at 5 and 16 weeks support the observation of insulin resistance only at the later phase. Our analysis suggests the pivotal role of ceramide synthase, serine palmitoyltransferase and dihydroceramide desaturase involved in the de novo synthesis and the salvage pathways in influencing insulin resistance versus its regulation.

Escherichia coli have developed one of the most efficient regulatory response mechanisms to phosphate starvation. The machinery involves a cascade with a two-component system (TCS) that relays the external signal to the genetic circuit, resulting in a feedback response. Achieving a quantitative understanding of this system has implications in synthetic biology and biotechnology, for example, in applications for wastewater treatment. To this aim, we present a computational model and experimental results with a detailed description of the TCS, consisting of PhoR and PhoB, together with the mechanisms of gene expression. The model is parameterised within the feasible range, and fitted to the dynamic response of our experimental data on PhoB as well as PhoA, the product of this network that is used in alkaline phosphatase production. Deterministic and stochastic simulations with our model predict the regulation dynamics in higher external phosphate concentrations while reproducing the experimental observations. In a cycle of simulations and experimental verification, our model predicts and explores phenotypes with various synthetic promoter designs that can optimise the inorganic phosphate intake in E. coli. Sensitivity analysis demonstrates that the Pho-controlled genes have a significant influence over the phosphate response. Together with experimental findings, our model should thus provide insights for the investigations on engineering new sensors and regulators for living technologies.

Abstract. Deep inference is a proof theoretic methodology that generalizes the standard notion of inference of the sequent calculus, whereby inference rules become applicable at any depth inside logical expressions. Deep inference provides more freedom in the design of deductive systems for different logics and a rich combinatoric analysis of proofs. In particular, construction of exponentially shorter analytic proofs becomes possible, however with the cost of a greater nondeterminism than in the sequent calculus. In this paper, we show that the nondeterminism in proof search can be reduced without losing the shorter proofs and without sacrificing proof theoretic cleanliness. For this, we exploit an interaction and depth scheme in the logical expressions. We demonstrate our method on deep inference systems for multiplicative linear logic and classical logic, discuss its proof complexity and its relation to focusing, and present implementations.