Unravelling the functional interaction structure of a cellular network from temporal slope information of experimental data

Due to the unavoidable nonbiological variations accompanying many experiments, it is imperative to consider a way of unravelling the functional interaction structure of a cellular network (e.g. signalling cascades or gene networks) by using the qualitative information of time-series experimental data instead of computation through the measured absolute values. In this spirit, we propose a very simple but effective method of identifying the functional interaction structure of a cellular network based on temporal ascending or descending slope information from given time-series measurements. From this method, we can gain insight into the acceptable measurement error ranges in order to estimate the correct functional interaction structure and we can also find guidance for a new experimental design to complement the insufficient information of a given experimental dataset. We developed experimental sign equations, making use of the temporal slope sign information from time-series experimental data, without a specific assumption on parameter perturbations for each network node. Based on these equations, we further describe the available specific information from each part of experimental data in detail and show the functional interaction structure obtained by integrating such information. In this procedure, we use only simple algebra on sign changes without complicated computations on the measured absolute values of the experimental data. The result is, however, verified through rigorous mathematical definitions and proofs. The present method provides us with information about the acceptable measurement error ranges for correct estimation of the functional interaction structure and it further leads to a new experimental design to complement the given experimental data by informing us about additional specific sampling points to be chosen for further required information.     

How to reconstruct a large genetic network from n gene perturbations in fewer than n(2) easy steps.

MOTIVATION: The reconstruction of genetic networks is the holy grail of functional genomics. Its core task is to identify the causal structure of a gene network, that is, to distinguish direct from indirect regulatory interactions among gene products. In other words, to reconstruct a genetic network is to identify, for each network gene, which other genes and their activity the gene influences directly. Crucial to this task are perturbations of gene activity. Genomic technology permits large-scale experiments perturbing the activity of many genes and assessing the effect of each perturbation on all other genes in a genome. However, such experiments cannot distinguish between direct and indirect effects of a genetic perturbation. RESULTS: I present an algorithm to reconstruct direct regulatory interactions in gene networks from the results of gene perturbation experiments. The algorithm is based on a graph representation of genetic networks and applies to networks of arbitrary size and complexity. Algorithmic complexity in both storage and time is low, less than O(n(2)). In practice, the algorithm can reconstruct networks of several thousand genes in mere CPU seconds on a desktop workstation. AVAILABILITY: A perl implementation of the algorithm is given in the Appendix. CONTACT: wagnera@unm.edu     

Plato's Cave Algorithm: Inferring Functional Signaling Networks from Early Gene Expression Shadows

Improving the ability to reverse engineer biochemical networks is a major goal of systems biology. Lesions in signaling networks lead to alterations in gene expression, which in principle should allow network reconstruction. However, the information about the activity levels of signaling proteins conveyed in overall gene expression is limited by the complexity of gene expression dynamics and of regulatory network topology. Two observations provide the basis for overcoming this limitation: a. genes induced without de-novo protein synthesis (early genes) show a linear accumulation of product in the first hour after the change in the cell''s state; b. The signaling components in the network largely function in the linear range of their stimulus-response curves. Therefore, unlike most genes or most time points, expression profiles of early genes at an early time point provide direct biochemical assays that represent the activity levels of upstream signaling components. Such expression data provide the basis for an efficient algorithm (Plato''s Cave algorithm; PLACA) to reverse engineer functional signaling networks. Unlike conventional reverse engineering algorithms that use steady state values, PLACA uses stimulated early gene expression measurements associated with systematic perturbations of signaling components, without measuring the signaling components themselves. Besides the reverse engineered network, PLACA also identifies the genes detecting the functional interaction, thereby facilitating validation of the predicted functional network. Using simulated datasets, the algorithm is shown to be robust to experimental noise. Using experimental data obtained from gonadotropes, PLACA reverse engineered the interaction network of six perturbed signaling components. The network recapitulated many known interactions and identified novel functional interactions that were validated by further experiment. PLACA uses the results of experiments that are feasible for any signaling network to predict the functional topology of the network and to identify novel relationships.     

