De Novo Evolution of Complex, Global and Hierarchical Gene Regulatory Mechanisms

Gene regulatory networks exhibit complex, hierarchical features such as global regulation and network motifs. There is much debate about whether the evolutionary origins of such features are the results of adaptation, or the by-products of non-adaptive processes of DNA replication. The lack of availability of gene regulatory networks of ancestor species on evolutionary timescales makes this a particularly difficult problem to resolve. Digital organisms, however, can be used to provide a complete evolutionary record of lineages. We use a biologically realistic evolutionary model that includes gene expression, regulation, metabolism and biosynthesis, to investigate the evolution of complex function in gene regulatory networks. We discover that: (i) network architecture and complexity evolve in response to environmental complexity, (ii) global gene regulation is selected for in complex environments, (iii) complex, inter-connected, hierarchical structures evolve in stages, with energy regulation preceding stress responses, and stress responses preceding growth rate adaptations and (iv) robustness of evolved models to mutations depends on hierarchical level: energy regulation and stress responses tend not to be robust to mutations, whereas growth rate adaptations are more robust and non-lethal when mutated. These results highlight the adaptive and incremental evolution of complex biological networks, and the value and potential of studying realistic in silico evolutionary systems as a way of understanding living systems.     

Evolution of networks for body plan patterning; interplay of modularity, robustness and evolvability

A major goal of evolutionary developmental biology (evo-devo) is to understand how multicellular body plans of increasing complexity have evolved, and how the corresponding developmental programs are genetically encoded. It has been repeatedly argued that key to the evolution of increased body plan complexity is the modularity of the underlying developmental gene regulatory networks (GRNs). This modularity is considered essential for network robustness and evolvability. In our opinion, these ideas, appealing as they may sound, have not been sufficiently tested. Here we use computer simulations to study the evolution of GRNs' underlying body plan patterning. We select for body plan segmentation and differentiation, as these are considered to be major innovations in metazoan evolution. To allow modular networks to evolve, we independently select for segmentation and differentiation. We study both the occurrence and relation of robustness, evolvability and modularity of evolved networks. Interestingly, we observed two distinct evolutionary strategies to evolve a segmented, differentiated body plan. In the first strategy, first segments and then differentiation domains evolve (SF strategy). In the second scenario segments and domains evolve simultaneously (SS strategy). We demonstrate that under indirect selection for robustness the SF strategy becomes dominant. In addition, as a byproduct of this larger robustness, the SF strategy is also more evolvable. Finally, using a combined functional and architectural approach, we determine network modularity. We find that while SS networks generate segments and domains in an integrated manner, SF networks use largely independent modules to produce segments and domains. Surprisingly, we find that widely used, purely architectural methods for determining network modularity completely fail to establish this higher modularity of SF networks. Finally, we observe that, as a free side effect of evolving segmentation and differentiation in combination, we obtained in-silico developmental mechanisms resembling mechanisms used in vertebrate development.     

Reverse Engineering Boolean Networks: From Bernoulli Mixture Models to Rule Based Systems

A Boolean network is a graphical model for representing and analyzing the behavior of gene regulatory networks (GRN). In this context, the accurate and efficient reconstruction of a Boolean network is essential for understanding the gene regulation mechanism and the complex relations that exist therein. In this paper we introduce an elegant and efficient algorithm for the reverse engineering of Boolean networks from a time series of multivariate binary data corresponding to gene expression data. We call our method ReBMM, i.e., reverse engineering based on Bernoulli mixture models. The time complexity of most of the existing reverse engineering techniques is quite high and depends upon the indegree of a node in the network. Due to the high complexity of these methods, they can only be applied to sparsely connected networks of small sizes. ReBMM has a time complexity factor, which is independent of the indegree of a node and is quadratic in the number of nodes in the network, a big improvement over other techniques and yet there is little or no compromise in accuracy. We have tested ReBMM on a number of artificial datasets along with simulated data derived from a plant signaling network. We also used this method to reconstruct a network from real experimental observations of microarray data of the yeast cell cycle. Our method provides a natural framework for generating rules from a probabilistic model. It is simple, intuitive and illustrates excellent empirical results.     

