Canalization and control in automata networks: body segmentation in Drosophila melanogaster

Evolving higher-order synergies reveals a trade-off between stability and information-integration capacity in complex systems

There has recently been an explosion of interest in how "higher-order" structures emerge in complex systems comprised of many interacting elements (often called "synergistic" information). This "emergent" organization has been found in a variety of natural and artificial systems, although at present, the field lacks a unified understanding of what the consequences of higher-order synergies and redundancies are for systems under study. Typical research treats the presence (or absence) of synergistic information as a dependent variable and report changes in the level of synergy in response to some change in the system. Here, we attempt to flip the script: rather than treating higher-order information as a dependent variable, we use evolutionary optimization to evolve boolean networks with significant higher-order redundancies, synergies, or statistical complexity. We then analyze these evolved populations of networks using established tools for characterizing discrete dynamics: the number of attractors, the average transient length, and the Derrida coefficient. We also assess the capacity of the systems to integrate information. We find that high-synergy systems are unstable and chaotic, but with a high capacity to integrate information. In contrast, evolved redundant systems are extremely stable, but have negligible capacity to integrate information. Finally, the complex systems that balance integration and segregation (known as Tononi-Sporns-Edelman complexity) show features of both chaosticity and stability, with a greater capacity to integrate information than the redundant systems while being more stable than the random and synergistic systems. We conclude that there may be a fundamental trade-off between the robustness of a system's dynamics and its capacity to integrate information (which inherently requires flexibility and sensitivity) and that certain kinds of complexity naturally balance this trade-off.

Preponderance of generalized chain functions in reconstructed Boolean models of biological networks

Boolean networks (BNs) have been extensively used to model gene regulatory networks (GRNs). The dynamics of BNs depend on the network architecture and regulatory logic rules (Boolean functions (BFs)) associated with nodes. Nested canalyzing functions (NCFs) have been shown to be enriched among the BFs in the large-scale studies of reconstructed Boolean models. The central question we address here is whether that enrichment is due to certain sub-types of NCFs. We build on one sub-type of NCFs, the chain functions (or chain-0 functions) proposed by Gat-Viks and Shamir. First, we propose two other sub-types of NCFs, namely, the class of chain-1 functions and generalized chain functions, the union of the chain-0 and chain-1 types. Next, we find that the fraction of NCFs that are chain-0 (also holds for chain-1) functions decreases exponentially with the number of inputs. We provide analytical treatment for this and other observations on BFs. Then, by analyzing three different datasets of reconstructed Boolean models we find that generalized chain functions are significantly enriched within the NCFs. Lastly we illustrate that upon imposing the constraints of generalized chain functions on three different GRNs we are able to obtain biologically viable Boolean models.

Embryos assist morphogenesis of others through calcium and ATP signaling mechanisms in collective teratogen resistance

Information for organismal patterning can come from a variety of sources. We investigate the possibility that instructive influences for normal embryonic development are provided not only at the level of cells within the embryo, but also via interactions between embryos. To explore this, we challenge groups of embryos with disruptors of normal development while varying group size. Here, we show that Xenopus laevis embryos are much more sensitive to a diverse set of chemical and molecular-biological perturbations when allowed to develop alone or in small groups, than in large groups. Keeping per-embryo exposure constant, we find that increasing the number of exposed embryos in a cohort increases the rate of survival while incidence of defects decreases. This inter-embryo assistance effect is mediated by short-range diffusible signals and involves the P2 ATP receptor. Our data and computational model emphasize that morphogenesis is a collective phenomenon not only at the level of cells, but also of whole bodies, and that cohort size is a crucial variable in studies of ecotoxicology, teratogenesis, and developmental plasticity.

Dynamical methods for target control of biological networks

Estimating the influence that individual nodes have on one another in a Boolean network is essential to predict and control the system's dynamical behaviour, for example, detecting key therapeutic targets to control pathways in models of biological signalling and regulation. Exact estimation is generally not possible due to the fact that the number of configurations that must be considered grows exponentially with the system size. However, approximate, scalable methods exist in the literature. These methods can be divided into two main classes: (i) graph-theoretic methods that rely on representations of Boolean dynamics into static graphs and (ii) mean-field approaches that describe average trajectories of the system but neglect dynamical correlations. Here, we compare systematically the performance of these state-of-the-art methods on a large collection of real-world gene regulatory networks. We find comparable performance across methods. All methods underestimate the ground truth, with mean-field approaches having a better recall but a worse precision than graph-theoretic methods. Computationally speaking, graph-theoretic methods are faster than mean-field ones in sparse networks, but are slower in dense networks. The preference of which method to use, therefore, depends on a network's connectivity and the relative importance of recall versus precision for the specific application at hand.

