bioRxiv Science⌕ Search

Biology subjects

Fuegger, M.

Publications and source records attributed to Fuegger, M..

4 recordsLinked to original sources

Efficient Stochastic Trace Generation for Transcription

Bursty transcription in single cells typically produces over-dispersed, skewed, and sometimes heavy-tailed expression distributions that are explained by two-state Markov models of the promoters. While the gold standard for simulation is exact stochastic sampling with Gillespies algorithm, obtaining thousands of timed traces is computationally costly. Surrogate models based on stochastic differential equations (SDEs) are widely used to speed up this simulation process. An example is the Chemical Langevin Equation based on Gaussian noise, which, however, does not capture heavy-tailed noise. In this work, we present a unified SDE framework that combines deterministic drift, Gaussian fluctuations, and additive sporadic jumps of arbitrary distributions, and provide an open-source Python implementation, bcrnnoise. The framework subsumes standard surrogate models and allows for vectorized generation of batches of transcription traces. We assess computational speed and accuracy of common surrogate models along with new models, showing that high accuracy can be obtained while reducing computational cost up to two orders of magnitude.

bioinformatics↗

A Quasi-Stationary Distribution Bound for Fault Analysis in Gene Regulatory Networks

The inherent stochastic fluctuations in signaling molecules of Gene Regulatory Networks (GRNs) add unpredictability, complicating the design of robust synthetic GRNs that must function within precise ranges. Multi-stable GRNs, such as toggle switches, are central to systems like biosensors and logic gates but can fail due to unintended transitions between stable states caused by the fluctuations. Despite their importance, tools to characterize the probability distributions around stable states remain limited. We present a mathematical framework to analyze these multi-stable systems using continuous-time Markov chains (CTMCs) and quasi-stationary distributions. This framework is broadly applicable, requiring only that the state space is connected, making it applicable to a variety of systems. We then apply the framework to current examples from the literature and conclude that our method provides quantitative design principles for toggle switch design that match current experimental insights, identifying parameter thresholds where systems transition from frequent stochastic switching (hours) to stable operation (years to decades) and demonstrate upper bound calculations for false positive/negative rates in population-level biosensor dynamics.

systems biology↗

An Allee-based Distributed Algorithm for Microbial Whole-Cell Sensors

Reliable detection of substances present at potentially low concentrations is a problem common to many biomedical applications. Complementary to well-established enzyme-, antibody-antigen-, and sequencing-based approaches, so-called microbial whole-cell sensors, i.e., synthetically engineered microbial cells that sense and report substances, have been proposed as alternatives. Typically these cells operate independently: a cell reports an analyte upon local detection. In this work, we analyze a distributed algorithm for microbial whole-cell sensors, where cells communicate to coordinate if an analyte has been detected. The algorithm, inspired by the Allee effect in biological populations, causes cells to alternate between a logical 0 and 1 state in response to reacting with the particle of interest. When the cells in the logical 1 state exceed a threshold, the algorithm converts the remaining cells to the logical 1 state, representing an easily-detectable output signal. We validate the algorithm through mathematical analysis and simulations, demonstrating that it works correctly even in noisy cellular environments.

synthetic biology↗

MobsPy: A Meta-Species Language for Chemical Reaction Networks

Chemical reaction networks are widely used to model biochemical systems. However, when the complexity of these systems increases, the chemical reaction networks are prone to errors in the initial modeling and subsequent updates of the model. We present the Meta-species-oriented Biochemical Systems Language (MobsPy), a language designed to simplify the definition of chemical reaction networks in Python. MobsPy is built around the notion of meta-species, which are sets of species that can be multiplied to create higher-dimensional orthogonal characteristics spaces and inheritance of reactions. Reactions can modify these characteristics. For reactants, queries allow to select a subset from a meta-species and use them in a reaction. For products, queries specify the dimensions in which a modification occurs. We demonstrate the simplification capabilities of the MobsPy language at the hand of a running example and a circuit from literature. The MobsPy Python package includes functions to perform both deterministic and stochastic simulations, as well as easily configurable plotting. The MobsPy package is indexed in the Python Package Index and can thus be installed via pip.

bioinformatics↗