Systematic Reverse Engineering of Network Topologies: A Case Study of Resettable Bistable Cellular Responses

A focused theme in systems biology is to uncover design principles of biological networks, that is, how specific network structures yield specific systems properties. For this purpose, we have previously developed a reverse engineering procedure to identify network topologies with high likelihood in generating desired systems properties. Our method searches the continuous parameter space of an assembly of network topologies, without enumerating individual network topologies separately as traditionally done in other reverse engineering procedures. Here we tested this CPSS (continuous parameter space search) method on a previously studied problem: the resettable bistability of an Rb-E2F gene network in regulating the quiescence-to-proliferation transition of mammalian cells. From a simplified Rb-E2F gene network, we identified network topologies responsible for generating resettable bistability. The CPSS-identified topologies are consistent with those reported in the previous study based on individual topology search (ITS), demonstrating the effectiveness of the CPSS approach. Since the CPSS and ITS searches are based on different mathematical formulations and different algorithms, the consistency of the results also helps cross-validate both approaches. A unique advantage of the CPSS approach lies in its applicability to biological networks with large numbers of nodes. To aid the application of the CPSS approach to the study of other biological systems, we have developed a computer package that is available in Information S1.     

Toward scalable parts families for predictable design of biological circuits

Our current ability to engineer biological circuits is hindered by design cycles that are costly in terms of time and money, with constructs failing to operate as desired, or evolving away from the desired function once deployed. Synthetic biologists seek to understand biological design principles and use them to create technologies that increase the efficiency of the genetic engineering design cycle. Central to the approach is the creation of biological parts--encapsulated functions that can be composited together to create new pathways with predictable behaviors. We define five desirable characteristics of biological parts--independence, reliability, tunability, orthogonality and composability, and review studies of small natural and synthetic biological circuits that provide insights into each of these characteristics. We propose that the creation of appropriate sets of families of parts with these properties is a prerequisite for efficient, predictable engineering of new function in cells and will enable a large increase in the sophistication of genetic engineering applications.     

Automatic design of digital synthetic gene circuits

De novo computational design of synthetic gene circuits that achieve well-defined target functions is a hard task. Existing, brute-force approaches run optimization algorithms on the structure and on the kinetic parameter values of the network. However, more direct rational methods for automatic circuit design are lacking. Focusing on digital synthetic gene circuits, we developed a methodology and a corresponding tool for in silico automatic design. For a given truth table that specifies a circuit's input-output relations, our algorithm generates and ranks several possible circuit schemes without the need for any optimization. Logic behavior is reproduced by the action of regulatory factors and chemicals on the promoters and on the ribosome binding sites of biological Boolean gates. Simulations of circuits with up to four inputs show a faithful and unequivocal truth table representation, even under parametric perturbations and stochastic noise. A comparison with already implemented circuits, in addition, reveals the potential for simpler designs with the same function. Therefore, we expect the method to help both in devising new circuits and in simplifying existing solutions.     

Design,Surface Treatment,Cellular Plating,and Culturing of Modular Neuronal Networks Composed of Functionally Inter-connected Circuits

The brain operates through the coordinated activation and the dynamic communication of neuronal assemblies. A major open question is how a vast repertoire of dynamical motifs, which underlie most diverse brain functions, can emerge out of a fixed topological and modular organization of brain circuits. Compared to in vivo studies of neuronal circuits which present intrinsic experimental difficulties, in vitro preparations offer a much larger possibility to manipulate and probe the structural, dynamical and chemical properties of experimental neuronal systems. This work describes an in vitro experimental methodology which allows growing of modular networks composed by spatially distinct, functionally interconnected neuronal assemblies. The protocol allows controlling the two-dimensional (2D) architecture of the neuronal network at different levels of topological complexity.A desired network patterning can be achieved both on regular cover slips and substrate embedded micro electrode arrays. Micromachined structures are embossed on a silicon wafer and used to create biocompatible polymeric stencils, which incorporate the negative features of the desired network architecture. The stencils are placed on the culturing substrates during the surface coating procedure with a molecular layer for promoting cellular adhesion. After removal of the stencils, neurons are plated and they spontaneously redirected to the coated areas. By decreasing the inter-compartment distance, it is possible to obtain either isolated or interconnected neuronal circuits. To promote cell survival, cells are co-cultured with a supporting neuronal network which is located at the periphery of the culture dish. Electrophysiological and optical recordings of the activity of modular networks obtained respectively by using substrate embedded micro electrode arrays and calcium imaging are presented. While each module shows spontaneous global synchronizations, the occurrence of inter-module synchronization is regulated by the density of connection among the circuits.     