The nonlinearity of regulation in biological networks

The extent to which the components of a biological system are (non)linearly regulated determines how amenable they are to therapy and control. To better understand this property termed "regulatory nonlinearity", we analyzed a suite of 137 published Boolean network models, containing a variety of complex nonlinear regulatory interactions, using a probabilistic generalization of Boolean logic that George Boole himself had proposed. Leveraging the continuous-nature of this formulation, we used Taylor decomposition to approximate the models with various levels of regulatory nonlinearity. A comparison of the resulting series of approximations of the biological models with appropriate random ensembles revealed that biological regulation tends to be less nonlinear than expected, meaning that higher-order interactions among the regulatory inputs tend to be less pronounced. A further categorical analysis of the biological models revealed that the regulatory nonlinearity of cancer and disease networks could not only be sometimes higher than expected but also be relatively more variable. We show that this variation is caused by differences in the apportioning of information among the various orders of regulatory nonlinearity. Our results suggest that there may have been a weak but discernible selection pressure for biological systems to evolve linear regulation on average, but for certain systems such as cancer, on the other hand, to simultaneously evolve more nonlinear rules.

Effective Connectivity and Bias Entropy Improve Prediction of Dynamical Regime in Automata Networks

Biomolecular network dynamics are thought to operate near the critical boundary between ordered and disordered regimes, where large perturbations to a small set of elements neither die out nor spread on average. A biomolecular automaton (e.g., gene, protein) typically has high regulatory redundancy, where small subsets of regulators determine activation via collective canalization. Previous work has shown that effective connectivity, a measure of collective canalization, leads to improved dynamical regime prediction for homogeneous automata networks. We expand this by (i) studying random Boolean networks (RBNs) with heterogeneous in-degree distributions, (ii) considering additional experimentally validated automata network models of biomolecular processes, and (iii) considering new measures of heterogeneity in automata network logic. We found that effective connectivity improves dynamical regime prediction in the models considered; in RBNs, combining effective connectivity with bias entropy further improves the prediction. Our work yields a new understanding of criticality in biomolecular networks that accounts for collective canalization, redundancy, and heterogeneity in the connectivity and logic of their automata models. The strong link we demonstrate between criticality and regulatory redundancy provides a means to modulate the dynamical regime of biochemical networks.

Contact networks have small metric backbones that maintain community structure and are primary transmission subgraphs

The structure of social networks strongly affects how different phenomena spread in human society, from the transmission of information to the propagation of contagious diseases. It is well-known that heterogeneous connectivity strongly favors spread, but a precise characterization of the redundancy present in social networks and its effect on the robustness of transmission is still lacking. This gap is addressed by the metric backbone, a weight- and connectivity-preserving subgraph that is sufficient to compute all shortest paths of weighted graphs. This subgraph is obtained via algebraically-principled axioms and does not require statistical sampling based on null-models. We show that the metric backbones of nine contact networks obtained from proximity sensors in a variety of social contexts are generally very small, 49% of the original graph for one and ranging from about 6% to 20% for the others. This reflects a surprising amount of redundancy and reveals that shortest paths on these networks are very robust to random attacks and failures. We also show that the metric backbone preserves the full distribution of shortest paths of the original contact networks-which must include the shortest inter- and intra-community distances that define any community structure-and is a primary subgraph for epidemic transmission based on pure diffusion processes. This suggests that the organization of social contact networks is based on large amounts of shortest-path redundancy which shapes epidemic spread in human populations. Thus, the metric backbone is an important subgraph with regard to epidemic spread, the robustness of social networks, and any communication dynamics that depend on complex network shortest paths.

Global stabilizing control of large-scale biomolecular regulatory networks

MOTIVATION

Cellular behavior is determined by complex non-linear interactions between numerous intracellular molecules that are often represented by Boolean network models. To achieve a desired cellular behavior with minimal intervention, we need to identify optimal control targets that can drive heterogeneous cellular states to the desired phenotypic cellular state with minimal node intervention. Previous attempts to realize such global stabilization were based solely on either network structure information or simple linear dynamics. Other attempts based on non-linear dynamics are not scalable.

