bioRxiv Science⌕ Search

Biology subjects

Schnoerr, D.

Publications and source records attributed to Schnoerr, D..

3 recordsLinked to original sources

Exactly solvable models of stochastic gene expression

Stochastic models are key to understanding the intricate dynamics of gene expression. But the simplest models which only account for e.g. active and inactive states of a gene fail to capture common observations in both prokaryotic and eukaryotic organisms. Here we consider multistate models of gene expression which generalise the canonical Telegraph process, and are capable of capturing the joint effects of e.g. transcription factors, heterochromatin state and DNA accessibility (or, in prokaryotes, Sigma-factor activity) on transcript abundance. We propose two approaches for solving classes of these generalised systems. The first approach offers a fresh perspective on a general class of multistate models, and allows us to "decompose" more complicated systems into simpler processes, each of which can be solved analytically. This enables us to obtain a solution of any model from this class. We further show that these models cannot have a heavy-tailed distribution in the absence of extrinsic noise. Next, we develop an approximation method based on a power series expansion of the stationary distribution for an even broader class of multistate models of gene transcription. The combination of analytical and computational solutions for these realistic gene expression models also holds the potential to design synthetic systems, and control the behaviour of naturally evolved gene expression systems, e.g. in guiding cell-fate decisions.

systems biology↗

Neural Field Models for Latent State Inference: Application to Large-Scale Neuronal Recordings

Large-scale neural recordings are becoming increasingly better at providing a window into functional neural networks in the living organism. Interpreting such rich data sets, however, poses fundamental statistical challenges. The neural field models of Wilson, Cowan and colleagues remain the mainstay of mathematical population modeling owing to their interpretable, mechanistic parameters and amenability to mathematical analysis. We developed a method based on moment closure to interpret neural field models as latent state-space point-process models, making mean field models amenable to statistical inference. We demonstrate that this approach can infer latent neural states, such as active and refractory neurons, in large populations. After validating this approach with synthetic data, we apply it to high-density recordings of spiking activity in the developing mouse retina. This confirms the essential role of a long lasting refractory state in shaping spatio-temporal properties of neonatal retinal waves. This conceptual and methodological advance opens up new theoretical connections between mathematical theory and point-process state-space models in neural data analysis. SignificanceDeveloping statistical tools to connect single-neuron activity to emergent collective dynamics is vital for building interpretable models of neural activity. Neural field models relate single-neuron activity to emergent collective dynamics in neural populations, but integrating them with data remains challenging. Recently, latent state-space models have emerged as a powerful tool for constructing phenomenological models of neural population activity. The advent of high-density multi-electrode array recordings now enables us to examine large-scale collective neural activity. We show that classical neural field approaches can yield latent statespace equations and demonstrate inference for a neural field model of excitatory spatiotemporal waves that emerge in the developing retina.

neuroscience↗

Turing patterns are common but not robust

Turing patterns (TPs) underlie many fundamental developmental processes, but they operate over narrow parameter ranges, raising the conundrum of how evolution can ever discover them. Here we explore TP design space to address this question and to distill design rules. We exhaustively analyze 2- and 3-node biological candidate Turing systems: crucially, network structure alone neither determines nor guarantees emergent TPs. A surprisingly large fraction (>60%) of network design space can produce TPs, but these are sensitive to even subtle changes in parameters, network structure and regulatory mechanisms. This implies that TP networks are more common than previously thought, and evolution might regularly encounter prototypic solutions. Importantly, we deduce compositional rules for TP systems that are almost necessary and sufficient (96% of TP networks contain them, and 95% of networks implementing them produce TPs). This comprehensive network atlas provides the blueprints for identifying natural TPs, and for engineering synthetic systems.

developmental biology↗