Light-controlled synthetic gene circuits

Highly complex synthetic gene circuits have been engineered in living organisms to develop systems with new biological properties. A precise trigger to activate or deactivate these complex systems is desired in order to tightly control different parts of a synthetic or natural network. Light represents an excellent tool to achieve this goal as it can be regulated in timing, location, intensity, and wavelength, which allows for precise spatiotemporal control over genetic circuits. Recently, light has been used as a trigger to control the biological function of small molecules, oligonucleotides, and proteins involved as parts in gene circuits. Light activation has enabled the construction of unique systems in living organisms such as band-pass filters and edge-detectors in bacterial cells. Additionally, light also allows for the regulation of intermediate steps of complex dynamic pathways in mammalian cells such as those involved in kinase networks. Herein we describe recent advancements in the area of light-controlled synthetic networks.     

合成基因线路规模化设计面临的挑战

随着合成基因线路规模的增加,传统的合成基因线路设计思路的瓶颈逐渐凸显,许多之前被忽略的因素对大规模基因线路的性能可能造成显著影响,这对合成基因线路的设计带来了新的挑战。本文重点梳理了基因表达噪声和竞争效应两方面对基因线路性能的影响,阐释了二者间的紧密联系,并基于理性设计的思路,从模拟-数字运算设计、网络拓扑设计、基因线路中的信息传递理论和动态信号等方面,归纳总结了解决这些问题的潜在方案,并展望了规模化合成基因线路理性设计的未来发展方向。     

Training Excitatory-Inhibitory Recurrent Neural Networks for Cognitive Tasks: A Simple and Flexible Framework

The ability to simultaneously record from large numbers of neurons in behaving animals has ushered in a new era for the study of the neural circuit mechanisms underlying cognitive functions. One promising approach to uncovering the dynamical and computational principles governing population responses is to analyze model recurrent neural networks (RNNs) that have been optimized to perform the same tasks as behaving animals. Because the optimization of network parameters specifies the desired output but not the manner in which to achieve this output, “trained” networks serve as a source of mechanistic hypotheses and a testing ground for data analyses that link neural computation to behavior. Complete access to the activity and connectivity of the circuit, and the ability to manipulate them arbitrarily, make trained networks a convenient proxy for biological circuits and a valuable platform for theoretical investigation. However, existing RNNs lack basic biological features such as the distinction between excitatory and inhibitory units (Dale’s principle), which are essential if RNNs are to provide insights into the operation of biological circuits. Moreover, trained networks can achieve the same behavioral performance but differ substantially in their structure and dynamics, highlighting the need for a simple and flexible framework for the exploratory training of RNNs. Here, we describe a framework for gradient descent-based training of excitatory-inhibitory RNNs that can incorporate a variety of biological knowledge. We provide an implementation based on the machine learning library Theano, whose automatic differentiation capabilities facilitate modifications and extensions. We validate this framework by applying it to well-known experimental paradigms such as perceptual decision-making, context-dependent integration, multisensory integration, parametric working memory, and motor sequence generation. Our results demonstrate the wide range of neural activity patterns and behavior that can be modeled, and suggest a unified setting in which diverse cognitive computations and mechanisms can be studied.     

Do motifs reflect evolved function?--No convergent evolution of genetic regulatory network subgraph topologies

Methods that analyse the topological structure of networks have recently become quite popular. Whether motifs (subgraph patterns that occur more often than in randomized networks) have specific functions as elementary computational circuits has been cause for debate. As the question is difficult to resolve with currently available biological data, we approach the issue using networks that abstractly model natural genetic regulatory networks (GRNs) which are evolved to show dynamical behaviors. Specifically one group of networks was evolved to be capable of exhibiting two different behaviors ("differentiation") in contrast to a group with a single target behavior. In both groups we find motif distribution differences within the groups to be larger than differences between them, indicating that evolutionary niches (target functions) do not necessarily mold network structure uniquely. These results show that variability operators can have a stronger influence on network topologies than selection pressures, especially when many topologies can create similar dynamics. Moreover, analysis of motif functional relevance by lesioning did not suggest that motifs were of greater importance to the functioning of the network than arbitrary subgraph patterns. Only when drastically restricting network size, so that one motif corresponds to a whole functionally evolved network, was preference for particular connection patterns found. This suggests that in non-restricted, bigger networks, entanglement with the rest of the network hinders topological subgraph analysis.     

