Recovering context-specific gene network modules from expression data: A brief review

With the popularization of microarray experiments in biomedical laboratories, how to make contextspecific knowledge discovery from expression data becomes a hot topic. While the static “reference networks” for key model organisms are nearly at hand, the endeavors to recover context-specific network modules are still at the beginning. Currently, this is achieved through filtering existing edges of the ensemble reference network or constructing gene networks ab initio. In this paper, we briefly review recent progress in the field and point out some research directions awaiting improved work, including expression-data-guided revision of reference networks.     

Social experience organizes parallel networks in sensory and limbic forebrain

Successful social behavior can directly influence an individual's reproductive success. Therefore, many organisms readily modify social behavior based on past experience. The neural changes induced by social experience, however, remain to be fully elucidated. We hypothesize that social modulation of neural systems not only occurs at the level of individual nuclei, but also of functional networks, and their relationships with behavior. We used the green anole lizard (Anolis carolinensis), which displays stereotyped, visually triggered social behaviors particularly suitable for comparisons of multiple functional networks in a social context, to test whether repeated aggressive interactions modify behavior and metabolic activity in limbic-hypothalamic and sensory forebrain regions, assessed by quantitative cytochrome oxidase (a slowly accumulating endogenous metabolic marker) histochemistry. We found that aggressive interactions potentiate aggressive behavior, induce changes in activities of individual nuclei, and organize context-specific functional neural networks. Surprisingly, this experiential effect is not only present in a limbic-hypothalamic network, but also extends to a sensory forebrain network directly relevant to the behavioral expression. Our results suggest that social experience modulates organisms' social behavior via modifying sensory and limbic neural systems in parallel both at the levels of individual regions and networks, potentially biasing perceptual as well as limbic processing.     

Homologous control of protein signaling networks

In a previous paper we introduced a method called augmented sparse reconstruction (ASR) that identifies links among nodes of ordinary differential equation networks, given a small set of observed trajectories with various initial conditions. The main purpose of that technique was to reconstruct intracellular protein signaling networks.In this paper we show that a recursive augmented sparse reconstruction generates artificial networks that are homologous to a large, reference network, in the sense that kinase inhibition of several reactions in the network alters the trajectories of a sizable number of proteins in comparable ways for reference and reconstructed networks. We show this result using a large in-silico model of the epidermal growth factor receptor (EGF-R) driven signaling cascade to generate the data used in the reconstruction algorithm.The most significant consequence of this observed homology is that a nearly optimal combinatorial dosage of kinase inhibitors can be inferred, for many nodes, from the reconstructed network, a result potentially useful for a variety of applications in personalized medicine.     

Multi-Edge Gene Set Networks Reveal Novel Insights into Global Relationships between Biological Themes

Curated gene sets from databases such as KEGG Pathway and Gene Ontology are often used to systematically organize lists of genes or proteins derived from high-throughput data. However, the information content inherent to some relationships between the interrogated gene sets, such as pathway crosstalk, is often underutilized. A gene set network, where nodes representing individual gene sets such as KEGG pathways are connected to indicate a functional dependency, is well suited to visualize and analyze global gene set relationships. Here we introduce a novel gene set network construction algorithm that integrates gene lists derived from high-throughput experiments with curated gene sets to construct co-enrichment gene set networks. Along with previously described co-membership and linkage algorithms, we apply the co-enrichment algorithm to eight gene set collections to construct integrated multi-evidence gene set networks with multiple edge types connecting gene sets. We demonstrate the utility of approach through examples of novel gene set networks such as the chromosome map co-differential expression gene set network. A total of twenty-four gene set networks are exposed via a web tool called MetaNet, where context-specific multi-edge gene set networks are constructed from enriched gene sets within user-defined gene lists. MetaNet is freely available at http://blaispathways.dfci.harvard.edu/metanet/.     

Neutral space analysis for a Boolean network model of the fission yeast cell cycle network

Background

