φ-evo: A program to evolve phenotypic models of biological networks

Automatic design of gene regulatory mechanisms for spatial pattern formation

Gene regulatory mechanisms (GRMs) control the formation of spatial and temporal expression patterns that can serve as regulatory signals for the development of complex shapes. Synthetic developmental biology aims to engineer such genetic circuits for understanding and producing desired multicellular spatial patterns. However, designing synthetic GRMs for complex, multi-dimensional spatial patterns is a current challenge due to the nonlinear interactions and feedback loops in genetic circuits. Here we present a methodology to automatically design GRMs that can produce any given two-dimensional spatial pattern. The proposed approach uses two orthogonal morphogen gradients acting as positional information signals in a multicellular tissue area or culture, which constitutes a continuous field of engineered cells implementing the same designed GRM. To efficiently design both the circuit network and the interaction mechanisms-including the number of genes necessary for the formation of the target spatial pattern-we developed an automated algorithm based on high-performance evolutionary computation. The tolerance of the algorithm can be configured to design GRMs that are either simple to produce approximate patterns or complex to produce precise patterns. We demonstrate the approach by automatically designing GRMs that can produce a diverse set of synthetic spatial expression patterns by interpreting just two orthogonal morphogen gradients. The proposed framework offers a versatile approach to systematically design and discover complex genetic circuits producing spatial patterns.

Automatic design of gene regulatory mechanisms for spatial pattern formation

Synthetic developmental biology aims to engineer gene regulatory mechanisms (GRMs) for understanding and producing desired multicellular patterns and shapes. However, designing GRMs for spatial patterns is a current challenge due to the nonlinear interactions and feedback loops in genetic circuits. Here we present a methodology to automatically design GRMs that can produce any given spatial pattern. The proposed approach uses two orthogonal morphogen gradients acting as positional information signals in a multicellular tissue area or culture, which constitutes a continuous field of engineered cells implementing the same designed GRM. To efficiently design both the circuit network and the interaction mechanisms-including the number of genes necessary for the formation of the target pattern-we developed an automated algorithm based on high-performance evolutionary computation. The tolerance of the algorithm can be configured to design GRMs that are either simple to produce approximate patterns or complex to produce precise patterns. We demonstrate the approach by automatically designing GRMs that can produce a diverse set of synthetic spatial expression patterns by interpreting just two orthogonal morphogen gradients. The proposed framework offers a versatile approach to systematically design and discover pattern-producing genetic circuits.

Computational Systems Biology of Morphogenesis

Extracting mechanistic knowledge from the spatial and temporal phenotypes of morphogenesis is a current challenge due to the complexity of biological regulation and their feedback loops. Furthermore, these regulatory interactions are also linked to the biophysical forces that shape a developing tissue, creating complex interactions responsible for emergent patterns and forms. Here we show how a computational systems biology approach can aid in the understanding of morphogenesis from a mechanistic perspective. This methodology integrates the modeling of tissues and whole-embryos with dynamical systems, the reverse engineering of parameters or even whole equations with machine learning, and the generation of precise computational predictions that can be tested at the bench. To implement and perform the computational steps in the methodology, we present user-friendly tools, computer code, and guidelines. The principles of this methodology are general and can be adapted to other model organisms to extract mechanistic knowledge of their morphogenesis.

Inference of dynamic spatial GRN models with multi-GPU evolutionary computation

Reverse engineering mechanistic gene regulatory network (GRN) models with a specific dynamic spatial behavior is an inverse problem without analytical solutions in general. Instead, heuristic machine learning algorithms have been proposed to infer the structure and parameters of a system of equations able to recapitulate a given gene expression pattern. However, these algorithms are computationally intensive as they need to simulate millions of candidate models, which limits their applicability and requires high computational resources. Graphics processing unit (GPU) computing is an affordable alternative for accelerating large-scale scientific computation, yet no method is currently available to exploit GPU technology for the reverse engineering of mechanistic GRNs from spatial phenotypes. Here we present an efficient methodology to parallelize evolutionary algorithms using GPU computing for the inference of mechanistic GRNs that can develop a given gene expression pattern in a multicellular tissue area or cell culture. The proposed approach is based on multi-CPU threads running the lightweight crossover, mutation and selection operators and launching GPU kernels asynchronously. Kernels can run in parallel in a single or multiple GPUs and each kernel simulates and scores the error of a model using the thread parallelism of the GPU. We tested this methodology for the inference of spatiotemporal mechanistic gene regulatory networks (GRNs)-including topology and parameters-that can develop a given 2D gene expression pattern. The results show a 700-fold speedup with respect to a single CPU implementation. This approach can streamline the extraction of knowledge from biological and medical datasets and accelerate the automatic design of GRNs for synthetic biology applications.