An Atlas of Network Topologies Reveals Design Principles for Caenorhabditis elegans Vulval Precursor Cell Fate Patterning

The vulval precursor cell (VPC) fate patterning in Caenorhabditis elegans is a classic model experimental system for cell fate determination and patterning in development. Despite its apparent simplicity (six neighboring cells arranged in one dimension) and many experimental and computational efforts, the patterning strategy and mechanism remain controversial due to incomplete knowledge of the complex biology. Here, we carry out a comprehensive computational analysis and obtain a reservoir of all possible network topologies that are capable of VPC fate patterning under the simulation of various biological environments and regulatory rules. We identify three patterning strategies: sequential induction, morphogen gradient and lateral antagonism, depending on the features of the signal secreted from the anchor cell. The strategy of lateral antagonism, which has not been reported in previous studies of VPC patterning, employs a mutual inhibition of the 2° cell fate in neighboring cells. Robust topologies are built upon minimal topologies with basic patterning strategies and have more flexible and redundant implementations of modular functions. By simulated mutation, we find that all three strategies can reproduce experimental error patterns of mutants. We show that the topology derived by mapping currently known biochemical pathways to our model matches one of our identified functional topologies. Furthermore, our robustness analysis predicts a possible missing link related to the lateral antagonism strategy. Overall, we provide a theoretical atlas of all possible functional networks in varying environments, which may guide novel discoveries of the biological interactions in vulval development of Caenorhabditis elegans and related species.     

Hub-centered gene network reconstruction using automatic relevance determination

Network inference deals with the reconstruction of biological networks from experimental data. A variety of different reverse engineering techniques are available; they differ in the underlying assumptions and mathematical models used. One common problem for all approaches stems from the complexity of the task, due to the combinatorial explosion of different network topologies for increasing network size. To handle this problem, constraints are frequently used, for example on the node degree, number of edges, or constraints on regulation functions between network components. We propose to exploit topological considerations in the inference of gene regulatory networks. Such systems are often controlled by a small number of hub genes, while most other genes have only limited influence on the network's dynamic. We model gene regulation using a Bayesian network with discrete, Boolean nodes. A hierarchical prior is employed to identify hub genes. The first layer of the prior is used to regularize weights on edges emanating from one specific node. A second prior on hyperparameters controls the magnitude of the former regularization for different nodes. The net effect is that central nodes tend to form in reconstructed networks. Network reconstruction is then performed by maximization of or sampling from the posterior distribution. We evaluate our approach on simulated and real experimental data, indicating that we can reconstruct main regulatory interactions from the data. We furthermore compare our approach to other state-of-the art methods, showing superior performance in identifying hubs. Using a large publicly available dataset of over 800 cell cycle regulated genes, we are able to identify several main hub genes. Our method may thus provide a valuable tool to identify interesting candidate genes for further study. Furthermore, the approach presented may stimulate further developments in regularization methods for network reconstruction from data.     

On the long-run sensitivity of probabilistic Boolean networks

Boolean networks and, more generally, probabilistic Boolean networks, as one class of gene regulatory networks, model biological processes with the network dynamics determined by the logic-rule regulatory functions in conjunction with probabilistic parameters involved in network transitions. While there has been significant research on applying different control policies to alter network dynamics as future gene therapeutic intervention, we have seen less work on understanding the sensitivity of network dynamics with respect to perturbations to networks, including regulatory rules and the involved parameters, which is particularly critical for the design of intervention strategies. This paper studies this less investigated issue of network sensitivity in the long run. As the underlying model of probabilistic Boolean networks is a finite Markov chain, we define the network sensitivity based on the steady-state distributions of probabilistic Boolean networks and call it long-run sensitivity. The steady-state distribution reflects the long-run behavior of the network and it can give insight into the dynamics or momentum existing in a system. The change of steady-state distribution caused by possible perturbations is the key measure for intervention. This newly defined long-run sensitivity can provide insight on both network inference and intervention. We show the results for probabilistic Boolean networks generated from random Boolean networks and the results from two real biological networks illustrate preliminary applications of sensitivity in intervention for practical problems.     