Chaotic gene regulatory networks can be robust against mutations and noise

Robustness to mutations and noise has been shown to evolve through stabilizing selection for optimal phenotypes in model gene regulatory networks. The ability to evolve robust mutants is known to depend on the network architecture. How do the dynamical properties and state-space structures of networks with high and low robustness differ? Does selection operate on the global dynamical behavior of the networks? What kind of state-space structures are favored by selection? We provide damage propagation analysis and an extensive statistical analysis of state spaces of these model networks to show that the change in their dynamical properties due to stabilizing selection for optimal phenotypes is minor. Most notably, the networks that are most robust to both mutations and noise are highly chaotic. Certain properties of chaotic networks, such as being able to produce large attractor basins, can be useful for maintaining a stable gene-expression pattern. Our findings indicate that conventional measures of stability, such as damage propagation, do not provide much information about robustness to mutations or noise in model gene regulatory networks.     

The causes of epistasis in genetic networks

Epistasis refers to the nonadditive interactions between genes in determining phenotypes. Considerable efforts have shown that, even for a given organism, epistasis may vary both in intensity and sign. Recent comparative studies supported that the overall sign of epistasis switches from positive to negative as the complexity of an organism increases, and it has been hypothesized that this change shall be a consequence of the underlying gene network properties. Why should this be the case? What characteristics of genetic networks determine the sign of epistasis? Here we show, by evolving genetic networks that differ in their complexity and robustness against perturbations but that perform the same tasks, that robustness increased with complexity and that epistasis was positive for small nonrobust networks but negative for large robust ones. Our results indicate that robustness and negative epistasis emerge as a consequence of the existence of redundant elements in regulatory structures of genetic networks and that the correlation between complexity and epistasis is a byproduct of such redundancy, allowing for the decoupling of epistasis from the underlying network complexity.     

Robustness and evolvability in genetic regulatory networks

Living organisms are robust to a great variety of genetic changes. Gene regulation networks and metabolic pathways self-organize and reaccommodate to make the organism perform with stability and reliability under many point mutations, gene duplications and gene deletions. At the same time, living organisms are evolvable, which means that these kind of genetic perturbations can eventually make the organism acquire new functions and adapt to new environments. It is still an open problem to determine how robustness and evolvability blend together at the genetic level to produce stable organisms that yet can change and evolve. Here we address this problem by studying the robustness and evolvability of the attractor landscape of genetic regulatory network models under the process of gene duplication followed by divergence. We show that an intrinsic property of this kind of networks is that, after the divergence of the parent and duplicate genes, with a high probability the previous phenotypes, encoded in the attractor landscape of the network, are preserved and new ones might appear. The above is true in a variety of network topologies and even for the case of extreme divergence in which the duplicate gene bears almost no relation with its parent. Our results indicate that networks operating close to the so-called "critical regime" exhibit the maximum robustness and evolvability simultaneously.     

An Adaptive Complex Network Model for Brain Functional Networks

Brain functional networks are graph representations of activity in the brain, where the vertices represent anatomical regions and the edges their functional connectivity. These networks present a robust small world topological structure, characterized by highly integrated modules connected sparsely by long range links. Recent studies showed that other topological properties such as the degree distribution and the presence (or absence) of a hierarchical structure are not robust, and show different intriguing behaviors. In order to understand the basic ingredients necessary for the emergence of these complex network structures we present an adaptive complex network model for human brain functional networks. The microscopic units of the model are dynamical nodes that represent active regions of the brain, whose interaction gives rise to complex network structures. The links between the nodes are chosen following an adaptive algorithm that establishes connections between dynamical elements with similar internal states. We show that the model is able to describe topological characteristics of human brain networks obtained from functional magnetic resonance imaging studies. In particular, when the dynamical rules of the model allow for integrated processing over the entire network scale-free non-hierarchical networks with well defined communities emerge. On the other hand, when the dynamical rules restrict the information to a local neighborhood, communities cluster together into larger ones, giving rise to a hierarchical structure, with a truncated power law degree distribution.     