Interactions between genes and their products give rise to complex circuits known as gene regulatory networks (GRN) that enable cells to process information and respond to external stimuli. Several important processes for life, depend of an accurate and context-specific regulation of gene expression, such as the cell cycle, which can be analyzed through its GRN, where deregulation can lead to cancer in animals or a directed regulation could be applied for biotechnological processes using yeast. An approach to study the robustness of GRN is through the neutral space. In this paper, we explore the neutral space of a Schizosaccharomyces pombe (fission yeast) cell cycle network through an evolution strategy to generate a neutral graph, composed of Boolean regulatory networks that share the same state sequences of the fission yeast cell cycle.

Results

Through simulations it was found that in the generated neutral graph, the functional networks that are not in the wildtype connected component have in general a Hamming distance more than 3 with the wildtype, and more than 10 between the other disconnected functional networks. Significant differences were found between the functional networks in the connected component of the wildtype network and the rest of the network, not only at a topological level, but also at the state space level, where significant differences in the distribution of the basin of attraction for the G₁ fixed point was found for deterministic updating schemes.

Conclusions

In general, functional networks in the wildtype network connected component, can mutate up to no more than 3 times, then they reach a point of no return where the networks leave the connected component of the wildtype. The proposed method to construct a neutral graph is general and can be used to explore the neutral space of other biologically interesting networks, and also formulate new biological hypotheses studying the functional networks in the wildtype network connected component.     

Context-specific network modeling identifies new crosstalk in β-adrenergic cardiac hypertrophy

Cardiac hypertrophy is a context-dependent phenomenon wherein a myriad of biochemical and biomechanical factors regulate myocardial growth through a complex large-scale signaling network. Although numerous studies have investigated hypertrophic signaling pathways, less is known about hypertrophy signaling as a whole network and how this network acts in a context-dependent manner. Here, we developed a systematic approach, CLASSED (Context-specific Logic-bASed Signaling nEtwork Development), to revise a large-scale signaling model based on context-specific data and identify main reactions and new crosstalks regulating context-specific response. CLASSED involves four sequential stages with an automated validation module as a core which builds a logic-based ODE model from the interaction graph and outputs the model validation percent. The context-specific model is developed by estimation of default parameters, classified qualitative validation, hybrid Morris-Sobol global sensitivity analysis, and discovery of missing context-dependent crosstalks. Applying this pipeline to our prior-knowledge hypertrophy network with context-specific data revealed key signaling reactions which distinctly regulate cell response to isoproterenol, phenylephrine, angiotensin II and stretch. Furthermore, with CLASSED we developed a context-specific model of β-adrenergic cardiac hypertrophy. The model predicted new crosstalks between calcium/calmodulin-dependent pathways and upstream signaling of Ras in the ISO-specific context. Experiments in cardiomyocytes validated the model’s predictions on the role of CaMKII-Gβγ and CaN-Gβγ interactions in mediating hypertrophic signals in ISO-specific context and revealed a difference in the phosphorylation magnitude and translocation of ERK1/2 between cardiac myocytes and fibroblasts. CLASSED is a systematic approach for developing context-specific large-scale signaling networks, yielding insights into new-found crosstalks in β-adrenergic cardiac hypertrophy.     

Gene network inference using continuous time Bayesian networks: a comparative study and application to Th17 cell differentiation

Background

Dynamic aspects of gene regulatory networks are typically investigated by measuring system variables at multiple time points. Current state-of-the-art computational approaches for reconstructing gene networks directly build on such data, making a strong assumption that the system evolves in a synchronous fashion at fixed points in time. However, nowadays omics data are being generated with increasing time course granularity. Thus, modellers now have the possibility to represent the system as evolving in continuous time and to improve the models’ expressiveness.

Results

Continuous time Bayesian networks are proposed as a new approach for gene network reconstruction from time course expression data. Their performance was compared to two state-of-the-art methods: dynamic Bayesian networks and Granger causality analysis. On simulated data, the methods comparison was carried out for networks of increasing size, for measurements taken at different time granularity densities and for measurements unevenly spaced over time. Continuous time Bayesian networks outperformed the other methods in terms of the accuracy of regulatory interactions learnt from data for all network sizes. Furthermore, their performance degraded smoothly as the size of the network increased. Continuous time Bayesian networks were significantly better than dynamic Bayesian networks for all time granularities tested and better than Granger causality for dense time series. Both continuous time Bayesian networks and Granger causality performed robustly for unevenly spaced time series, with no significant loss of performance compared to the evenly spaced case, while the same did not hold true for dynamic Bayesian networks. The comparison included the IRMA experimental datasets which confirmed the effectiveness of the proposed method. Continuous time Bayesian networks were then applied to elucidate the regulatory mechanisms controlling murine T helper 17 (Th17) cell differentiation and were found to be effective in discovering well-known regulatory mechanisms, as well as new plausible biological insights.

