Automated quantification of photoreceptor outer segments in developing and degenerating retinas on microscopy images across scales.

The functionality of photoreceptors, rods, and cones is highly dependent on their outer segments (POS), a cellular compartment containing highly organized membranous structures that generate biochemical signals from incident light. While POS formation and degeneration are qualitatively assessed on microscopy images, reliable methodology for quantitative analyses is still limited. Here, we developed methods to quantify POS (QuaPOS) maturation and quality on retinal sections using automated image analyses. POS formation was examined during the development and in adulthood of wild-type mice via light microscopy (LM) and transmission electron microscopy (TEM). To quantify the number, size, shape, and fluorescence intensity of POS, retinal cryosections were immunostained for the cone POS marker S-opsin. Fluorescence images were used to train the robust classifier QuaPOS-LM based on supervised machine learning for automated image segmentation. Characteristic features of segmentation results were extracted to quantify the maturation of cone POS. Subsequently, this quantification method was applied to characterize POS degeneration in "cone photoreceptor function loss 1" mice. TEM images were used to establish the ultrastructural quantification method QuaPOS-TEM for the alignment of POS membranes. Images were analyzed using a custom-written MATLAB code to extract the orientation of membranes from the image gradient and their alignment (coherency). This analysis was used to quantify the POS morphology of wild-type and two inherited retinal degeneration ("retinal degeneration 19" and "rhodopsin knock-out") mouse lines. Both automated analysis technologies provided robust characterization and quantification of POS based on LM or TEM images. Automated image segmentation by the classifier QuaPOS-LM and analysis of the orientation of membrane stacks by QuaPOS-TEM using fluorescent or TEM images allowed quantitative evaluation of POS formation and quality. The assessments showed an increase in POS number, volume, and membrane coherency during wild-type postnatal development, while a decrease in all three observables was detected in different retinal degeneration mouse models. All the code used for the presented analysis is open source, including example datasets to reproduce the findings. Hence, the QuaPOS quantification methods are useful for in-depth characterization of POS on retinal sections in developmental studies, for disease modeling, or after therapeutic interventions affecting photoreceptors.

STENCIL-NET for equation-free forecasting from data.

We present an artificial neural network architecture, termed STENCIL-NET, for equation-free forecasting of spatiotemporal dynamics from data. STENCIL-NET works by learning a discrete propagator that is able to reproduce the spatiotemporal dynamics of the training data. This data-driven propagator can then be used to forecast or extrapolate dynamics without needing to know a governing equation. STENCIL-NET does not learn a governing equation, nor an approximation to the data themselves. It instead learns a discrete propagator that reproduces the data. It therefore generalizes well to different dynamics and different grid resolutions. By analogy with classic numerical methods, we show that the discrete forecasting operators learned by STENCIL-NET are numerically stable and accurate for data represented on regular Cartesian grids. A once-trained STENCIL-NET model can be used for equation-free forecasting on larger spatial domains and for longer times than it was trained for, as an autonomous predictor of chaotic dynamics, as a coarse-graining method, and as a data-adaptive de-noising method, as we illustrate in numerical experiments. In all tests, STENCIL-NET generalizes better and is computationally more efficient, both in training and inference, than neural network architectures based on local (CNN) or global (FNO) nonlinear convolutions.

Variational inference accelerates accurate DNA mixture deconvolution.

We investigate a class of DNA mixture deconvolution algorithms based on variational inference, and we show that this can significantly reduce computational runtimes with little or no effect on the accuracy and precision of the result. In particular, we consider Stein Variational Gradient Descent (SVGD) and Variational Inference (VI) with an evidence lower-bound objective. Both provide alternatives to the commonly used Markov-Chain Monte-Carlo methods for estimating the model posterior in Bayesian probabilistic genotyping. We demonstrate that both SVGD and VI significantly reduce computational costs over the current state of the art. Importantly, VI does so without sacrificing precision or accuracy, presenting an overall improvement over previously published methods.

Roadmap on Deep Learning for Microscopy.

Through digital imaging, microscopy has evolved from primarily being a means for visual observation of life at the micro- and nano-scale, to a quantitative tool with ever-increasing resolution and throughput. Artificial intelligence, deep neural networks, and machine learning are all niche terms describing computational methods that have gained a pivotal role in microscopy-based research over the past decade. This Roadmap is written collectively by prominent researchers and encompasses selected aspects of how machine learning is applied to microscopy image data, with the aim of gaining scientific knowledge by improved image quality, automated detection, segmentation, classification and tracking of objects, and efficient merging of information from multiple imaging modalities. We aim to give the reader an overview of the key developments and an understanding of possibilities and limitations of machine learning for microscopy. It will be of interest to a wide cross-disciplinary audience in the physical sciences and life sciences.

Analysis of the Hamiltonian Monte Carlo genotyping algorithm on PROVEDIt mixtures including a novel precision benchmark.