Using species co‐occurrence networks to assess the impacts of climate change

Viable populations of species occur in a given place if three conditions are met: the environment at the place is suitable; the species is able to colonize it; co‐occurrence is possible despite or because of interactions with other species. Studies investigating the effects of climate change on species have mainly focused on measuring changes in climate suitability. Complex interactions among species have rarely been explored in such studies. We extend network theory to the analysis of complex patterns of co‐occurrence among species. The framework is used to explore the robustness of networks under climate change. With our data, we show that networks describing the geographic pattern of co‐occurrence among species display properties shared by other complex networks, namely that most species are poorly connected to other species in the network and only a few are highly connected. In our example, species more exposed to climate change tended to be poorly connected to other species within the network, while species more connected tended to be less exposed. Such high connectance would make the co‐occurrence networks more robust to climate change. The proposed framework illustrates how network analysis could be used, together with co‐occurrence data, to help addressing the potential consequences of species interactions in studies of climate change and biodiversity. However, more research is needed to test for links between co‐occurrence and network interactions.     

Evolving Robust Gene Regulatory Networks

Design and implementation of robust network modules is essential for construction of complex biological systems through hierarchical assembly of ‘parts’ and ‘devices’. The robustness of gene regulatory networks (GRNs) is ascribed chiefly to the underlying topology. The automatic designing capability of GRN topology that can exhibit robust behavior can dramatically change the current practice in synthetic biology. A recent study shows that Darwinian evolution can gradually develop higher topological robustness. Subsequently, this work presents an evolutionary algorithm that simulates natural evolution in silico, for identifying network topologies that are robust to perturbations. We present a Monte Carlo based method for quantifying topological robustness and designed a fitness approximation approach for efficient calculation of topological robustness which is computationally very intensive. The proposed framework was verified using two classic GRN behaviors: oscillation and bistability, although the framework is generalized for evolving other types of responses. The algorithm identified robust GRN architectures which were verified using different analysis and comparison. Analysis of the results also shed light on the relationship among robustness, cooperativity and complexity. This study also shows that nature has already evolved very robust architectures for its crucial systems; hence simulation of this natural process can be very valuable for designing robust biological systems.     

Parasites lead to evolution of robustness against gene loss in host signaling networks

Many biological networks can maintain their function against single gene loss. However, the evolutionary mechanisms responsible for such robustness remain unclear. Here, we demonstrate that antagonistic host–parasite interactions can act as a selective pressure driving the emergence of robustness against gene loss. Using a model of host signaling networks and simulating their coevolution with parasites that interfere with network function, we find that networks evolve both redundancy and specific architectures that allow them to maintain their response despite removal of proteins. We show that when the parasite pressure is removed, subsequent evolution can lead to loss of redundancy while architecture‐based robustness is retained. Contrary to intuition, increased parasite virulence hampers evolution of robustness by limiting the generation of population level diversity in the host. However, when robustness emerges under high virulence, it tends to be stronger. These findings predict an increased presence of robustness mechanisms in biological networks operating under parasite interference. Conversely, the presence of such mechanisms could indicate current or past parasite interference.     

Wagner's canalization model

Wagner (1996, Does evolutionary plasticity evolve? Evolution 50, 1008-1023.) and Siegal and Bergman, 2002 and Azevedo et al., 2006 have studied a simple model of the evolution of a network of N genes, in order to explain the observed phenomenon that systems evolve to be robust. These authors primarily considered the case N=10 and used simulations to reach their conclusions. Here we investigate this model in more detail, considering systems of different sizes with and without recombination, and with selection for convergence instead of to a specified limit. For the simpler evolutionary model lacking recombination, we analyze the system as a neutral network. This allows us to describe the equilibrium distribution networks within genotype space. Our results show that, given a sufficiently large population size, the qualitative observation that systems evolve to be robust, is itself robust, as it does not depend on the details of the model. In simple terms, robust systems have more viable offspring, so the evolution of robustness is merely selection for increased fecundity, an observation that is well known in the theory of neutral networks.     

Evolution of complex modular biological networks