RESULTS

Here, we investigate the underlying relationship between structurally identified control targets and optimal global stabilizing control targets based on non-linear dynamics. We discovered that optimal global stabilizing control targets can be identified by analyzing the dynamics between structurally identified control targets. Utilizing these findings, we developed a scalable global stabilizing control framework using both structural and dynamic information. Our framework narrows down the search space based on strongly connected components and feedback vertex sets then identifies global stabilizing control targets based on the canalization of Boolean network dynamics. We find that the proposed global stabilizing control is superior with respect to the number of control target nodes, scalability, and computational complexity.

AVAILABILITY AND IMPLEMENTATION

We provide a GitHub repository that contains the DCGS framework written in Python as well as biological random Boolean network datasets (https://github.com/sugyun/DCGS).

SUPPLEMENTARY INFORMATION

Supplementary data are available at Bioinformatics online.

Influence maximization in Boolean networks

The optimization problem aiming at the identification of minimal sets of nodes able to drive the dynamics of Boolean networks toward desired long-term behaviors is central for some applications, as for example the detection of key therapeutic targets to control pathways in models of biological signaling and regulatory networks. Here, we develop a method to solve such an optimization problem taking inspiration from the well-studied problem of influence maximization for spreading processes in social networks. We validate the method on small gene regulatory networks whose dynamical landscapes are known by means of brute-force analysis. We then systematically study a large collection of gene regulatory networks. We find that for about 65% of the analyzed networks, the minimal driver sets contain less than 20% of their nodes.

Identification of dynamic driver sets controlling phenotypical landscapes

Controlling phenotypical landscapes is of vital interest to modern biology. This task becomes highly demanding because cellular decisions involve complex networks engaging in crosstalk interactions. Previous work on control theory indicates that small sets of compounds can control single phenotypes. However, a dynamic approach is missing to determine the drivers of the whole network dynamics. By analyzing 35 biologically motivated Boolean networks, we developed a method to identify small sets of compounds sufficient to decide on the entire phenotypical landscape. These compounds do not strictly prefer highly related compounds and show a smaller impact on the stability of the attractor landscape. The dynamic driver sets include many intervention targets and cellular reprogramming drivers in human networks. Finally, by using a new comprehensive model of colorectal cancer, we provide a complete workflow on how to implement our approach to shift from in silico to in vitro guided experiments.

Proof for Minimum Sensitivity of Nested Canalizing Functions, a Fractal Bound, and Implications for Biology

We prove that nested canalizing functions are the minimum-sensitivity Boolean functions for any activity ratio and we determine the functional form of this boundary which has a nontrivial fractal structure. We further observe that the majority of the gene regulatory functions found in known biological networks (submitted to the Cell Collective database) lie on the line of minimum sensitivity which paradoxically remains largely in the unstable regime. Our results provide a quantitative basis for the argument that an evolutionary preference for nested canalizing functions in gene regulation (e.g., for higher robustness) and for plasticity of gene activity are sufficient for concentration of such systems near the "edge of chaos."

Minimal Developmental Computation: A Causal Network Approach to Understand Morphogenetic Pattern Formation

What information-processing strategies and general principles are sufficient to enable self-organized morphogenesis in embryogenesis and regeneration? We designed and analyzed a minimal model of self-scaling axial patterning consisting of a cellular network that develops activity patterns within implicitly set bounds. The properties of the cells are determined by internal ‘genetic’ networks with an architecture shared across all cells. We used machine-learning to identify models that enable this virtual mini-embryo to pattern a typical axial gradient while simultaneously sensing the set boundaries within which to develop it from homogeneous conditions—a setting that captures the essence of early embryogenesis. Interestingly, the model revealed several features (such as planar polarity and regenerative re-scaling capacity) for which it was not directly selected, showing how these common biological design principles can emerge as a consequence of simple patterning modes. A novel “causal network” analysis of the best model furthermore revealed that the originally symmetric model dynamically integrates into intercellular causal networks characterized by broken-symmetry, long-range influence and modularity, offering an interpretable macroscale-circuit-based explanation for phenotypic patterning. This work shows how computation could occur in biological development and how machine learning approaches can generate hypotheses and deepen our understanding of how featureless tissues might develop sophisticated patterns—an essential step towards predictive control of morphogenesis in regenerative medicine or synthetic bioengineering contexts. The tools developed here also have the potential to benefit machine learning via new forms of backpropagation and by leveraging the novel distributed self-representation mechanisms to improve robustness and generalization.

Effective connectivity determines the critical dynamics of biochemical networks

Living systems comprise interacting biochemical components in very large networks. Given their high connectivity, biochemical dynamics are surprisingly not chaotic but quite robust to perturbations-a feature C.H. Waddington named canalization. Because organisms are also flexible enough to evolve, they arguably operate in a critical dynamical regime between order and chaos. The established theory of criticality is based on networks of interacting automata where Boolean truth values model presence/absence of biochemical molecules. The dynamical regime is predicted using network connectivity and node bias (to be on/off) as tuning parameters. Revising this to account for canalization leads to a significant improvement in dynamical regime prediction. The revision is based on effective connectivity, a measure of dynamical redundancy that buffers automata response to some inputs. In both random and experimentally validated systems biology networks, reducing effective connectivity makes living systems operate in stable or critical regimes even though the structure of their biochemical interaction networks predicts them to be chaotic. This suggests that dynamical redundancy may be naturally selected to maintain living systems near critical dynamics, providing both robustness and evolvability. By identifying how dynamics propagates preferably via effective pathways, our approach helps to identify precise ways to design and control network models of biochemical regulation and signalling.

The effective graph reveals redundancy, canalization, and control pathways in biochemical regulation and signaling

The ability to map causal interactions underlying genetic control and cellular signaling has led to increasingly accurate models of the complex biochemical networks that regulate cellular function. These network models provide deep insights into the organization, dynamics, and function of biochemical systems: for example, by revealing genetic control pathways involved in disease. However, the traditional representation of biochemical networks as binary interaction graphs fails to accurately represent an important dynamical feature of these multivariate systems: some pathways propagate control signals much more effectively than do others. Such heterogeneity of interactions reflects canalization-the system is robust to dynamical interventions in redundant pathways but responsive to interventions in effective pathways. Here, we introduce the effective graph, a weighted graph that captures the nonlinear logical redundancy present in biochemical network regulation, signaling, and control. Using 78 experimentally validated models derived from systems biology, we demonstrate that 1) redundant pathways are prevalent in biological models of biochemical regulation, 2) the effective graph provides a probabilistic but precise characterization of multivariate dynamics in a causal graph form, and 3) the effective graph provides an accurate explanation of how dynamical perturbation and control signals, such as those induced by cancer drug therapies, propagate in biochemical pathways. Overall, our results indicate that the effective graph provides an enriched description of the structure and dynamics of networked multivariate causal interactions. We demonstrate that it improves explainability, prediction, and control of complex dynamical systems in general and biochemical regulation in particular.