Conclusions

Continuous time Bayesian networks were effective on networks of both small and large size and were particularly feasible when the measurements were not evenly distributed over time. Reconstruction of the murine Th17 cell differentiation network using continuous time Bayesian networks revealed several autocrine loops, suggesting that Th17 cells may be auto regulating their own differentiation process.     

酵母转录调控协作网络的分析

协作网通常被用于描述各种社会关系,相似的概念也可以应用到转录调控网络的研究中.针对被调控基因共享转录因子的相似性,可以建立一个被调控基因协作网,同样,根据转录因子调控基因的相似性可以建立一个相对较小的转录因子协作网.对被调控基因协作网的聚类研究发现,大部分的类都显著地富集一个或者多个GO功能注释.进一步的结果分析发现某些GO注释的基因更倾向于共享相似的调控机制.这表明,在协作网中,相对简单的调控机制相似性能捕捉生物功能相关的信息.并且,将在二部图分析中使用的概念--"异常点"引入到协作网的分析中,发现协作网的异常点和致死基因有相关性.综上所述,协作网的方法是分析转录调控网络的一个有用的补充.     

Boolean dynamics of Kauffman models with a scale-free network

We studied the Boolean dynamics of the "quenched" Kauffman models with a directed scale-free network, comparing with that of the original directed random Kauffman networks and that of the directed exponential-fluctuation networks. We have numerically investigated the distributions of the state cycle lengths and its changes as the network size N and the average degree k of nodes increase. In the relatively small network (N approximately 150), the median, the mean value and the standard deviation grow exponentially with N in the directed scale-free and the directed exponential-fluctuation networks with k=2, where the function forms of the distributions are given as an almost exponential. We have found that for the relatively large N approximately 10(3) the growth of the median of the distribution over the attractor lengths asymptotically changes from algebraic type to exponential one as the average degree k goes to k=2. The result supports the existence of the transition at k(c)=2 derived in the annealed model.     

Inferring models of gene expression dynamics

We study the problem of identifying genetic networks in which expression dynamics are modeled by a differential equation that uses logical rules to specify time derivatives. We make three main contributions. First, we describe computationally efficient procedures for identifying the structure and dynamics of such networks from expression time series. Second, we derive predictions for the expected amount of data needed to identify randomly generated networks. Third, if expression values are available for only some of the genes, we show that the structure of the network for these "visible" genes can be identified and that the size and overall complexity of the network can be estimated. We validate these procedures and predictions using simulation experiments based on randomly generated networks with up to 30,000 genes and 17 distinct regulators per gene and on a network that models floral morphogenesis in Arabidopsis thaliana.     

Context-specific protein network miner--an online system for exploring context-specific protein interaction networks from the literature

Background

Protein interaction networks (PINs) specific within a particular context contain crucial information regarding many cellular biological processes. For example, PINs may include information on the type and directionality of interaction (e.g. phosphorylation), location of interaction (i.e. tissues, cells), and related diseases. Currently, very few tools are capable of deriving context-specific PINs for conducting exploratory analysis.

Results

We developed a literature-based online system, Context-specific Protein Network Miner (CPNM), which derives context-specific PINs in real-time from the PubMed database based on a set of user-input keywords and enhanced PubMed query system. CPNM reports enriched information on protein interactions (with type and directionality), their network topology with summary statistics (e.g. most densely connected proteins in the network; most densely connected protein-pairs; and proteins connected by most inbound/outbound links) that can be explored via a user-friendly interface. Some of the novel features of the CPNM system include PIN generation, ontology-based PubMed query enhancement, real-time, user-queried, up-to-date PubMed document processing, and prediction of PIN directionality.

