On the estimation of robustness and filtering ability of dynamic biochemical networks under process delays, internal parametric perturbations and external disturbances

Inherently, biochemical regulatory networks suffer from process delays, internal parametrical perturbations as well as external disturbances. Robustness is the property to maintain the functions of intracellular biochemical regulatory networks despite these perturbations. In this study, system and signal processing theories are employed for measurement of robust stability and filtering ability of linear and nonlinear time-delay biochemical regulatory networks. First, based on Lyapunov stability theory, the robust stability of biochemical network is measured for the tolerance of additional process delays and additive internal parameter fluctuations. Then the filtering ability of attenuating additive external disturbances is estimated for time-delay biochemical regulatory networks. In order to overcome the difficulty of solving the Hamilton Jacobi inequality (HJI), the global linearization technique is employed to simplify the measurement procedure by a simple linear matrix inequality (LMI) method. Finally, an example is given in silico to illustrate how to measure the robust stability and filtering ability of a nonlinear time-delay perturbative biochemical network. This robust stability and filtering ability measurement for biochemical network has potential application to synthetic biology, gene therapy and drug design.     

Cellularly-driven differences in network synchronization propensity are differentially modulated by firing frequency

Spatiotemporal pattern formation in neuronal networks depends on the interplay between cellular and network synchronization properties. The neuronal phase response curve (PRC) is an experimentally obtainable measure that characterizes the cellular response to small perturbations, and can serve as an indicator of cellular propensity for synchronization. Two broad classes of PRCs have been identified for neurons: Type I, in which small excitatory perturbations induce only advances in firing, and Type II, in which small excitatory perturbations can induce both advances and delays in firing. Interestingly, neuronal PRCs are usually attenuated with increased spiking frequency, and Type II PRCs typically exhibit a greater attenuation of the phase delay region than of the phase advance region. We found that this phenomenon arises from an interplay between the time constants of active ionic currents and the interspike interval. As a result, excitatory networks consisting of neurons with Type I PRCs responded very differently to frequency modulation compared to excitatory networks composed of neurons with Type II PRCs. Specifically, increased frequency induced a sharp decrease in synchrony of networks of Type II neurons, while frequency increases only minimally affected synchrony in networks of Type I neurons. These results are demonstrated in networks in which both types of neurons were modeled generically with the Morris-Lecar model, as well as in networks consisting of Hodgkin-Huxley-based model cortical pyramidal cells in which simulated effects of acetylcholine changed PRC type. These results are robust to different network structures, synaptic strengths and modes of driving neuronal activity, and they indicate that Type I and Type II excitatory networks may display two distinct modes of processing information.     

Inference of signaling and gene regulatory networks by steady-state perturbation experiments: structure and accuracy

