Geometry and topology of parameter space: investigating measures of robustness in regulatory networks

The concept of robustness of regulatory networks has been closely related to the nature of the interactions among genes, and the capability of pattern maintenance or reproducibility. Defining this robustness property is a challenging task, but mathematical models have often associated it to the volume of the space of admissible parameters. Not only the volume of the space but also its topology and geometry contain information on essential aspects of the network, including feasible pathways, switching between two parallel pathways or distinct/disconnected active regions of parameters. A method is presented here to characterize the space of admissible parameters, by writing it as a semi-algebraic set, and then theoretically analyzing its topology and geometry, as well as volume. This method provides a more objective and complete measure of the robustness of a developmental module. As a detailed case study, the segment polarity gene network is analyzed.     

Robustness,flexibility, and the role of lateral inhibition in the neurogenic network

BACKGROUND: Many gene networks used by developing organisms have been conserved over long periods of evolutionary time. Why is that? We showed previously that a model of the segment polarity network in Drosophila is robust to parameter variation and is likely to act as a semiautonomous patterning module. Is this true of other networks as well? RESULTS: We present a model of the core neurogenic network in Drosophila. Our model exhibits at least three related pattern-resolving behaviors that the real neurogenic network accomplishes during embryogenesis in Drosophila. Furthermore, we find that it exhibits these behaviors across a wide range of parameter values, with most of its parameters able to vary more than an order of magnitude while it still successfully forms our test patterns. With a single set of parameters, different initial conditions (prepatterns) can select between different behaviors in the network's repertoire. We introduce two new measures for quantifying network robustness that mimic recombination and allelic divergence and use these to reveal the shape of the domain in the parameter space in which the model functions. We show that lateral inhibition yields robustness to changes in prepatterns and suggest a reconciliation of two divergent sets of experimental results. Finally, we show that, for this model, robustness confers functional flexibility. CONCLUSIONS: The neurogenic network is robust to changes in parameter values, which gives it the flexibility to make new patterns. Our model also offers a possible resolution of a debate on the role of lateral inhibition in cell fate specification.     

Robustness analysis and behavior discrimination in enzymatic reaction networks

Characterizing the behavior and robustness of enzymatic networks with numerous variables and unknown parameter values is a major challenge in biology, especially when some enzymes have counter-intuitive properties or switch-like behavior between activation and inhibition. In this paper, we propose new methodological and tool-supported contributions, based on the intuitive formalism of temporal logic, to express in a rigorous manner arbitrarily complex dynamical properties. Our multi-step analysis allows efficient sampling of the parameter space in order to define feasible regions in which the model exhibits imposed or experimentally observed behaviors. In a first step, an algorithmic methodology involving sensitivity analysis is conducted to determine bifurcation thresholds for a limited number of model parameters or initial conditions. In a second step, this boundary detection is supplemented by a global robustness analysis, based on quasi-Monte Carlo approach that takes into account all model parameters. We apply this method to a well-documented enzymatic reaction network describing collagen proteolysis by matrix metalloproteinase MMP2 and membrane type 1 metalloproteinase (MT1-MMP) in the presence of tissue inhibitor of metalloproteinase TIMP2. For this model, our method provides an extended analysis and quantification of network robustness toward paradoxical TIMP2 switching activity between activation or inhibition of MMP2 production. Further implication of our approach is illustrated by demonstrating and analyzing the possible existence of oscillatory behaviors when considering an extended open configuration of the enzymatic network. Notably, we construct bifurcation diagrams that specify key parameters values controlling the co-existence of stable steady and non-steady oscillatory proteolytic dynamics.     

Robustness as a measure of plausibility in models of biochemical networks

Theory, experiment, and observation suggest that biochemical networks which are conserved across species are robust to variations in concentrations and kinetic parameters. Here, we exploit this expectation to propose an approach to model building and selection. We represent a model as a mapping from parameter space to behavior space, and utilize bifurcation analysis to study the robustness of each region of steady-state behavior to parameter variations. The hypothesis that potential errors in models will result in parameter sensitivities is tested by analysis of two models of the biochemical oscillator underlying the Xenopus cell cycle. Our analysis successfully identifies known weaknesses in the older model and suggests areas for further investigation in the more recent, more plausible model. It also correctly highlights why the more recent model is more plausible.     

A new measure of the robustness of biochemical networks