Poly-aneuploid cancer cells promote evolvability, generating lethal cancer

Cancer cells utilize the forces of natural selection to evolve evolvability allowing a constant supply of heritable variation that permits a cancer species to evolutionary track changing hazards and opportunities. Over time, the dynamic tumor ecosystem is exposed to extreme, catastrophic changes in the conditions of the tumor-natural (e.g., loss of blood supply) or imposed (therapeutic). While the nature of these catastrophes may be varied or unique, their common property may be to doom the current cancer phenotype unless it evolves rapidly. Poly-aneuploid cancer cells (PACCs) may serve as efficient sources of heritable variation that allows cancer cells to evolve rapidly, speciate, evolutionarily track their environment, and most critically for patient outcome and survival, permit evolutionary rescue, therapy resistance, and metastasis. As a conditional evolutionary strategy, they permit the cancer cells to accelerate evolution under stress and slow down the generation of heritable variation when conditions are more favorable or when the cancer cells are closer to an evolutionary optimum. We hypothesize that they play a critical and outsized role in lethality by their increased capacity for invasion and motility, for enduring novel and stressful environments, and for generating heritable variation that can be dispensed to their 2N+ aneuploid progeny that make up the bulk of cancer cells within a tumor, providing population rescue in response to therapeutic stress. Targeting PACCs is essential to cancer therapy and patient cure-without the eradication of the resilient PACCs, cancer will recur in treated patients.

Feed-forward regulation adaptively evolves via dynamics rather than topology when there is intrinsic noise

In transcriptional regulatory networks (TRNs), a canonical 3-node feed-forward loop (FFL) is hypothesized to evolve to filter out short spurious signals. We test this adaptive hypothesis against a novel null evolutionary model. Our mutational model captures the intrinsically high prevalence of weak affinity transcription factor binding sites. We also capture stochasticity and delays in gene expression that distort external signals and intrinsically generate noise. Functional FFLs evolve readily under selection for the hypothesized function but not in negative controls. Interestingly, a 4-node “diamond” motif also emerges as a short spurious signal filter. The diamond uses expression dynamics rather than path length to provide fast and slow pathways. When there is no idealized external spurious signal to filter out, but only internally generated noise, only the diamond and not the FFL evolves. While our results support the adaptive hypothesis, we also show that non-adaptive factors, including the intrinsic expression dynamics, matter.

Feed‐forward loops (FFLs) can filter out noise, but whether their overrepresentation in GRNs reflects adaptive evolution for this function is debated. Here, the authors develop a null model of regulatory evolution and find that FFLs evolve readily under selection for the noise filtering function.

Automated, predictive, and interpretable inference of Caenorhabditis elegans escape dynamics

The roundworm Caenorhabditis elegans exhibits robust escape behavior in response to rapidly rising temperature. The behavior lasts for a few seconds, shows history dependence, involves both sensory and motor systems, and is too complicated to model mechanistically using currently available knowledge. Instead we model the process phenomenologically, and we use the Sir Isaac dynamical inference platform to infer the model in a fully automated fashion directly from experimental data. The inferred model requires incorporation of an unobserved dynamical variable and is biologically interpretable. The model makes accurate predictions about the dynamics of the worm behavior, and it can be used to characterize the functional logic of the dynamical system underlying the escape response. This work illustrates the power of modern artificial intelligence to aid in discovery of accurate and interpretable models of complex natural systems.

In Silico Evolution of Biochemical Log-Response

Numerous biological systems are known to harbor a form of logarithmic behavior, from Weber's law to bacterial chemotaxis. Such a log-response allows for sensitivity to small relative variations of biochemical inputs over a large range of concentration values. Here we use a genetic algorithm to evolve biochemical networks displaying a logarithmic response. A quasi-perfect log-response implemented by the same core network evolves in a convergent way across our different in silico replications. The best network is able to fit a logarithm over 4 orders of magnitude with an accuracy of the order of 1%. At the heart of this network, we show that a logarithmic approximation may be implemented with one single nonlinear interaction, that can be interpreted either as multisite phosphorylations or as a ligand induced multimerization. We provide an analytical explanation for the effect and exhibit constraints on parameters. Biological log-response might thus be easier to implement than usually assumed.