Jaroslav Albert

Dynamic modeling of gene expression in prokaryotes: application to glucose-lactose diauxie in Escherichia coli

Coexpression of genes or, more generally, similarity in the expression profiles poses an unsurmountable obstacle to inferring the gene regulatory network (GRN) based solely on data from DNA microarray time series. Clustering of genes with similar expression profiles allows for a course-grained view of the GRN and a probabilistic determination of the connectivity among the clusters. We present a model for the temporal evolution of a gene cluster network which takes into account interactions of gene products with genes and, through a non-constant degradation rate, with other gene products. The number of model parameters is reduced by using polynomial functions to interpolate temporal data points. In this manner, the task of parameter estimation is reduced to a system of linear algebraic equations, thus making the computation time shorter by orders of magnitude. To eliminate irrelevant networks, we test each GRN for stability with respect to parameter variations, and impose restrictions on its behavior near the steady state. We apply our model and methods to DNA microarray time series’ data collected on Escherichia coli during glucose-lactose diauxie and infer the most probable cluster network for different phases of the experiment.

Detection of perturbation phases and developmental stages in organisms from DNA microarray time series data.

Available DNA microarray time series that record gene expression along the developmental stages of multicellular eukaryotes, or in unicellular organisms subject to external perturbations such as stress and diauxie, are analyzed. By pairwise comparison of the gene expression profiles on the basis of a translation-invariant and scale-invariant distance measure corresponding to least-rectangle regression, it is shown that peaks in the average distance values are noticeable and are localized around specific time points. These points systematically coincide with the transition points between developmental phases or just follow the external perturbations. This approach can thus be used to identify automatically, from microarray time series alone, the presence of external perturbations or the succession of developmental stages in arbitrary cell systems. Moreover, our results show that there is a striking similarity between the gene expression responses to these a priori very different phenomena. In contrast, the cell cycle does not involve a perturbation-like phase, but rather continuous gene expression remodeling. Similar analyses were conducted using three other standard distance measures, showing that the one we introduced was superior. Based on these findings, we set up an adapted clustering method that uses this distance measure and classifies the genes on the basis of their expression profiles within each developmental stage or between perturbation phases.

Robust non-linear differential equation models of gene expression evolution across Drosophila development

BackgroundThis paper lies in the context of modeling the evolution of gene expression away from stationary states, for example in systems subject to external perturbations or during the development of an organism. We base our analysis on experimental data and proceed in a top-down approach, where we start from data on a systems transcriptome, and deduce rules and models from it without a priori knowledge. We focus here on a publicly available DNA microarray time series, representing the transcriptome of Drosophila across evolution from the embryonic to the adult stage.ResultsIn the first step, genes were clustered on the basis of similarity of their expression profiles, measured by a translation-invariant and scale-invariant distance that proved appropriate for detecting transitions between development stages. Average profiles representing each cluster were computed and their time evolution was analyzed using coupled differential equations. A linear and several non-linear model structures involving a transcription and a degradation term were tested. The parameters were identified in three steps: determination of the strongest connections between genes, optimization of the parameters defining these connections, and elimination of the unnecessary parameters using various reduction schemes. Different solutions were compared on the basis of their abilities to reproduce the data, to keep realistic gene expression levels when extrapolated in time, to show the biologically expected robustness with respect to parameter variations, and to contain as few parameters as possible.ConclusionsWe showed that the linear model did very well in reproducing the data with few parameters, but was not sufficiently robust and yielded unrealistic values upon extrapolation in time. In contrast, the non-linear models all reached the latter two objectives, but some were unable to reproduce the data. A family of non-linear models, constructed from the exponential of linear combinations of expression levels, reached all the objectives. It defined networks with a mean number of connections equal to two, when restricted to the embryonic time series, and equal to five for the full time series. These networks were compared with experimental data about gene-transcription factor and protein-protein interactions. The non-uniqueness of the solutions was discussed in the context of plasticity and cluster versus single-gene networks.

Phonon-induced relaxation of a two-state system in solids

We study phonon-induced relaxation of quantum states of a particle (e.g., electron or proton) in a rigid double-well potential in a solid. The relaxation rate due to Raman two-phonon processes has been computed. We show that in the two-state limit symmetry arguments allow one to express these rates in terms of independently measurable parameters. In general, the two-phonon processes dominate relaxation at higher temperature. Due to parity effects in a biased two-state system, their rate can be controlled by the bias.

Stochastic noise reduction upon complexification: Positively correlated birth-death type systems.

Cell systems consist of a huge number of various molecules that display specific patterns of interactions, which have a determining influence on the cell׳s functioning. In general, such complexity is seen to increase with the complexity of the organism, with a concomitant increase of the accuracy and specificity of the cellular processes. The question thus arises how the complexification of systems - modeled here by simple interacting birth-death type processes - can lead to a reduction of the noise - described by the variance of the number of molecules. To gain understanding of this issue, we investigated the difference between a single system containing molecules that are produced and degraded, and the same system - with the same average number of molecules - connected to a buffer. We modeled these systems using Itō stochastic differential equations in discrete time, as they allow straightforward analytical developments. In general, when the molecules in the system and the buffer are positively correlated, the variance on the number of molecules in the system is found to decrease compared to the equivalent system without a buffer. Only buffers that are too noisy themselves tend to increase the noise in the main system. We tested this result on two model cases, in which the system and the buffer contain proteins in their active and inactive state, or protein monomers and homodimers. We found that in the second test case, where the interconversion terms are non-linear in the number of molecules, the noise reduction is much more pronounced; it reaches up to 20% reduction of the Fano factor with the parameter values tested in numerical simulations on an unperturbed birth-death model. We extended our analysis to two arbitrary interconnected systems, and found that the sum of the noise levels in the two systems generally decreases upon interconnection if the molecules they contain are positively correlated.

