Statistical approach for parameter identification by Turing patterns

Unraveling biochemical spatial patterns: Machine learning approaches to the inverse problem of stationary Turing patterns

The diffusion-driven Turing instability is a potential mechanism for spatial pattern formation in numerous biological and chemical systems. However, engineering these patterns and demonstrating that they are produced by this mechanism is challenging. To address this, we aim to solve the inverse problem in artificial and experimental Turing patterns. This task is challenging since patterns are often corrupted by noise and slight changes in initial conditions can lead to different patterns. We used both least squares to explore the problem and physics-informed neural networks to build a noise-robust method. We elucidate the functionality of our network in scenarios mimicking biological noise levels and showcase its application using an experimentally obtained chemical pattern. The findings reveal the significant promise of machine learning in steering the creation of synthetic patterns in bioengineering, thereby advancing our grasp of morphological intricacies within biological systems while acknowledging existing limitations.

Turing instability analysis and parameter identification based on optimal control and statistics method for a rumor propagation system

This study establishes a reaction-diffusion system to capture the dynamics of rumor propagation, considering two possibilities of contact transmission. The sufficient and necessary conditions for a positive equilibrium point are provided, and the Turing instability conditions for this equilibrium point are derived. Furthermore, utilizing variational inequalities, a first-order necessary condition for parameter identification based on optimal control is established. During the numerical simulation process, the correctness of the Turing instability conditions is verified, and optimal control-based parameter identification is applied to the target pattern. Additionally, statistical methods are employed for pattern parameter identification. The identification results demonstrate that optimal control-based parameter identification exhibits higher efficiency and accuracy. Finally, both theories' parameter identification principles are extended to a small-world network, yielding consistent conclusions with continuous space.

A time independent least squares algorithm for parameter identification of Turing patterns in reaction-diffusion systems

Turing patterns arising from reaction-diffusion systems such as epidemic, ecology or chemical reaction models are an important dynamic property. Parameter identification of Turing patterns in spatial continuous and networked reaction-diffusion systems is an interesting and challenging inverse problem. The existing algorithms require huge account operations and resources. These drawbacks are amplified when apply them to reaction-diffusion systems on large-scale complex networks. To overcome these shortcomings, we present a new least squares algorithm which is rooted in the fact that Turing patterns are the stationary solutions of reaction-diffusion systems. The new algorithm is time independent, it translates the parameter identification problem into a low dimensional optimization problem even a low order linear algebra equations. The numerical simulations demonstrate that our algorithm has good effectiveness, robustness as well as performance.

Learning system parameters from turing patterns

The Turing mechanism describes the emergence of spatial patterns due to spontaneous symmetry breaking in reaction-diffusion processes and underlies many developmental processes. Identifying Turing mechanisms in biological systems defines a challenging problem. This paper introduces an approach to the prediction of Turing parameter values from observed Turing patterns. The parameter values correspond to a parametrized system of reaction-diffusion equations that generate Turing patterns as steady state. The Gierer-Meinhardt model with four parameters is chosen as a case study. A novel invariant pattern representation based on resistance distance histograms is employed, along with Wasserstein kernels, in order to cope with the highly variable arrangement of local pattern structure that depends on the initial conditions which are assumed to be unknown. This enables us to compute physically plausible distances between patterns, to compute clusters of patterns and, above all, model parameter prediction based on training data that can be generated by numerical model evaluation with random initial data: for small training sets, classical state-of-the-art methods including operator-valued kernels outperform neural networks that are applied to raw pattern data, whereas for large training sets the latter are more accurate. A prominent property of our approach is that only a single pattern is required as input data for model parameter predicion. Excellent predictions are obtained for single parameter values and reasonably accurate results for jointly predicting all four parameter values.

Bayesian modeling of pattern formation from one snapshot of pattern

Partial differential equations (PDEs) have been widely used to reproduce patterns in nature and to give insight into the mechanism underlying pattern formation. Although many PDE models have been proposed, they rely on the pre-request knowledge of physical laws and symmetries, and developing a model to reproduce a given desired pattern remains difficult. We propose a method, referred to as Bayesian modeling of PDEs (BM-PDEs), to estimate the best dynamical PDE for one snapshot of a objective pattern under the stationary state without ground truth. We apply BM-PDEs to nontrivial patterns, such as quasicrystals (QCs), a double gyroid, and Frank-Kasper structures. We also generate three-dimensional dodecagonal QCs from a PDE model. This is done by using the estimated parameters for the Frank-Kasper A15 structure, which closely approximates the local structures of QCs. Our method works for noisy patterns and the pattern synthesized without the ground-truth parameters, which are required for the application toward experimental data.

Beyond Turing: far-from-equilibrium patterns and mechano-chemical feedback

Turing patterns are commonly understood as specific instabilities of a spatially homogeneous steady state, resulting from activator-inhibitor interaction destabilized by diffusion. We argue that this view is restrictive and its agreement with biological observations is problematic. We present two alternatives to the classical Turing analysis of patterns. First, we employ the abstract framework of evolution equations to enable the study of far-from-equilibrium patterns. Second, we introduce a mechano-chemical model, with the surface on which the pattern forms being dynamic and playing an active role in the pattern formation, effectively replacing the inhibitor. We highlight the advantages of these two alternatives vis-à-vis the classical Turing analysis, and give an overview of recent results and future challenges for both approaches. This article is part of the theme issue 'Recent progress and open frontiers in Turing's theory of morphogenesis'.

Bespoke Turing Systems

Reaction-diffusion systems are an intensively studied form of partial differential equation, frequently used to produce spatially heterogeneous patterned states from homogeneous symmetry breaking via the Turing instability. Although there are many prototypical "Turing systems" available, determining their parameters, functional forms, and general appropriateness for a given application is often difficult. Here, we consider the reverse problem. Namely, suppose we know the parameter region associated with the reaction kinetics in which patterning is required-we present a constructive framework for identifying systems that will exhibit the Turing instability within this region, whilst in addition often allowing selection of desired patterning features, such as spots, or stripes. In particular, we show how to build a system of two populations governed by polynomial morphogen kinetics such that the: patterning parameter domain (in any spatial dimension), morphogen phases (in any spatial dimension), and even type of resulting pattern (in up to two spatial dimensions) can all be determined. Finally, by employing spatial and temporal heterogeneity, we demonstrate that mixed mode patterns (spots, stripes, and complex prepatterns) are also possible, allowing one to build arbitrarily complicated patterning landscapes. Such a framework can be employed pedagogically, or in a variety of contemporary applications in designing synthetic chemical and biological patterning systems. We also discuss the implications that this freedom of design has on using reaction-diffusion systems in biological modelling and suggest that stronger constraints are needed when linking theory and experiment, as many simple patterns can be easily generated given freedom to choose reaction kinetics.