Gene regulatory networks exhibit several kinds of memory: quantification of memory in biological and random transcriptional networks

Gene regulatory networks (GRNs) process important information in developmental biology and biomedicine. A key knowledge gap concerns how their responses change over time. Hypothesizing long-term changes of dynamics induced by transient prior events, we created a computational framework for defining and identifying diverse types of memory in candidate GRNs. We show that GRNs from a wide range of model systems are predicted to possess several types of memory, including Pavlovian conditioning. Associative memory offers an alternative strategy for the biomedical use of powerful drugs with undesirable side effects, and a novel approach to understanding the variability and time-dependent changes of drug action. We find evidence of natural selection favoring GRN memory. Vertebrate GRNs overall exhibit more memory than invertebrate GRNs, and memory is most prevalent in differentiated metazoan cell networks compared with undifferentiated cells. Timed stimuli are a powerful alternative for biomedical control of complex in vivo dynamics without genomic editing or transgenes.

•

Gene regulatory networks' dynamics are modified by transient stimuli

•

GRNs have several different types of memory, including associative conditioning

•

Evolution favored GRN memory, and differentiated cells have the most memory capacity

•

Training GRNs offers a novel biomedical strategy not dependent on genetic rewiring

Antifragility Predicts the Robustness and Evolvability of Biological Networks through Multi-Class Classification with a Convolutional Neural Network