Is the cell nucleus a necessary component in precise temporal patterning

One of the functions of the cell nucleus is to help regulate gene expression by controlling molecular traffic across the nuclear envelope. Here we investigate, via stochastic simulation, what effects, if any, does segregation of a system into the nuclear and cytoplasmic compartments have on the stochastic properties of a motif with a negative feedback. One of the effects of the nuclear barrier is to delay the nuclear protein concentration, allowing it to behave in a switch-like manner. We found that this delay, defined as the time for the nuclear protein concentration to reach a certain threshold, has an extremely narrow distribution. To show this, we considered two models. In the first one, the proteins could diffuse freely from cytoplasm to nucleus (simple model); and in the second one, the proteins required assistance from a special class of proteins called importins. For each model, we generated fifty parameter sets, chosen such that the temporal profiles they effectuated were very similar, and whose average threshold time was approximately 150 minutes. The standard deviation of the threshold times computed over one hundred realizations were found to be between 1.8 and 7.16 minutes across both models. To see whether a genetic motif in a prokaryotic cell can achieve this degree of precision, we also simulated five variations on the coherent feed-forward motif (CFFM), three of which contained a negative feedback. We found that the performance of these motifs was nowhere near as impressive as the one found in the eukaryotic cell; the best standard deviation was 6.6 minutes. We argue that the significance of these results, the fact and necessity of spatio-temporal precision in the developmental stages of eukaryotes, and the absence of such a precision in prokaryotes, all suggest that the nucleus has evolved, in part, under the selective pressure to achieve highly predictable phenotypes.

Design principles of a genetic alarm clock.

Turning genes on and off is a mechanism by which cells and tissues make phenotypic decisions. Gene network motifs capable of supporting two or more steady states and thereby providing cells with a plurality of possible phenotypes are referred to as genetic switches. Modeled on the bases of naturally occurring genetic networks, synthetic biologists have successfully constructed artificial switches, thus opening a door to new possibilities for improvement of the known, but also the design of new synthetic genetic circuits. One of many obstacles to overcome in such efforts is to understand and hence control intrinsic noise which is inherent in all biological systems. For some motifs the noise is negligible; for others, fluctuations in the particle number can be comparable to its average. Due to their slowed dynamics, motifs with positive autoregulation tend to be highly sensitive to fluctuations of their chemical environment and are in general very noisy, especially during transition (switching). In this article we use stochastic simulations (Gillespie algorithm) to model such a system, in particular a simple bistable motif consisting of a single gene with positive autoregulation. Due to cooperativety, the dynamical behavior of this kind of motif is reminiscent of an alarm clock – the gene is (nearly) silent for some time after it is turned on and becomes active very suddenly. We investigate how these sudden transitions are affected by noise and show that under certain conditions accurate timing can be achieved. We also examine how promoter complexity influences the accuracy of this timing mechanism.

Probability distributions for multimeric systems

We propose a fast and accurate method of obtaining the equilibrium mono-modal joint probability distributions for multimeric systems. The method necessitates only two assumptions: the copy number of all species of molecule may be treated as continuous; and, the probability density functions (pdf) are well-approximated by multivariate skew normal distributions (MSND). Starting from the master equation, we convert the problem into a set of equations for the statistical moments which are then expressed in terms of the parameters intrinsic to the MSND. Using an optimization package on Mathematica, we minimize a Euclidian distance function comprising of a sum of the squared difference between the left and the right hand sides of these equations. Comparison of results obtained via our method with those rendered by the Gillespie algorithm demonstrates our method to be highly accurate as well as efficient.

Voltage from mechanical stress in type-II superconductors: Depinning of the magnetic flux by moving dislocations

Mechanical stress causes motion of defects in solids. We show that in a type-II superconductor, a moving dislocation generates a pattern of current that exerts a depinning force on the surrounding vortex lattice. The concentration of dislocations and the mechanical stress needed to produce critical depinning currents are shown to be within practical range. When external magnetic field and transport current are present, this effect generates voltage across the superconductor. Thus a superconductor can serve as an electrical sensor of the mechanical stress.

A Hybrid of the Chemical Master Equation and the Gillespie Algorithm for Efficient Stochastic Simulations of Sub-Networks.

Modeling stochastic behavior of chemical reaction networks is an important endeavor in many aspects of chemistry and systems biology. The chemical master equation (CME) and the Gillespie algorithm (GA) are the two most fundamental approaches to such modeling; however, each of them has its own limitations: the GA may require long computing times, while the CME may demand unrealistic memory storage capacity. We propose a method that combines the CME and the GA that allows one to simulate stochastically a part of a reaction network. First, a reaction network is divided into two parts. The first part is simulated via the GA, while the solution of the CME for the second part is fed into the GA in order to update its propensities. The advantage of this method is that it avoids the need to solve the CME or stochastically simulate the entire network, which makes it highly efficient. One of its drawbacks, however, is that most of the information about the second part of the network is lost in the process. Therefore, this method is most useful when only partial information about a reaction network is needed. We tested this method against the GA on two systems of interest in biology - the gene switch and the Griffith model of a genetic oscillator—and have shown it to be highly accurate. Comparing this method to four different stochastic algorithms revealed it to be at least an order of magnitude faster than the fastest among them.