MOTIVATION: The robustness of a biochemical network is defined as the tolerance of variations in kinetic parameters with respect to the maintenance of steady state. Robustness also plays an important role in the fail-safe mechanism in the evolutionary process of biochemical networks. The purposes of this paper are to use the synergism and saturation system (S-system) representation to describe a biochemical network and to develop a robustness measure of a biochemical network subject to variations in kinetic parameters. Since most biochemical networks in nature operate close to the steady state, we consider only the robustness measurement of a biochemical network at the steady state. RESULTS: We show that the upper bound of the tolerated parameter variations is related to the system matrix of a biochemical network at the steady state. Using this upper bound, we can calculate the tolerance (robustness) of a biochemical network without testing many parametric perturbations. We find that a biochemical network with a large tolerance can also better attenuate the effects of variations in rate parameters and environments. Compensatory parameter variations and network redundancy are found to be important mechanisms for the robustness of biochemical networks. Finally, four biochemical networks, such as a cascaded biochemical network, the glycolytic-glycogenolytic pathway in a perfused rat liver, the tricarboxylic acid cycle in Dictyostelium discoideum and the cAMP oscillation network in bacterial chemotaxis, are used to illustrate the usefulness of the proposed robustness measure.     

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.     

Integrating multi-attribute similarity networks for robust representation of the protein space

MOTIVATION: A global view of the protein space is essential for functional and evolutionary analysis of proteins. In order to achieve this, a similarity network can be built using pairwise relationships among proteins. However, existing similarity networks employ a single similarity measure and therefore their utility depends highly on the quality of the selected measure. A more robust representation of the protein space can be realized if multiple sources of information are used. RESULTS: We propose a novel approach for analyzing multi-attribute similarity networks by combining random walks on graphs with Bayesian theory. A multi-attribute network is created by combining sequence and structure based similarity measures. For each attribute of the similarity network, one can compute a measure of affinity from a given protein to every other protein in the network using random walks. This process makes use of the implicit clustering information of the similarity network, and we show that it is superior to naive, local ranking methods. We then combine the computed affinities using a Bayesian framework. In particular, when we train a Bayesian model for automated classification of a novel protein, we achieve high classification accuracy and outperform single attribute networks. In addition, we demonstrate the effectiveness of our technique by comparison with a competing kernel-based information integration approach.     

Ensemble Modeling for Robustness Analysis in engineering non-native metabolic pathways

Metabolic pathways in cells must be sufficiently robust to tolerate fluctuations in expression levels and changes in environmental conditions. Perturbations in expression levels may lead to system failure due to the disappearance of a stable steady state. Increasing evidence has suggested that biological networks have evolved such that they are intrinsically robust in their network structure. In this article, we presented Ensemble Modeling for Robustness Analysis (EMRA), which combines a continuation method with the Ensemble Modeling approach, for investigating the robustness issue of non-native pathways. EMRA investigates a large ensemble of reference models with different parameters, and determines the effects of parameter drifting until a bifurcation point, beyond which a stable steady state disappears and system failure occurs. A pathway is considered to have high bifurcational robustness if the probability of system failure is low in the ensemble. To demonstrate the utility of EMRA, we investigate the bifurcational robustness of two synthetic central metabolic pathways that achieve carbon conservation: non-oxidative glycolysis and reverse glyoxylate cycle. With EMRA, we determined the probability of system failure of each design and demonstrated that alternative designs of these pathways indeed display varying degrees of bifurcational robustness. Furthermore, we demonstrated that target selection for flux improvement should consider the trade-offs between robustness and performance.     

‘Glocal’ Robustness Analysis and Model Discrimination for Circadian Oscillators

To characterize the behavior and robustness of cellular circuits with many unknown parameters is a major challenge for systems biology. Its difficulty rises exponentially with the number of circuit components. We here propose a novel analysis method to meet this challenge. Our method identifies the region of a high-dimensional parameter space where a circuit displays an experimentally observed behavior. It does so via a Monte Carlo approach guided by principal component analysis, in order to allow efficient sampling of this space. This ‘global’ analysis is then supplemented by a ‘local’ analysis, in which circuit robustness is determined for each of the thousands of parameter sets sampled in the global analysis. We apply this method to two prominent, recent models of the cyanobacterial circadian oscillator, an autocatalytic model, and a model centered on consecutive phosphorylation at two sites of the KaiC protein, a key circadian regulator. For these models, we find that the two-sites architecture is much more robust than the autocatalytic one, both globally and locally, based on five different quantifiers of robustness, including robustness to parameter perturbations and to molecular noise. Our ‘glocal’ combination of global and local analyses can also identify key causes of high or low robustness. In doing so, our approach helps to unravel the architectural origin of robust circuit behavior. Complementarily, identifying fragile aspects of system behavior can aid in designing perturbation experiments that may discriminate between competing mechanisms and different parameter sets.     