Biological networks have evolved to be highly functional within uncertain environments while remaining extremely adaptable. One of the main contributors to the robustness and evolvability of biological networks is believed to be their modularity of function, with modules defined as sets of genes that are strongly interconnected but whose function is separable from those of other modules. Here, we investigate the in silico evolution of modularity and robustness in complex artificial metabolic networks that encode an increasing amount of information about their environment while acquiring ubiquitous features of biological, social, and engineering networks, such as scale-free edge distribution, small-world property, and fault-tolerance. These networks evolve in environments that differ in their predictability, and allow us to study modularity from topological, information-theoretic, and gene-epistatic points of view using new tools that do not depend on any preconceived notion of modularity. We find that for our evolved complex networks as well as for the yeast protein–protein interaction network, synthetic lethal gene pairs consist mostly of redundant genes that lie close to each other and therefore within modules, while knockdown suppressor gene pairs are farther apart and often straddle modules, suggesting that knockdown rescue is mediated by alternative pathways or modules. The combination of network modularity tools together with genetic interaction data constitutes a powerful approach to study and dissect the role of modularity in the evolution and function of biological networks.     

Massive-Scale Gene Co-Expression Network Construction and Robustness Testing Using Random Matrix Theory

The study of gene relationships and their effect on biological function and phenotype is a focal point in systems biology. Gene co-expression networks built using microarray expression profiles are one technique for discovering and interpreting gene relationships. A knowledge-independent thresholding technique, such as Random Matrix Theory (RMT), is useful for identifying meaningful relationships. Highly connected genes in the thresholded network are then grouped into modules that provide insight into their collective functionality. While it has been shown that co-expression networks are biologically relevant, it has not been determined to what extent any given network is functionally robust given perturbations in the input sample set. For such a test, hundreds of networks are needed and hence a tool to rapidly construct these networks. To examine functional robustness of networks with varying input, we enhanced an existing RMT implementation for improved scalability and tested functional robustness of human (Homo sapiens), rice (Oryza sativa) and budding yeast (Saccharomyces cerevisiae). We demonstrate dramatic decrease in network construction time and computational requirements and show that despite some variation in global properties between networks, functional similarity remains high. Moreover, the biological function captured by co-expression networks thresholded by RMT is highly robust.     

Geometric robustness theory and biological networks

We provide a geometric framework for investigating the robustness of information flows over biological networks. We use information measures to quantify the impact of knockout perturbations on simple networks. Robustness has two components, a measure of the causal contribution of a node or nodes, and a measure of the change or exclusion dependence, of the network following node removal. Causality is measured as statistical contribution of a node to network function, wheras exclusion dependence measures a distance between unperturbed network and reconfigured network function. We explore the role that redundancy plays in increasing robustness, and how redundacy can be exploited through error-correcting codes implemented by networks. We provide examples of the robustness measure when applied to familiar boolean functions such as the AND, OR and XOR functions. We discuss the relationship between robustness measures and related measures of complexity and how robustness always implies a minimal level of complexity.     

Translational regulation of ribosomal protein S15 drives characteristic patterns of protein‐mRNA epistasis

Do coding and regulatory segments of a gene co‐evolve with each‐other? Seeking answers to this question, here we analyze the case of Escherichia coli ribosomal protein S15, that represses its own translation by specifically binding its messenger RNA (rpsO mRNA) and stabilizing a pseudoknot structure at the upstream untranslated region, thus trapping the ribosome into an incomplete translation initiation complex. In the absence of S15, ribosomal protein S1 recognizes rpsO and promotes translation by melting this very pseudoknot. We employ a robust statistical method to detect signatures of positive epistasis between residue site pairs and find that biophysical constraints of translational regulation (S15‐rpsO and S1‐rpsO recognition, S15‐mediated rpsO structural rearrangement, and S1‐mediated melting) are strong predictors of positive epistasis. Transforming the epistatic pairs into a network, we find that signatures of two different, but interconnected regulatory cascades are imprinted in the sequence‐space and can be captured in terms of two dense network modules that are sparsely connected to each other. This network topology further reflects a general principle of how functionally coupled components of biological networks are interconnected. These results depict a model case, where translational regulation drives characteristic residue‐level epistasis—not only between a protein and its own mRNA but also between a protein and the mRNA of an entirely different protein.     