Robustness and evolvability are essential properties to the evolution of biological networks. To determine if a biological network is robust and/or evolvable, it is required to compare its functions before and after mutations. However, this sometimes takes a high computational cost as the network size grows. Here, we develop a predictive method to estimate the robustness and evolvability of biological networks without an explicit comparison of functions. We measure antifragility in Boolean network models of biological systems and use this as the predictor. Antifragility occurs when a system benefits from external perturbations. By means of the differences of antifragility between the original and mutated biological networks, we train a convolutional neural network (CNN) and test it to classify the properties of robustness and evolvability. We found that our CNN model successfully classified the properties. Thus, we conclude that our antifragility measure can be used as a predictor of the robustness and evolvability of biological networks.

A feedback loop of conditionally stable circuits drives the cell cycle from checkpoint to checkpoint

We perform logic-based network analysis on a model of the mammalian cell cycle. This model is composed of a Restriction Switch driving cell cycle commitment and a Phase Switch driving mitotic entry and exit. By generalizing the concept of stable motif, i.e., a self-sustaining positive feedback loop that maintains an associated state, we introduce the concept of a conditionally stable motif, the stability of which is contingent on external conditions. We show that the stable motifs of the Phase Switch are contingent on the state of three nodes through which it receives input from the rest of the network. Biologically, these conditions correspond to cell cycle checkpoints. Holding these nodes locked (akin to a checkpoint-free cell) transforms the Phase Switch into an autonomous oscillator that robustly toggles through the cell cycle phases G1, G2 and mitosis. The conditionally stable motifs of the Phase Switch Oscillator are organized into an ordered sequence, such that they serially stabilize each other but also cause their own destabilization. Along the way they channel the dynamics of the module onto a narrow path in state space, lending robustness to the oscillation. Self-destabilizing conditionally stable motifs suggest a general negative feedback mechanism leading to sustained oscillations.

The Cognitive Lens: a primer on conceptual tools for analysing information processing in developmental and regenerative morphogenesis

Brains exhibit plasticity, multi-scale integration of information, computation and memory, having evolved by specialization of non-neural cells that already possessed many of the same molecular components and functions. The emerging field of basal cognition provides many examples of decision-making throughout a wide range of non-neural systems. How can biological information processing across scales of size and complexity be quantitatively characterized and exploited in biomedical settings? We use pattern regulation as a context in which to introduce the Cognitive Lens-a strategy using well-established concepts from cognitive and computer science to complement mechanistic investigation in biology. To facilitate the assimilation and application of these approaches across biology, we review tools from various quantitative disciplines, including dynamical systems, information theory and least-action principles. We propose that these tools can be extended beyond neural settings to predict and control systems-level outcomes, and to understand biological patterning as a form of primitive cognition. We hypothesize that a cognitive-level information-processing view of the functions of living systems can complement reductive perspectives, improving efficient top-down control of organism-level outcomes. Exploration of the deep parallels across diverse quantitative paradigms will drive integrative advances in evolutionary biology, regenerative medicine, synthetic bioengineering, cognitive neuroscience and artificial intelligence. This article is part of the theme issue 'Liquid brains, solid brains: How distributed cognitive architectures process information'.

Identification of Biologically Essential Nodes via Determinative Power in Logical Models of Cellular Processes