We provide an internal validation study of a recently published precise DNA mixture algorithm based on Hamiltonian Monte Carlo sampling (Susik et al., 2022). We provide results for all 428 mixtures analysed by Riman et al. (2021) and compare the results with two state-of-the-art software products: STRmix™  v2.6 and Euroformix v3.4.0. The comparison shows that the Hamiltonian Monte Carlo method provides reliable values of likelihood ratios (LRs) close to the other methods. We further propose a novel large-scale precision benchmark and quantify the precision of the Hamiltonian Monte Carlo method, indicating its improvements over existing solutions. Finally, we analyse the influence of the factors discussed by Buckleton et al. (2022).

A Gaussian jump process formulation of the reaction-diffusion master equation enables faster exact stochastic simulations.

We propose a Gaussian jump process model on a regular Cartesian lattice for the diffusion part of the Reaction-Diffusion Master Equation (RDME). We derive the resulting Gaussian RDME (GRDME) formulation from analogy with a kernel-based discretization scheme for continuous diffusion processes and quantify the limits of its validity relative to the classic RDME. We then present an exact stochastic simulation algorithm for the GRDME, showing that the accuracies of GRDME and RDME are comparable, but exact simulations of the GRDME require only a fraction of the computational cost of exact RDME simulations. We analyze the origin of this speedup and its scaling with problem dimension. The benchmarks suggest that the GRDME is a particularly beneficial model for diffusion-dominated systems in three dimensional spaces, often occurring in systems biology and cell biology.

Collective cell migration during optic cup formation features changing cell-matrix interactions linked to matrix topology.

Cell migration is crucial for organismal development and shapes organisms in health and disease. Although a lot of research has revealed the role of intracellular components and extracellular signaling in driving single and collective cell migration, the influence of physical properties of the tissue and the environment on migration phenomena in vivo remains less explored. In particular, the role of the extracellular matrix (ECM), which many cells move upon, is currently unclear. To overcome this gap, we use zebrafish optic cup formation, and by combining novel transgenic lines and image analysis pipelines, we study how ECM properties influence cell migration in vivo. We show that collectively migrating rim cells actively move over an immobile extracellular matrix. These cell movements require cryptic lamellipodia that are extended in the direction of migration. Quantitative analysis of matrix properties revealed that the topology of the matrix changes along the migration path. These changes in matrix topologies are accompanied by changes in the dynamics of cell-matrix interactions. Experiments and theoretical modeling suggest that matrix porosity could be linked to efficient migration. Indeed, interfering with matrix topology by increasing its porosity results in a loss of cryptic lamellipodia, less-directed cell-matrix interactions, and overall inefficient migration. Thus, matrix topology is linked to the dynamics of cell-matrix interactions and the efficiency of directed collective rim cell migration during vertebrate optic cup morphogenesis.

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.

Hamiltonian Monte Carlo with strict convergence criteria reduces run-to-run variability in forensic DNA mixture deconvolution.

MOTIVATION: Analysing mixed DNA profiles is a common task in forensic genetics. Due to the complexity of the data, such analysis is often performed using Markov Chain Monte Carlo (MCMC)-based genotyping algorithms. These trade off precision against execution time. When default settings (including default chain lengths) are used, as large as a 10-fold changes in inferred log-likelihood ratios (LR) are observed when the software is run twice on the same case. So far, this uncertainty has been attributed to the stochasticity of MCMC algorithms. Since LRs translate directly to strength of the evidence in a criminal trial, forensic laboratories desire LR with small run-to-run variability. RESULTS: We present the use of a Hamiltonian Monte Carlo (HMC) algorithm that reduces run-to-run variability in forensic DNA mixture deconvolution by around an order of magnitude without increased runtime. We achieve this by enforcing strict convergence criteria. We show that the choice of convergence metric strongly influences precision. We validate our method by reproducing previously published results for benchmark DNA mixtures (MIX05, MIX13, and ProvedIt). We also present a complete software implementation of our algorithm that is able to leverage GPU acceleration for the inference process. In the benchmark mixtures, on consumer-grade hardware, the runtime is less than 7 min for 3 contributors, less than 35 min for 4 contributors, and less than an hour for 5 contributors with one known contributor.

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.

Parallel Discrete Convolutions on Adaptive Particle Representations of Images.