Conclusions

CPNM provides a tool for biologists to explore PINs. It is freely accessible at http://www.biotextminer.com/CPNM/.     

The relative efficiency of modular and non-modular networks of different size

Most biological networks are modular but previous work with small model networks has indicated that modularity does not necessarily lead to increased functional efficiency. Most biological networks are large, however, and here we examine the relative functional efficiency of modular and non-modular neural networks at a range of sizes. We conduct a detailed analysis of efficiency in networks of two size classes: ‘small’ and ‘large’, and a less detailed analysis across a range of network sizes. The former analysis reveals that while the modular network is less efficient than one of the two non-modular networks considered when networks are small, it is usually equally or more efficient than both non-modular networks when networks are large. The latter analysis shows that in networks of small to intermediate size, modular networks are much more efficient that non-modular networks of the same (low) connective density. If connective density must be kept low to reduce energy needs for example, this could promote modularity. We have shown how relative functionality/performance scales with network size, but the precise nature of evolutionary relationship between network size and prevalence of modularity will depend on the costs of connectivity.     

Theory of interface: Category theory,directed networks and evolution of biological networks

Biological networks have two modes. The first mode is static: a network is a passage on which something flows. The second mode is dynamic: a network is a pattern constructed by gluing functions of entities constituting the network. In this paper, first we discuss that these two modes can be associated with the category theoretic duality (adjunction) and derive a natural network structure (a path notion) for each mode by appealing to the category theoretic universality. The path notion corresponding to the static mode is just the usual directed path. The path notion for the dynamic mode is called lateral path which is the alternating path considered on the set of arcs. Their general functionalities in a network are transport and coherence, respectively. Second, we introduce a betweenness centrality of arcs for each mode and see how the two modes are embedded in various real biological network data. We find that there is a trade-off relationship between the two centralities: if the value of one is large then the value of the other is small. This can be seen as a kind of division of labor in a network into transport on the network and coherence of the network. Finally, we propose an optimization model of networks based on a quality function involving intensities of the two modes in order to see how networks with the above trade-off relationship can emerge through evolution. We show that the trade-off relationship can be observed in the evolved networks only when the dynamic mode is dominant in the quality function by numerical simulations. We also show that the evolved networks have features qualitatively similar to real biological networks by standard complex network analysis.     

BIOREL: the benchmark resource to estimate the relevance of the gene networks

The progress of high-throughput methodologies in functional genomics has lead to the development of statistical procedures to infer gene networks from various types of high-throughput data. However, due to the lack of common standards, the biological significance of the results of the different studies is hard to compare. To overcome this problem we propose a benchmark procedure and have developed a web resource (BIOREL), which is useful for estimating the biological relevance of any genetic network by integrating different sources of biological information. The associations of each gene from the network are classified as biologically relevant or not. The proportion of genes in the network classified as "relevant" is used as the overall network relevance score. Employing synthetic data we demonstrated that such a score ranks the networks fairly in respect to the relevance level. Using BIOREL as the benchmark resource we compared the quality of experimental and theoretically predicted protein interaction data.     

Fast Reconstruction of Compact Context-Specific Metabolic Network Models

Systemic approaches to the study of a biological cell or tissue rely increasingly on the use of context-specific metabolic network models. The reconstruction of such a model from high-throughput data can routinely involve large numbers of tests under different conditions and extensive parameter tuning, which calls for fast algorithms. We present fastcore, a generic algorithm for reconstructing context-specific metabolic network models from global genome-wide metabolic network models such as Recon X. fastcore takes as input a core set of reactions that are known to be active in the context of interest (e.g., cell or tissue), and it searches for a flux consistent subnetwork of the global network that contains all reactions from the core set and a minimal set of additional reactions. Our key observation is that a minimal consistent reconstruction can be defined via a set of sparse modes of the global network, and fastcore iteratively computes such a set via a series of linear programs. Experiments on liver data demonstrate speedups of several orders of magnitude, and significantly more compact reconstructions, over a rival method. Given its simplicity and its excellent performance, fastcore can form the backbone of many future metabolic network reconstruction algorithms.