Controlled embryoid body formation via surface modification and avidin–biotin cross-linking

Cell–cell interaction is an integral part of embryoid body (EB) formation controlling 3D aggregation. Manipulation of embryonic stem (ES) cell interactions could provide control over EB formation. Studies have shown a direct relationship between EB formation and ES cell differentiation. We have previously described a cell surface modification and cross-linking method for influencing cell–cell interaction and formation of multicellular constructs. Here we show further characterisation of this engineered aggregation. We demonstrate that engineering accelerates ES cell aggregation, forming larger, denser and more stable EBs than control samples, with no significant decrease in constituent ES cell viability. However, extended culture ≥5 days reveals significant core necrosis creating a layered EB structure. Accelerated aggregation through engineering circumvents this problem as EB formation time is reduced. We conclude that the proposed engineering method influences initial ES cell-ES cell interactions and EB formation. This methodology could be employed to further our understanding of intrinsic EB properties and their effect on ES cell differentiation.     

Bayesian analysis of signaling networks governing embryonic stem cell fate decisions

MOTIVATION: Signaling events that direct mouse embryonic stem (ES) cell self-renewal and differentiation are complex and accordingly difficult to understand in an integrated manner. We address this problem by adapting a Bayesian network learning algorithm to model proteomic signaling data for ES cell fate responses to external cues. Using this model we were able to characterize the signaling pathway influences as quantitative, logic-circuit type interactions. Our experimental dataset includes measurements for 28 signaling protein phosphorylation states across 16 different factorial combinations of cytokine and matrix stimuli as reported previously. RESULTS: The Bayesian network modeling approach allows us to uncover previously reported signaling activities related to mouse ES cell self-renewal, such as the roles of LIF and STAT3 in maintaining undifferentiated ES cell populations. Furthermore, the network predicts novel influences such as between ERK phosphorylation and differentiation, or RAF phosphorylation and differentiated cell proliferation. Visualization of the influences detected by the Bayesian network provides intuition about the underlying physiology of the signaling pathways. We demonstrate that the Bayesian networks can capture the linear, nonlinear and multistate logic interactions that connect extracellular cues, intracellular signals and consequent cell functional responses.     

Perturbation Centrality and Turbine: A Novel Centrality Measure Obtained Using a Versatile Network Dynamics Tool

Analysis of network dynamics became a focal point to understand and predict changes of complex systems. Here we introduce Turbine, a generic framework enabling fast simulation of any algorithmically definable dynamics on very large networks. Using a perturbation transmission model inspired by communicating vessels, we define a novel centrality measure: perturbation centrality. Hubs and inter-modular nodes proved to be highly efficient in perturbation propagation. High perturbation centrality nodes of the Met-tRNA synthetase protein structure network were identified as amino acids involved in intra-protein communication by earlier studies. Changes in perturbation centralities of yeast interactome nodes upon various stresses well recapitulated the functional changes of stressed yeast cells. The novelty and usefulness of perturbation centrality was validated in several other model, biological and social networks. The Turbine software and the perturbation centrality measure may provide a large variety of novel options to assess signaling, drug action, environmental and social interventions.     

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.     

Model identification of signal transduction networks from data using a state regulator problem

Advances in molecular biology provide an opportunity to develop detailed models of biological processes that can be used to obtain an integrated understanding of the system. However, development of useful models from the available knowledge of the system and experimental observations still remains a daunting task. In this work, a model identification strategy for complex biological networks is proposed. The approach includes a state regulator problem (SRP) that provides estimates of all the component concentrations and the reaction rates of the network using the available measurements. The full set of the estimates is utilised for model parameter identification for the network of known topology. An a priori model complexity test that indicates the feasibility of performance of the proposed algorithm is developed. Fisher information matrix (FIM) theory is used to address model identifiability issues. Two signalling pathway case studies, the caspase function in apoptosis and the MAP kinase cascade system, are considered. The MAP kinase cascade, with measurements restricted to protein complex concentrations, fails the a priori test and the SRP estimates are poor as expected. The apoptosis network structure used in this work has moderate complexity and is suitable for application of the proposed tools. Using a measurement set of seven protein concentrations, accurate estimates for all unknowns are obtained. Furthermore, the effects of measurement sampling frequency and quality of information in the measurement set on the performance of the identified model are described.     