We present data structures and algorithms for native implementations of discrete convolution operators over Adaptive Particle Representations (APR) of images on parallel computer architectures. The APR is a content-adaptive image representation that locally adapts the sampling resolution to the image signal. It has been developed as an alternative to pixel representations for large, sparse images as they typically occur in fluorescence microscopy. It has been shown to reduce the memory and runtime costs of storing, visualizing, and processing such images. This, however, requires that image processing natively operates on APRs, without intermediately reverting to pixels. Designing efficient and scalable APR-native image processing primitives, however, is complicated by the APR's irregular memory structure. Here, we provide the algorithmic building blocks required to efficiently and natively process APR images using a wide range of algorithms that can be formulated in terms of discrete convolutions. We show that APR convolution naturally leads to scale-adaptive algorithms that efficiently parallelize on multi-core CPU and GPU architectures. We quantify the speedups in comparison to pixel-based algorithms and convolutions on evenly sampled data. We achieve pixel-equivalent throughputs of up to 1TB/s on a single Nvidia GeForce RTX 2080 gaming GPU, requiring up to two orders of magnitude less memory than a pixel-based implementation.

Quantifying Molecular Dynamics within Complex Cellular Morphologies using LLSM-FRAP.

Quantifying molecular dynamics within the context of complex cellular morphologies is essential toward understanding the inner workings and function of cells. Fluorescence recovery after photobleaching (FRAP) is one of the most broadly applied techniques to measure the reaction diffusion dynamics of molecules in living cells. FRAP measurements typically restrict themselves to single-plane image acquisition within a subcellular-sized region of interest due to the limited temporal resolution and undesirable photobleaching induced by 3D fluorescence confocal or widefield microscopy. Here, an experimental and computational pipeline combining lattice light sheet microscopy, FRAP, and numerical simulations, offering rapid and minimally invasive quantification of molecular dynamics with respect to 3D cell morphology is presented. Having the opportunity to accurately measure and interpret the dynamics of molecules in 3D with respect to cell morphology has the potential to reveal unprecedented insights into the function of living cells.

A C++ expression system for partial differential equations enables generic simulations of biological hydrodynamics.

We present a user-friendly and intuitive C++ expression system to implement numerical simulations of continuum biological hydrodynamics. The expression system allows writing simulation programs in near-mathematical notation and makes codes more readable, more compact, and less error-prone. It also cleanly separates the implementation of the partial differential equation model from the implementation of the numerical methods used to discretize it. This allows changing either of them with minimal changes to the source code. The presented expression system is implemented in the high-performance computing platform OpenFPM, supporting simulations that transparently parallelize on multi-processor computer systems. We demonstrate that our expression system makes it easier to write scalable codes for simulating biological hydrodynamics in space and time. We showcase the present framework in numerical simulations of active polar fluids, as well as in classic simulations of fluid dynamics from the incompressible Navier-Stokes equations to Stokes flow in a ball. The presented expression system accelerates scalable simulations of spatio-temporal models that encode the physics and material properties of tissues in order to algorithmically study morphogenesis.

Learning physically consistent differential equation models from data using group sparsity.

We propose a statistical learning framework based on group-sparse regression that can be used to (i) enforce conservation laws, (ii) ensure model equivalence, and (iii) guarantee symmetries when learning or inferring differential-equation models from data. Directly learning interpretable mathematical models from data has emerged as a valuable modeling approach. However, in areas such as biology, high noise levels, sensor-induced correlations, and strong intersystem variability can render data-driven models nonsensical or physically inconsistent without additional constraints on the model structure. Hence, it is important to leverage prior knowledge from physical principles to learn biologically plausible and physically consistent models rather than models that simply fit the data best. We present the group iterative hard thresholding algorithm and use stability selection to infer physically consistent models with minimal parameter tuning. We show several applications from systems biology that demonstrate the benefits of enforcing priors in data-driven modeling.

Robustness of topological defects in discrete domains.

Topological defects are singular points in vector fields, important in applications ranging from fingerprint detection to liquid crystals to biomedical imaging. In discretized vector fields, topological defects and their topological charge are identified by finite differences or finite-step paths around the tentative defect. As the topological charge is (half) integer, it cannot depend continuously on each input vector in a discrete domain. Instead, it switches discontinuously when vectors change beyond a certain amount, making the analysis of topological defects error prone in noisy data. We improve existing methods for the identification of topological defects by proposing a robustness measure for (i) the location of a defect, (ii) the existence of topological defects and the total topological charge within a given area, (iii) the annihilation of a defect pair, and (iv) the formation of a defect pair. Based on the proposed robustness measure, we show that topological defects in discrete domains can be identified with optimal trade-off between localization precision and robustness. The proposed robustness measure enables uncertainty quantification for topological defects in noisy discretized nematic fields (orientation fields) and polar fields (vector fields).

Fundamentals of the logarithmic measure for revealing multimodal diffusion.