A variety of biological networks can be modeled as logical or Boolean networks. However, a simplification of the reality to binary states of the nodes does not ease the difficulty of analyzing the dynamics of large, complex networks, such as signal transduction networks, due to the exponential dependence of the state space on the number of nodes. This paper considers a recently introduced method for finding a fairly small subnetwork, representing a collection of nodes that determine the states of most other nodes with a reasonable level of entropy. The subnetwork contains the most determinative nodes that yield the highest information gain. One of the goals of this paper is to propose an algorithm for finding a suitable subnetwork size. The information gain is quantified by the so-called determinative power of the nodes, which is obtained via the mutual information, a concept originating in information theory. We find the most determinative nodes for 36 network models available in the online database Cell Collective (http://cellcollective.org). We provide statistical information that indicates a weak correlation between the subnetwork size and other variables, such as network size, or maximum and average determinative power of nodes. We observe that the proportion represented by the subnetwork in comparison to the whole network shows a weak tendency to decrease for larger networks. The determinative power of nodes is weakly correlated to the number of outputs of a node, and it appears to be independent of other topological measures such as closeness or betweenness centrality. Once the subnetwork of the most determinative nodes is identified, we generate a biological function analysis of its nodes for some of the 36 networks. The analysis shows that a large fraction of the most determinative nodes are essential and involved in crucial biological functions. The biological pathway analysis of the most determinative nodes shows that they are involved in important disease pathways.

CANA: A Python Package for Quantifying Control and Canalization in Boolean Networks

Logical models offer a simple but powerful means to understand the complex dynamics of biochemical regulation, without the need to estimate kinetic parameters. However, even simple automata components can lead to collective dynamics that are computationally intractable when aggregated into networks. In previous work we demonstrated that automata network models of biochemical regulation are highly canalizing, whereby many variable states and their groupings are redundant (Marques-Pita and Rocha, 2013). The precise charting and measurement of such canalization simplifies these models, making even very large networks amenable to analysis. Moreover, canalization plays an important role in the control, robustness, modularity and criticality of Boolean network dynamics, especially those used to model biochemical regulation (Gates and Rocha, 2016; Gates et al., 2016; Manicka, 2017). Here we describe a new publicly-available Python package that provides the necessary tools to extract, measure, and visualize canalizing redundancy present in Boolean network models. It extracts the pathways most effective in controlling dynamics in these models, including their effective graph and dynamics canalizing map, as well as other tools to uncover minimum sets of control variables.

Control of complex networks requires both structure and dynamics

The study of network structure has uncovered signatures of the organization of complex systems. However, there is also a need to understand how to control them; for example, identifying strategies to revert a diseased cell to a healthy state, or a mature cell to a pluripotent state. Two recent methodologies suggest that the controllability of complex systems can be predicted solely from the graph of interactions between variables, without considering their dynamics: structural controllability and minimum dominating sets. We demonstrate that such structure-only methods fail to characterize controllability when dynamics are introduced. We study Boolean network ensembles of network motifs as well as three models of biochemical regulation: the segment polarity network in Drosophila melanogaster, the cell cycle of budding yeast Saccharomyces cerevisiae, and the floral organ arrangement in Arabidopsis thaliana. We demonstrate that structure-only methods both undershoot and overshoot the number and which sets of critical variables best control the dynamics of these models, highlighting the importance of the actual system dynamics in determining control. Our analysis further shows that the logic of automata transition functions, namely how canalizing they are, plays an important role in the extent to which structure predicts dynamics.

Temperature stress mediates decanalization and dominance of gene expression in Drosophila melanogaster

The regulatory architecture of gene expression remains an area of active research. Here, we studied how the interplay of genetic and environmental variation affects gene expression by exposing Drosophila melanogaster strains to four different developmental temperatures. At 18°C we observed almost complete canalization with only very few allelic effects on gene expression. In contrast, at the two temperature extremes, 13°C and 29°C a large number of allelic differences in gene expression were detected due to both cis- and trans-regulatory effects. Allelic differences in gene expression were mainly dominant, but for up to 62% of the genes the dominance swapped between 13 and 29°C. Our results are consistent with stabilizing selection causing buffering of allelic expression variation in non-stressful environments. We propose that decanalization of gene expression in stressful environments is not only central to adaptation, but may also contribute to genetic disorders in human populations.

Robustness and evolvability of the human signaling network

Biological systems are known to be both robust and evolvable to internal and external perturbations, but what causes these apparently contradictory properties? We used Boolean network modeling and attractor landscape analysis to investigate the evolvability and robustness of the human signaling network. Our results show that the human signaling network can be divided into an evolvable core where perturbations change the attractor landscape in state space, and a robust neighbor where perturbations have no effect on the attractor landscape. Using chemical inhibition and overexpression of nodes, we validated that perturbations affect the evolvable core more strongly than the robust neighbor. We also found that the evolvable core has a distinct network structure, which is enriched in feedback loops, and features a higher degree of scale-freeness and longer path lengths connecting the nodes. In addition, the genes with high evolvability scores are associated with evolvability-related properties such as rapid evolvability, low species broadness, and immunity whereas the genes with high robustness scores are associated with robustness-related properties such as slow evolvability, high species broadness, and oncogenes. Intriguingly, US Food and Drug Administration-approved drug targets have high evolvability scores whereas experimental drug targets have high robustness scores.

Biological systems are known to be robust and evolvable to internal mutations and external environmental changes. What causes these apparently contradictory properties? This study shows that the human signaling network can be decomposed into two structurally distinct subgroups of links that provide both evolvability to environmental changes and robustness against internal mutations. The decomposition of the human signaling network reveals an evolutionary design principle of the network, and also facilitates the identification of potential drug targets.