Characterizing multistationarity regimes in biochemical reaction networks

Switch like responses appear as common strategies in the regulation of cellular systems. Here we present a method to characterize bistable regimes in biochemical reaction networks that can be of use to both direct and reverse engineering of biological switches. In the design of a synthetic biological switch, it is important to study the capability for bistability of the underlying biochemical network structure. Chemical Reaction Network Theory (CRNT) may help at this level to decide whether a given network has the capacity for multiple positive equilibria, based on their structural properties. However, in order to build a working switch, we also need to ensure that the bistability property is robust, by studying the conditions leading to the existence of two different steady states. In the reverse engineering of biological switches, knowledge collected about the bistable regimes of the underlying potential model structures can contribute at the model identification stage to a drastic reduction of the feasible region in the parameter space of search. In this work, we make use and extend previous results of the CRNT, aiming not only to discriminate whether a biochemical reaction network can exhibit multiple steady states, but also to determine the regions within the whole space of parameters capable of producing multistationarity. To that purpose we present and justify a condition on the parameters of biochemical networks for the appearance of multistationarity, and propose an efficient and reliable computational method to check its satisfaction through the parameter space.     

A Network Characteristic That Correlates Environmental and Genetic Robustness

As scientific advances in perturbing biological systems and technological advances in data acquisition allow the large-scale quantitative analysis of biological function, the robustness of organisms to both transient environmental stresses and inter-generational genetic changes is a fundamental impediment to the identifiability of mathematical models of these functions. An approach to overcoming this impediment is to reduce the space of possible models to take into account both types of robustness. However, the relationship between the two is still controversial. This work uncovers a network characteristic, transient responsiveness, for a specific function that correlates environmental imperturbability and genetic robustness. We test this characteristic extensively for dynamic networks of ordinary differential equations ranging up to 30 interacting nodes and find that there is a power-law relating environmental imperturbability and genetic robustness that tends to linearity as the number of nodes increases. Using our methods, we refine the classification of known 3-node motifs in terms of their environmental and genetic robustness. We demonstrate our approach by applying it to the chemotaxis signaling network. In particular, we investigate plausible models for the role of CheV protein in biochemical adaptation via a phosphorylation pathway, testing modifications that could improve the robustness of the system to environmental and/or genetic perturbation.     

Identification of a Topological Characteristic Responsible for the Biological Robustness of Regulatory Networks

Attribution of biological robustness to the specific structural properties of a regulatory network is an important yet unsolved problem in systems biology. It is widely believed that the topological characteristics of a biological control network largely determine its dynamic behavior, yet the actual mechanism is still poorly understood. Here, we define a novel structural feature of biological networks, termed ‘regulation entropy’, to quantitatively assess the influence of network topology on the robustness of the systems. Using the cell-cycle control networks of the budding yeast (Saccharomyces cerevisiae) and the fission yeast (Schizosaccharomyces pombe) as examples, we first demonstrate the correlation of this quantity with the dynamic stability of biological control networks, and then we establish a significant association between this quantity and the structural stability of the networks. And we further substantiate the generality of this approach with a broad spectrum of biological and random networks. We conclude that the regulation entropy is an effective order parameter in evaluating the robustness of biological control networks. Our work suggests a novel connection between the topological feature and the dynamic property of biological regulatory networks.     

Parrondo’s Games Based on Complex Networks and the Paradoxical Effect

Parrondo’s games were first constructed using a simple tossing scenario, which demonstrates the following paradoxical situation: in sequences of games, a winning expectation may be obtained by playing the games in a random order, although each game (game A or game B) in the sequence may result in losing when played individually. The available Parrondo’s games based on the spatial niche (the neighboring environment) are applied in the regular networks. The neighbors of each node are the same in the regular graphs, whereas they are different in the complex networks. Here, Parrondo’s model based on complex networks is proposed, and a structure of game B applied in arbitrary topologies is constructed. The results confirm that Parrondo’s paradox occurs. Moreover, the size of the region of the parameter space that elicits Parrondo’s paradox depends on the heterogeneity of the degree distributions of the networks. The higher heterogeneity yields a larger region of the parameter space where the strong paradox occurs. In addition, we use scale-free networks to show that the network size has no significant influence on the region of the parameter space where the strong or weak Parrondo’s paradox occurs. The region of the parameter space where the strong Parrondo’s paradox occurs reduces slightly when the average degree of the network increases.     