We develop a theoretical foundation for a time-series analysis method suitable for revealing the spectrum of diffusion coefficients in mixed Brownian systems, for which no prior knowledge of particle distinction is required. This method is directly relevant for particle tracking in biological systems, in which diffusion processes are often nonuniform. We transform Brownian data onto the logarithmic domain, in which the coefficients for individual modes of diffusion appear as distinct spectral peaks in the probability density. We refer to the method as the logarithmic measure of diffusion, or simply as the logarithmic measure. We provide a general protocol for deriving analytical expressions for the probability densities on the logarithmic domain. The protocol is applicable for any number of spatial dimensions with any number of diffusive states. The analytical form can be fitted to data to reveal multiple diffusive modes. We validate the theoretical distributions and benchmark the accuracy and sensitivity of the method by extracting multimodal diffusion coefficients from two-dimensional Brownian simulations of polydisperse filament bundles. Bundling the filaments allows us to control the system nonuniformity and hence quantify the sensitivity of the method. By exploiting the anisotropy of the simulated filaments, we generalize the logarithmic measure to rotational diffusion. By fitting the analytical forms to simulation data, we confirm the method's theoretical foundation. An error analysis in the single-mode regime shows that the proposed method is comparable in accuracy to the standard mean-squared displacement approach for evaluating diffusion coefficients. For the case of multimodal diffusion, we compare the logarithmic measure against other, more sophisticated methods, showing that both model selectivity and extraction accuracy are comparable for small data sets. Therefore, we suggest that the logarithmic measure, as a method for multimodal diffusion coefficient extraction, is ideally suited for small data sets, a condition often confronted in the experimental context. Finally, we critically discuss the proposed benefits of the method and its information content.

A non-linear system patterns Rab5 GTPase on the membrane.

Proteins can self-organize into spatial patterns via non-linear dynamic interactions on cellular membranes. Modelling and simulations have shown that small GTPases can generate patterns by coupling guanine nucleotide exchange factors (GEF) to effectors, generating a positive feedback of GTPase activation and membrane recruitment. Here, we reconstituted the patterning of the small GTPase Rab5 and its GEF/effector complex Rabex5/Rabaptin5 on supported lipid bilayers. We demonstrate a 'handover' of Rab5 from Rabex5 to Rabaptin5 upon nucleotide exchange. A minimal system consisting of Rab5, RabGDI and a complex of full length Rabex5/Rabaptin5 was necessary to pattern Rab5 into membrane domains. Rab5 patterning required a lipid membrane composition mimicking that of early endosomes, with PI(3)P enhancing membrane recruitment of Rab5 and acyl chain packing being critical for domain formation. The prevalence of GEF/effector coupling in nature suggests a possible universal system for small GTPase patterning involving both protein and lipid interactions.

Minimal Model of Cellular Symmetry Breaking.

The cell cortex, a thin film of active material assembled below the cell membrane, plays a key role in cellular symmetry-breaking processes such as cell polarity establishment and cell division. Here, we present a minimal model of the self-organization of the cell cortex that is based on a hydrodynamic theory of curved active surfaces. Active stresses on this surface are regulated by a diffusing molecular species. We show that coupling of the active surface to a passive bulk fluid enables spontaneous polarization and the formation of a contractile ring on the surface via mechanochemical instabilities. We discuss the role of external fields in guiding such pattern formation. Our work reveals that key features of cellular symmetry breaking and cell division can emerge in a minimal model via general dynamic instabilities.

Self-organized shape dynamics of active surfaces.

Mechanochemical processes in thin biological structures, such as the cellular cortex or epithelial sheets, play a key role during the morphogenesis of cells and tissues. In particular, they are responsible for the dynamical organization of active stresses that lead to flows and deformations of the material. Consequently, advective transport redistributes force-generating molecules and thereby contributes to a complex mechanochemical feedback loop. It has been shown in fixed geometries that this mechanism enables patterning, but the interplay of these processes with shape changes of the material remains to be explored. In this work, we study the fully self-organized shape dynamics using the theory of active fluids on deforming surfaces and develop a numerical approach to solve the corresponding force and torque balance equations. We describe the spontaneous generation of nontrivial surface shapes, shape oscillations, and directed surface flows that resemble peristaltic waves from self-organized, mechanochemical processes on the deforming surface. Our approach provides opportunities to explore the dynamics of self-organized active surfaces and can help to understand the role of shape as an integral element of the mechanochemical organization of morphogenetic processes.

Adaptive particle representation of fluorescence microscopy images.

Modern microscopes create a data deluge with gigabytes of data generated each second, and terabytes per day. Storing and processing this data is a severe bottleneck, not fully alleviated by data compression. We argue that this is because images are processed as grids of pixels. To address this, we propose a content-adaptive representation of fluorescence microscopy images, the Adaptive Particle Representation (APR). The APR replaces pixels with particles positioned according to image content. The APR overcomes storage bottlenecks, as data compression does, but additionally overcomes memory and processing bottlenecks. Using noisy 3D images, we show that the APR adaptively represents the content of an image while maintaining image quality and that it enables orders of magnitude benefits across a range of image processing tasks. The APR provides a simple and efficient content-aware representation of fluosrescence microscopy images.