L p -Adaptation: Simultaneous Design Centering and Robustness Estimation of Electronic and Biological Systems

Design centering enables robustness screening of pattern formation models

MOTIVATION

Access to unprecedented amounts of quantitative biological data allows us to build and test biochemically accurate reaction-diffusion models of intracellular processes. However, any increase in model complexity increases the number of unknown parameters and, thus, the computational cost of model analysis. To efficiently characterize the behavior and robustness of models with many unknown parameters remains, therefore, a key challenge in systems biology.

RESULTS

We propose a novel computational framework for efficient high-dimensional parameter space characterization of reaction-diffusion models in systems biology. The method leverages the Lp-Adaptation algorithm, an adaptive-proposal statistical method for approximate design centering and robustness estimation. Our approach is based on an oracle function, which predicts for any given point in parameter space whether the model fulfills given specifications. We propose specific oracles to efficiently predict four characteristics of Turing-type reaction-diffusion models: bistability, instability, capability of spontaneous pattern formation and capability of pattern maintenance. We benchmark the method and demonstrate that it enables global exploration of a model's ability to undergo pattern-forming instabilities and to quantify robustness for model selection in polynomial time with dimensionality. We present an application of the framework to pattern formation on the endosomal membrane by the small GTPase Rab5 and its effectors, and we propose molecular mechanisms underlying this system.

AVAILABILITY AND IMPLEMENTATION

Our code is implemented in MATLAB and is available as open source under https://git.mpi-cbg.de/mosaic/software/black-box-optimization/rd-parameter-space-screening.

SUPPLEMENTARY INFORMATION

Supplementary data are available at Bioinformatics online.

Stability selection enables robust learning of differential equations from limited noisy data

We present a statistical learning framework for robust identification of differential equations from noisy spatio-temporal data. We address two issues that have so far limited the application of such methods, namely their robustness against noise and the need for manual parameter tuning, by proposing stability-based model selection to determine the level of regularization required for reproducible inference. This avoids manual parameter tuning and improves robustness against noise in the data. Our stability selection approach, termed PDE-STRIDE, can be combined with any sparsity-promoting regression method and provides an interpretable criterion for model component importance. We show that the particular combination of stability selection with the iterative hard-thresholding algorithm from compressed sensing provides a fast and robust framework for equation inference that outperforms previous approaches with respect to accuracy, amount of data required, and robustness. We illustrate the performance of PDE-STRIDE on a range of simulated benchmark problems, and we demonstrate the applicability of PDE-STRIDE on real-world data by considering purely data-driven inference of the protein interaction network for embryonic polarization in Caenorhabditis elegans. Using fluorescence microscopy images of C. elegans zygotes as input data, PDE-STRIDE is able to learn the molecular interactions of the proteins.

Distilling Robust Design Principles of Biocircuits Using Mixed Integer Dynamic Optimization

A major challenge in model-based design of synthetic biochemical circuits is how to address uncertainty in the parameters. A circuit whose behavior is robust to variations in the parameters will have more chances to behave as predicted when implemented in practice, and also to function reliably in presence of fluctuations and noise. Here, we extend our recent work on automated-design based on mixed-integer multi-criteria dynamic optimization to take into account parametric uncertainty. We exploit the intensive sampling of the design space performed by a global optimization algorithm to obtain the robustness of the topologies without significant additional computational effort. Our procedure provides automatically topologies that best trade-off performance and robustness against parameter fluctuations. We illustrate our approach considering the automated design of gene circuits achieving adaptation.

How Computational Models Enable Mechanistic Insights into Virus Infection

An implicit aim in cellular infection biology is to understand the mechanisms how viruses, microbes, eukaryotic parasites, and fungi usurp the functions of host cells and cause disease. Mechanistic insight is a deep understanding of the biophysical and biochemical processes that give rise to an observable phenomenon. It is typically subject to falsification, that is, it is accessible to experimentation and empirical data acquisition. This is different from logic and mathematics, which are not empirical, but built on systems of inherently consistent axioms. Here, we argue that modeling and computer simulation, combined with mechanistic insights, yields unprecedented deep understanding of phenomena in biology and especially in virus infections by providing a way of showing sufficiency of a hypothetical mechanism. This ideally complements the necessity statements accessible to empirical falsification by additional positive evidence. We discuss how computational implementations of mathematical models can assist and enhance the quantitative measurements of infection dynamics of enveloped and non-enveloped viruses and thereby help generating causal insights into virus infection biology.