One of the fundamental problems of cell biology is the understanding of complex regulatory networks. Such networks are ubiquitous in cells and knowledge of their properties is essential for the understanding of cellular behavior. In earlier work (Kholodenko et al. (PNAS 99: 12841), it was shown how the structure of biological networks can be quantified from experimental measurements of steady-state concentrations of key intermediates as a result of perturbations using a simple algorithm called "unravelling". Here, we study the effect of experimental uncertainty on the accuracy of the inferred structure (i.e. whether interactions are excitatory or inhibitory) of the networks determined using the unravelling algorithm. We show that the accuracy of the network structure depends not only on the noise level but on the strength of the interactions within the network. In particular, both very small and very large values of the connection strengths lead to large uncertainty in the inferred network. We describe a powerful geometric tool for the intuitive understanding of the effect of experimental error on the qualitative accuracy of the inferred network. In addition, we show that the use of additional data beyond that needed to minimally constrain the network not only improves the accuracy of the inferred network, but also may allow the detection of situations in which the initial assumptions of unravelling with respect to the network and the perturbations have been violated. Our ideas are illustrated using the mitogen-activated protein kinase (MAPK) signaling network as an example.     

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.     

Learning Gene Networks under SNP Perturbations Using eQTL Datasets

The standard approach for identifying gene networks is based on experimental perturbations of gene regulatory systems such as gene knock-out experiments, followed by a genome-wide profiling of differential gene expressions. However, this approach is significantly limited in that it is not possible to perturb more than one or two genes simultaneously to discover complex gene interactions or to distinguish between direct and indirect downstream regulations of the differentially-expressed genes. As an alternative, genetical genomics study has been proposed to treat naturally-occurring genetic variants as potential perturbants of gene regulatory system and to recover gene networks via analysis of population gene-expression and genotype data. Despite many advantages of genetical genomics data analysis, the computational challenge that the effects of multifactorial genetic perturbations should be decoded simultaneously from data has prevented a widespread application of genetical genomics analysis. In this article, we propose a statistical framework for learning gene networks that overcomes the limitations of experimental perturbation methods and addresses the challenges of genetical genomics analysis. We introduce a new statistical model, called a sparse conditional Gaussian graphical model, and describe an efficient learning algorithm that simultaneously decodes the perturbations of gene regulatory system by a large number of SNPs to identify a gene network along with expression quantitative trait loci (eQTLs) that perturb this network. While our statistical model captures direct genetic perturbations of gene network, by performing inference on the probabilistic graphical model, we obtain detailed characterizations of how the direct SNP perturbation effects propagate through the gene network to perturb other genes indirectly. We demonstrate our statistical method using HapMap-simulated and yeast eQTL datasets. In particular, the yeast gene network identified computationally by our method under SNP perturbations is well supported by the results from experimental perturbation studies related to DNA replication stress response.     

Allele-Specific Behavior of Molecular Networks: Understanding Small-Molecule Drug Response in Yeast

The study of systems genetics is changing the way the genetic and molecular basis of phenotypic variation, such as disease susceptibility and drug response, is being analyzed. Moreover, systems genetics aids in the translation of insights from systems biology into genetics. The use of systems genetics enables greater attention to be focused on the potential impact of genetic perturbations on the molecular states of networks that in turn affects complex traits. In this study, we developed models to detect allele-specific perturbations on interactions, in which a genetic locus with alternative alleles exerted a differing influence on an interaction. We utilized the models to investigate the dynamic behavior of an integrated molecular network undergoing genetic perturbations in yeast. Our results revealed the complexity of regulatory relationships between genetic loci and networks, in which different genetic loci perturb specific network modules. In addition, significant within-module functional coherence was found. We then used the network perturbation model to elucidate the underlying molecular mechanisms of individual differences in response to 100 diverse small molecule drugs. As a result, we identified sub-networks in the integrated network that responded to variations in DNA associated with response to diverse compounds and were significantly enriched for known drug targets. Literature mining results provided strong independent evidence for the effectiveness of these genetic perturbing networks in the elucidation of small-molecule responses in yeast.     

Mutualistic networks: moving closer to a predictive theory

Plant–animal mutualistic networks sustain terrestrial biodiversity and human food security. Global environmental changes threaten these networks, underscoring the urgency for developing a predictive theory on how networks respond to perturbations. Here, I synthesise theoretical advances towards predicting network structure, dynamics, interaction strengths and responses to perturbations. I find that mathematical models incorporating biological mechanisms of mutualistic interactions provide better predictions of network dynamics. Those mechanisms include trait matching, adaptive foraging, and the dynamic consumption and production of both resources and services provided by mutualisms. Models incorporating species traits better predict the potential structure of networks (fundamental niche), while theory based on the dynamics of species abundances, rewards, foraging preferences and reproductive services can predict the extremely dynamic realised structures of networks, and may successfully predict network responses to perturbations. From a theoretician's standpoint, model development must more realistically represent empirical data on interaction strengths, population dynamics and how these vary with perturbations from global change. From an empiricist's standpoint, theory needs to make specific predictions that can be tested by observation or experiments. Developing models using short‐term empirical data allows models to make longer term predictions of community dynamics. As more longer term data become available, rigorous tests of model predictions will improve.     

Phenology drives mutualistic network structure and diversity

Several network properties have been identified as determinants of the stability and complexity of mutualistic networks. However, it is unclear which mechanisms give rise to these network properties. Phenology seems important, because it shapes the topology of mutualistic networks, but its effects on the dynamics of mutualistic networks have scarcely been studied. Here, we study these effects with a general dynamical model of mutualistic and competitive interactions where the interaction strength depends on the temporal overlap between species resulting from their phenologies. We find a negative complexity-stability relationship, where phenologies maximising mutualistic interactions and minimising intraguild competitive interactions generate speciose, nested and poorly connected networks with moderate asymmetry and low resilience. Moreover, lengthening the season increases diversity and resilience. This highlights the fragility of real mutualistic communities with short seasons (e.g. Arctic environments) to drastic environmental changes.     

An algorithm for modularity analysis of directed and weighted biological networks based on edge-betweenness centrality

MOTIVATION: Modularity analysis is a powerful tool for studying the design of biological networks, offering potential clues for relating the biochemical function(s) of a network with the 'wiring' of its components. Relatively little work has been done to examine whether the modularity of a network depends on the physiological perturbations that influence its biochemical state. Here, we present a novel modularity analysis algorithm based on edge-betweenness centrality, which facilitates the use of directional information and measurable biochemical data.     

Sensitivity and control analysis of periodically forced reaction networks using the Green's function method

A general sensitivity and control analysis of periodically forced reaction networks with respect to small perturbations in arbitrary network parameters is presented. A well-known property of sensitivity coefficients for periodic processes in dynamical systems is that the coefficients generally become unbounded as time tends to infinity. To circumvent this conceptual obstacle, a relative time or phase variable is introduced so that the periodic sensitivity coefficients can be calculated. By employing the Green's function method, the sensitivity coefficients can be defined using integral control operators that relate small perturbations in the network's parameters and forcing frequency to variations in the metabolite concentrations and reaction fluxes. The properties of such operators do not depend on a particular parameter perturbation and are described by the summation and connectivity relationships within a control-matrix operator equation. The aim of this paper is to derive such a general control-matrix operator equation for periodically forced reaction networks, including metabolic pathways. To illustrate the general method, the two limiting cases of high and low forcing frequency are considered. We also discuss a practically important case where enzyme activities and forcing frequency are modulated simultaneously. We demonstrate the developed framework by calculating the sensitivity and control coefficients for a simple two reaction pathway where enzyme activities enter reaction rates linearly and specifically.     

Identification of alterations in the Jacobian of biochemical reaction networks from steady state covariance data at two conditions

Model building of biochemical reaction networks typically involves experiments in which changes in the behavior due to natural or experimental perturbations are observed. Computational models of reaction networks are also used in a systems biology approach to study how transitions from a healthy to a diseased state result from changes in genetic or environmental conditions. In this paper we consider the nonlinear inverse problem of inferring information about the Jacobian of a Langevin type network model from covariance data of steady state concentrations associated to two different experimental conditions. Under idealized assumptions on the Langevin fluctuation matrices we prove that relative alterations in the network Jacobian can be uniquely identified when comparing the two data sets. Based on this result and the premise that alteration is locally confined to separable parts due to network modularity we suggest a computational approach using hybrid stochastic-deterministic optimization for the detection of perturbations in the network Jacobian using the sparsity promoting effect of $\ell _p$ -penalization. Our approach is illustrated by means of published metabolomic and signaling reaction 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.     

Monotone and near-monotone biochemical networks

Monotone subsystems have appealing properties as components of larger networks, since they exhibit robust dynamical stability and predictability of responses to perturbations. This suggests that natural biological systems may have evolved to be, if not monotone, at least close to monotone in the sense of being decomposable into a “small” number of monotone components, In addition, recent research has shown that much insight can be attained from decomposing networks into monotone subsystems and the analysis of the resulting interconnections using tools from control theory. This paper provides an expository introduction to monotone systems and their interconnections, describing the basic concepts and some of the main mathematical results in a largely informal fashion. Supported in part by NSF Grants DMS-0504557 and DMS-0614371.     

Pleistocene megafaunal interaction networks became more vulnerable after human arrival

The end of the Pleistocene was marked by the extinction of almost all large land mammals worldwide except in Africa. Although the debate on Pleistocene extinctions has focused on the roles of climate change and humans, the impact of perturbations depends on properties of ecological communities, such as species composition and the organization of ecological interactions. Here, we combined palaeoecological and ecological data, food-web models and community stability analysis to investigate if differences between Pleistocene and modern mammalian assemblages help us understand why the megafauna died out in the Americas while persisting in Africa. We show Pleistocene and modern assemblages share similar network topology, but differences in richness and body size distributions made Pleistocene communities significantly more vulnerable to the effects of human arrival. The structural changes promoted by humans in Pleistocene networks would have increased the likelihood of unstable dynamics, which may favour extinction cascades in communities facing extrinsic perturbations. Our findings suggest that the basic aspects of the organization of ecological communities may have played an important role in major extinction events in the past. Knowledge of community-level properties and their consequences to dynamics may be critical to understand past and future extinctions.     

Neural model of the genetic network

Many cell control processes consist of networks of interacting elements that affect the state of each other over time. Such an arrangement resembles the principles of artificial neural networks, in which the state of a particular node depends on the combination of the states of other neurons. The lambda bacteriophage lysis/lysogeny decision circuit can be represented by such a network. It is used here as a model for testing the validity of a neural approach to the analysis of genetic networks. The model considers multigenic regulation including positive and negative feedback. It is used to simulate the dynamics of the lambda phage regulatory system; the results are compared with experimental observation. The comparison proves that the neural network model describes behavior of the system in full agreement with experiments; moreover, it predicts its function in experimentally inaccessible situations and explains the experimental observations. The application of the principles of neural networks to the cell control system leads to conclusions about the stability and redundancy of genetic networks and the cell functionality. Reverse engineering of the biochemical pathways from proteomics and DNA micro array data using the suggested neural network model is discussed.     

Models from experiments: combinatorial drug perturbations of cancer cells

We present a novel method for deriving network models from molecular profiles of perturbed cellular systems. The network models aim to predict quantitative outcomes of combinatorial perturbations, such as drug pair treatments or multiple genetic alterations. Mathematically, we represent the system by a set of nodes, representing molecular concentrations or cellular processes, a perturbation vector and an interaction matrix. After perturbation, the system evolves in time according to differential equations with built‐in nonlinearity, similar to Hopfield networks, capable of representing epistasis and saturation effects. For a particular set of experiments, we derive the interaction matrix by minimizing a composite error function, aiming at accuracy of prediction and simplicity of network structure. To evaluate the predictive potential of the method, we performed 21 drug pair treatment experiments in a human breast cancer cell line (MCF7) with observation of phospho‐proteins and cell cycle markers. The best derived network model rediscovered known interactions and contained interesting predictions. Possible applications include the discovery of regulatory interactions, the design of targeted combination therapies and the engineering of molecular biological networks.