Complexity management in visualizing protein interaction networks

MOTIVATION: Protein-protein interaction networks often consist of thousands of nodes or more. This severely limits the utility of many graph drawing tools because they become too slow for an interactive analysis of the networks and because they produce cluttered drawings with many edge crossings. RESULTS: A new layout algorithm with complexity management operations in visualizing a large-scale protein interaction network was developed and implemented in a program called InterViewer3. InterViewer3 simplifies a complex network by collapsing a group of nodes with the same interacting partners into a composite node and by replacing a clique with a star-shaped subgraph. The experimental results demonstrated that InterViewer3 is one order of magnitude faster than the other drawing programs and that its complexity management is successful.     

Effects of different types of low‐intensity management on plant‐pollinator interactions in Estonian grasslands

In the face of global pollinator decline, extensively managed grasslands play an important role in supporting stable pollinator communities. However, different types of extensive management may promote particular plant species and thus particular functional traits. As the functional traits of flowering plant species (e.g., flower size and shape) in a habitat help determine the identity and frequency of pollinator visitors, they can also influence the structures of plant−pollinator interaction networks (i.e., pollination networks). The aim of this study was to examine how the type of low‐intensity traditional management influences plant and pollinator composition, the structure of plant−pollinator interactions, and their mediation by floral and insect functional traits. Specifically, we compared mown wooded meadows to grazed alvar pastures in western Estonia. We found that both management types fostered equal diversity of plants and pollinators, and overlapping, though still distinct, plant and pollinator compositions. Wooded meadow pollination networks had significantly higher connectance and specialization, while alvar pasture networks achieved higher interaction diversity at a standardized sampling of interactions. Pollinators with small body sizes and short proboscis lengths were more specialized in their preference for particular plant species and the specialization of individual pollinators was higher in alvar pastures than in wooded meadows. All in all, the two management types promoted diverse plant and pollinator communities, which enabled the development of equally even and nested pollination networks. The same generalist plant and pollinator species were important for the pollination networks of both wooded meadows and alvar pastures; however, they were complemented by management‐specific species, which accounted for differences in network structure. Therefore, the implementation of both management types in the same landscape helps to maintain high species and interaction diversity.     

Inferring biomolecular regulatory networks from phase portraits of time-series expression profiles

Reverse engineering of biomolecular regulatory networks such as gene regulatory networks, protein interaction networks, and metabolic networks has received an increasing attention as more high-throughput time-series measurements become available. In spite of various approaches developed from this motivation, it still remains as a challenging subject to develop a new reverse engineering scheme that can effectively uncover the functional interaction structure of a biomolecular network from given time-series expression profiles (TSEPs). We propose a new reverse engineering scheme that makes use of phase portraits constructed by projection of every two TSEPs into respective phase planes. We introduce two measures of a slope index (SI) and a winding index (WI) to quantify the interaction properties embedded in the phase portrait. Based on the SI and WI, we can reconstruct the functional interaction network in a very efficient and systematic way with better inference results compared to previous approaches. By using the SI, we can also estimate the time-lag accompanied with the interaction between molecular components of a network.     

Using Knowledge of Protein Structural Constraints to Predict the Evolution of HIV-1

The high levels of sequence diversity and rapid rates of evolution of HIV-1 represent the main challenges for developing effective therapies. However, there are constraints imposed by the three-dimensional protein structure that affect the sequence space accessible to the evolution of HIV-1. Here, we present a strategy for predicting the set of possible amino acid replacements in HIV. Our approach is based on the identification of likely amino acid changes in the context of these structural constraints using environment-specific substitution matrices as well as considering the physical constraints imposed by local structure. Assessment of the power of various published algorithms in predicting the evolution of HIV-1 Gag P17 shows that it is possible to use these methods to make accurate predictions of the sequence diversity. Our own method, SubFit, uses knowledge of local structural constraints; it achieves similar prediction success with the best-performing methods. We also show that erroneous predictions are largely due to infrequently occurring amino acids that will probably have severe fitness costs for the protein. Future improvements; for example, incorporating covariation and immunological constraints will permit more reliable prediction of viral evolution.     