Robustness in phenotypic plasticity and heterogeneity patterns enabled by EMT networks

Epithelial-mesenchymal plasticity (EMP) is a key arm of cancer metastasis and is observed across many contexts. Cells undergoing EMP can reversibly switch between three classes of phenotypes: epithelial (E), mesenchymal (M), and hybrid E/M. While a large number of multistable regulatory networks have been identified to be driving EMP in various contexts, the exact mechanisms and design principles that enable robustness in driving EMP across contexts are not yet fully understood. Here, we investigated dynamic and structural robustness in EMP networks with regard to phenotypic heterogeneity and plasticity. We use two different approaches to simulate these networks: a computationally inexpensive, parameter-independent continuous state space Boolean model, and an ODE-based parameter-agnostic framework (RACIPE), both of which yielded similar phenotypic distributions. While the latter approach is useful for measurements of plasticity, the former model enabled us to extensively investigate robustness in phenotypic heterogeneity. Using perturbations to network topology and by varying network parameters, we show that multistable EMP networks are structurally and dynamically more robust compared with their randomized counterparts, thereby highlighting their topological hallmarks. These features of robustness are governed by a balance of positive and negative feedback loops embedded in these networks. Using a combination of the number of negative and positive feedback loops weighted by their lengths, we identified a metric that can explain the structural and dynamical robustness of these networks. This metric enabled us to compare networks across multiple sizes, and the network principles thus obtained can be used to identify fragilities in large networks without simulating their dynamics. Our analysis highlights a network topology-based approach to quantify robustness in the phenotypic heterogeneity and plasticity emergent from EMP networks.     

Dynamic-module redundancy confers robustness to the gene regulatory network involved in hair patterning of Arabidopsis epidermis

Redundancy among dynamic modules is emerging as a potentially generic trait in gene regulatory networks. Moreover, module redundancy could play an important role in network robustness to perturbations. We explored the effect of dynamic-module redundancy in the networks associated to hair patterning in Arabidopsis root and leaf epidermis. Recent studies have put forward several dynamic modules belonging to these networks. We defined these modules in a discrete dynamical framework that was previously reported. Then, we addressed whether these modules are sufficient or necessary for recovering epidermal cell types and patterning. After defining two quantitative estimates of the system's robustness, we also compared the robustness of each separate module with that of a network coupling all the leaf or root modules. We found that, considering certain assumptions, all the dynamic modules proposed so far are sufficient on their own for pattern formation, but reinforce each other during epidermal development. Furthermore, we found that networks of coupled modules are more robust to perturbations than single modules. These results suggest that dynamic-module redundancy might be an important trait in gene regulatory networks and point at central questions regarding network evolution, module coupling, pattern robustness and the evolution of development.     

Robustness and state-space structure of Boolean gene regulatory models

Robustness to perturbation is an important characteristic of genetic regulatory systems, but the relationship between robustness and model dynamics has not been clearly quantified. We propose a method for quantifying both robustness and dynamics in terms of state-space structures, for Boolean models of genetic regulatory systems. By investigating existing models of the Drosophila melanogaster segment polarity network and the Saccharomyces cerevisiae cell-cycle network, we show that the structure of attractor basins can yield insight into the underlying decision making required of the system, and also the way in which the system maximises its robustness. In particular, gene networks implementing decisions based on a few genes have simple state-space structures, and their attractors are robust by virtue of their simplicity. Gene networks with decisions that involve many interacting genes have correspondingly more complicated state-space structures, and robustness cannot be achieved through the structure of the attractor basins, but is achieved by larger attractor basins that dominate the state space. These different types of robustness are demonstrated by the two models: the D. melanogaster segment polarity network is robust due to simple attractor basins that implement decisions based on spatial signals; the S. cerevisiae cell-cycle network has a complicated state-space structure, and is robust only due to a giant attractor basin that dominates the state space.