Counting motifs in dynamic networks

Background

A network motif is a sub-network that occurs frequently in a given network. Detection of such motifs is important since they uncover functions and local properties of the given biological network. Finding motifs is however a computationally challenging task as it requires solving the costly subgraph isomorphism problem. Moreover, the topology of biological networks change over time. These changing networks are called dynamic biological networks. As the network evolves, frequency of each motif in the network also changes. Computing the frequency of a given motif from scratch in a dynamic network as the network topology evolves is infeasible, particularly for large and fast evolving networks.

Results

In this article, we design and develop a scalable method for counting the number of motifs in a dynamic biological network. Our method incrementally updates the frequency of each motif as the underlying network’s topology evolves. Our experiments demonstrate that our method can update the frequency of each motif in orders of magnitude faster than counting the motif embeddings every time the network changes. If the network evolves more frequently, the margin with which our method outperforms the existing static methods, increases.

Conclusions

We evaluated our method extensively using synthetic and real datasets, and show that our method is highly accurate(≥?96%) and that it can be scaled to large dense networks. The results on real data demonstrate the utility of our method in revealing interesting insights on the evolution of biological processes.

     

Robust model matching design methodology for a stochastic synthetic gene network

Synthetic biology has shown its potential and promising applications in the last decade. However, many synthetic gene networks cannot work properly and maintain their desired behaviors due to intrinsic parameter variations and extrinsic disturbances. In this study, the intrinsic parameter uncertainties and external disturbances are modeled in a non-linear stochastic gene network to mimic the real environment in the host cell. Then a non-linear stochastic robust matching design methodology is introduced to withstand the intrinsic parameter fluctuations and to attenuate the extrinsic disturbances in order to achieve a desired reference matching purpose. To avoid solving the Hamilton-Jacobi inequality (HJI) in the non-linear stochastic robust matching design, global linearization technique is used to simplify the design procedure by solving a set of linear matrix inequalities (LMIs). As a result, the proposed matching design methodology of the robust synthetic gene network can be efficiently designed with the help of LMI toolbox in Matlab. Finally, two in silico design examples of the robust synthetic gene network are given to illustrate the design procedure and to confirm the robust model matching performance to achieve the desired behavior in spite of stochastic parameter fluctuations and environmental disturbances in the host cell.     

Scalable optimal Bayesian classification of single-cell trajectories under regulatory model uncertainty

Background

Biological networks describes the mechanisms which govern cellular functions. Temporal networks show how these networks evolve over time. Studying the temporal progression of network topologies is of utmost importance since it uncovers how a network evolves and how it resists to external stimuli and internal variations. Two temporal networks have co-evolving subnetworks if the evolving topologies of these subnetworks remain similar to each other as the network topology evolves over a period of time. In this paper, we consider the problem of identifying co-evolving subnetworks given a pair of temporal networks, which aim to capture the evolution of molecules and their interactions over time. Although this problem shares some characteristics of the well-known network alignment problems, it differs from existing network alignment formulations as it seeks a mapping of the two network topologies that is invariant to temporal evolution of the given networks. This is a computationally challenging problem as it requires capturing not only similar topologies between two networks but also their similar evolution patterns.

Results

We present an efficient algorithm, Tempo, for solving identifying co-evolving subnetworks with two given temporal networks. We formally prove the correctness of our method. We experimentally demonstrate that Tempo scales efficiently with the size of network as well as the number of time points, and generates statistically significant alignments—even when evolution rates of given networks are high. Our results on a human aging dataset demonstrate that Tempo identifies novel genes contributing to the progression of Alzheimer’s, Huntington’s and Type II diabetes, while existing methods fail to do so.

Conclusions

Studying temporal networks in general and human aging specifically using Tempo enables us to identify age related genes from non age related genes successfully. More importantly, Tempo takes the network alignment problem one huge step forward by moving beyond the classical static network models.