Complexity of multitrophic interactions in a grassland ecosystem depends on plant species diversity

1.?We studied the theoretical prediction that a loss of plant species richness has a strong impact on community interactions among all trophic levels and tested whether decreased plant species diversity results in a less complex structure and reduced interactions in ecological networks. 2.?Using plant species-specific biomass and arthropod abundance data from experimental grassland plots (Jena Experiment), we constructed multitrophic functional group interaction webs to compare communities based on 4 and 16 plant species. 427 insect and spider species were classified into 13 functional groups. These functional groups represent the nodes of ecological networks. Direct and indirect interactions among them were assessed using partial Mantel tests. Interaction web complexity was quantified using three measures of network structure: connectance, interaction diversity and interaction strength. 3.?Compared with high plant diversity plots, interaction webs based on low plant diversity plots showed reduced complexity in terms of total connectance, interaction diversity and mean interaction strength. Plant diversity effects obviously cascade up the food web and modify interactions across all trophic levels. The strongest effects occurred in interactions between adjacent trophic levels (i.e. predominantly trophic interactions), while significant interactions among plant and carnivore functional groups, as well as horizontal interactions (i.e. interactions between functional groups of the same trophic level), showed rather inconsistent responses and were generally rarer. 4.?Reduced interaction diversity has the potential to decrease and destabilize ecosystem processes. Therefore, we conclude that the loss of basal producer species leads to more simple structured, less and more loosely connected species assemblages, which in turn are very likely to decrease ecosystem functioning, community robustness and tolerance to disturbance. Our results suggest that the functioning of the entire ecological community is critically linked to the diversity of its component plants species.     

Hub-centered gene network reconstruction using automatic relevance determination

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

A unified framework for unraveling the functional interaction structure of a biomolecular network based on stimulus-response experimental data

We propose a unified framework for the identification of functional interaction structures of biomolecular networks in a way that leads to a new experimental design procedure. In developing our approach, we have built upon previous work. Thus we begin by pointing out some of the restrictions associated with existing structure identification methods and point out how these restrictions may be eased. In particular, existing methods use specific forms of experimental algebraic equations with which to identify the functional interaction structure of a biomolecular network. In our work, we employ an extended form of these experimental algebraic equations which, while retaining their merits, also overcome some of their disadvantages. Experimental data are required in order to estimate the coefficients of the experimental algebraic equation set associated with the structure identification task. However, experimentalists are rarely provided with guidance on which parameters to perturb, and to what extent, to perturb them. When a model of network dynamics is required then there is also the vexed question of sample rate and sample time selection to be resolved. Supplying some answers to these questions is the main motivation of this paper. The approach is based on stationary and/or temporal data obtained from parameter perturbations, and unifies the previous approaches of Kholodenko et al. (PNAS 99 (2002) 12841-12846) and Sontag et al. (Bioinformatics 20 (2004) 1877-1886). By way of demonstration, we apply our unified approach to a network model which cannot be properly identified by existing methods. Finally, we propose an experiment design methodology, which is not limited by the amount of parameter perturbations, and illustrate its use with an in numero example.     

Difference in gene duplicability may explain the difference in overall structure of protein-protein interaction networks among eukaryotes

Background  

A protein-protein interaction network (PIN) was suggested to be a disassortative network, in which interactions between high- and low-degree nodes are favored while hub-hub interactions are suppressed. It was postulated that a disassortative structure minimizes unfavorable cross-talks between different hub-centric functional modules and was positively selected in evolution. However, by re-examining yeast PIN data, several researchers reported that the disassortative structure observed in a PIN might be an experimental artifact. Therefore, the existence of a disassortative structure and its possible evolutionary mechanism remains unclear.