Architecture-Dependent Robustness and Bistability in a Class of Genetic Circuits

Understanding the relationship between genotype and phenotype is a challenge in systems biology. An interesting yet related issue is why a particular circuit topology is present in a cell when the same function can supposedly be obtained from an alternative architecture. Here we analyzed two topologically equivalent genetic circuits of coupled positive and negative feedback loops, named NAT and ALT circuits, respectively. The computational search for the oscillation volume of the entire biologically reasonable parameter region through large-scale random samplings shows that the NAT circuit exhibits a distinctly larger fraction of the oscillatory region than the ALT circuit. Such a global robustness difference between two circuits is supplemented by analyzing local robustness, including robustness to parameter perturbations and to molecular noise. In addition, detailed dynamical analysis shows that the molecular noise of both circuits can induce transient switching of the different mechanism between a stable steady state and a stable limit cycle. Our investigation on robustness and dynamics through examples provides insights into the relationship between network architecture and its function.     

Predicting Phenotypic Diversity and the Underlying Quantitative Molecular Transitions

During development, signaling networks control the formation of multicellular patterns. To what extent quantitative fluctuations in these complex networks may affect multicellular phenotype remains unclear. Here, we describe a computational approach to predict and analyze the phenotypic diversity that is accessible to a developmental signaling network. Applying this framework to vulval development in C. elegans, we demonstrate that quantitative changes in the regulatory network can render ~500 multicellular phenotypes. This phenotypic capacity is an order-of-magnitude below the theoretical upper limit for this system but yet is large enough to demonstrate that the system is not restricted to a select few outcomes. Using metrics to gauge the robustness of these phenotypes to parameter perturbations, we identify a select subset of novel phenotypes that are the most promising for experimental validation. In addition, our model calculations provide a layout of these phenotypes in network parameter space. Analyzing this landscape of multicellular phenotypes yielded two significant insights. First, we show that experimentally well-established mutant phenotypes may be rendered using non-canonical network perturbations. Second, we show that the predicted multicellular patterns include not only those observed in C. elegans, but also those occurring exclusively in other species of the Caenorhabditis genus. This result demonstrates that quantitative diversification of a common regulatory network is indeed demonstrably sufficient to generate the phenotypic differences observed across three major species within the Caenorhabditis genus. Using our computational framework, we systematically identify the quantitative changes that may have occurred in the regulatory network during the evolution of these species. Our model predictions show that significant phenotypic diversity may be sampled through quantitative variations in the regulatory network without overhauling the core network architecture. Furthermore, by comparing the predicted landscape of phenotypes to multicellular patterns that have been experimentally observed across multiple species, we systematically trace the quantitative regulatory changes that may have occurred during the evolution of the Caenorhabditis genus.     

Gene network inference from incomplete expression data: transcriptional control of hematopoietic commitment

MOTIVATION: The topology and function of gene regulation networks are commonly inferred from time series of gene expression levels in cell populations. This strategy is usually invalid if the gene expression in different cells of the population is not synchronous. A promising, though technically more demanding alternative is therefore to measure the gene expression levels in single cells individually. The inference of a gene regulation network requires knowledge of the gene expression levels at successive time points, at least before and after a network transition. However, owing to experimental limitations a complete determination of the precursor state is not possible. RESULTS: We investigate a strategy for the inference of gene regulatory networks from incomplete expression data based on dynamic Bayesian networks. This permits prediction of the number of experiments necessary for network inference depending on parameters including noise in the data, prior knowledge and limited attainability of initial states. Our strategy combines a gradual 'Partial Learning' approach based solely on true experimental observations for the network topology with expectation maximization for the network parameters. We illustrate our strategy by extensive computer simulations in a high-dimensional parameter space in a simulated single-cell-based example of hematopoietic stem cell commitment and in random networks of different sizes. We find that the feasibility of network inferences increases significantly with the experimental ability to force the system into different initial network states, with prior knowledge and with noise reduction. AVAILABILITY: Source code is available under: www.izbi.uni-leipzig.de/services/NetwPartLearn.html SUPPLEMENTARY INFORMATION: Supplementary Data are available at Bioinformatics online.