Comparing statistical methods for constructing large scale gene networks

The gene regulatory network (GRN) reveals the regulatory relationships among genes and can provide a systematic understanding of molecular mechanisms underlying biological processes. The importance of computer simulations in understanding cellular processes is now widely accepted; a variety of algorithms have been developed to study these biological networks. The goal of this study is to provide a comprehensive evaluation and a practical guide to aid in choosing statistical methods for constructing large scale GRNs. Using both simulation studies and a real application in E. coli data, we compare different methods in terms of sensitivity and specificity in identifying the true connections and the hub genes, the ease of use, and computational speed. Our results show that these algorithms performed reasonably well, and each method has its own advantages: (1) GeneNet, WGCNA (Weighted Correlation Network Analysis), and ARACNE (Algorithm for the Reconstruction of Accurate Cellular Networks) performed well in constructing the global network structure; (2) GeneNet and SPACE (Sparse PArtial Correlation Estimation) performed well in identifying a few connections with high specificity.     

A Systems-Genetics Approach and Data Mining Tool to Assist in the Discovery of Genes Underlying Complex Traits in Oryza sativa

Many traits of biological and agronomic significance in plants are controlled in a complex manner where multiple genes and environmental signals affect the expression of the phenotype. In Oryza sativa (rice), thousands of quantitative genetic signals have been mapped to the rice genome. In parallel, thousands of gene expression profiles have been generated across many experimental conditions. Through the discovery of networks with real gene co-expression relationships, it is possible to identify co-localized genetic and gene expression signals that implicate complex genotype-phenotype relationships. In this work, we used a knowledge-independent, systems genetics approach, to discover a high-quality set of co-expression networks, termed Gene Interaction Layers (GILs). Twenty-two GILs were constructed from 1,306 Affymetrix microarray rice expression profiles that were pre-clustered to allow for improved capture of gene co-expression relationships. Functional genomic and genetic data, including over 8,000 QTLs and 766 phenotype-tagged SNPs (p-value < = 0.001) from genome-wide association studies, both covering over 230 different rice traits were integrated with the GILs. An online systems genetics data-mining resource, the GeneNet Engine, was constructed to enable dynamic discovery of gene sets (i.e. network modules) that overlap with genetic traits. GeneNet Engine does not provide the exact set of genes underlying a given complex trait, but through the evidence of gene-marker correspondence, co-expression, and functional enrichment, site visitors can identify genes with potential shared causality for a trait which could then be used for experimental validation. A set of 2 million SNPs was incorporated into the database and serve as a potential set of testable biomarkers for genes in modules that overlap with genetic traits. Herein, we describe two modules found using GeneNet Engine, one with significant overlap with the trait amylose content and another with significant overlap with blast disease resistance.     

GeneNet database: description and modeling of gene networks

Almost all cellular processes in an organism are controlled by gene networks. Here we report on the analysis of gene networks functioning using two associated methods - data accumulation in GeneNet system and generalized chemical kinetic method for mathematical simulation of gene network functional dynamics. The technology of the usage of these methods is shown on the example of the gene network of macrophage activation.     

Modelling periodic oscillation in gene regulatory networks by cyclic feedback systems

In this paper, we develop a new methodology to analyze and design periodic oscillators of biological networks, in particular gene regulatory networks with multiple genes, proteins and time delays, by using negative cyclic feedback systems. We show that negative cyclic feedback networks have no stable equilibria but stable periodic orbits when certain conditions are satisfied. Specifically, we first prove the basic properties of the biological networks composed of cyclic feedback loops, and then extend our results to general cyclic feedback network with less restriction, thereby making our theoretical analysis and design of oscillators easy to implement, even for large-scale systems. Finally, we use one circadian network formed by a period protein (PER) and per mRNA, and one biologically plausible synthetic gene network, to demonstrate the theoretical results. Since there is less restriction on the network structure, the results of this paper can be expected to apply to a wide variety of areas on modelling, analyzing and designing of biological systems.     

Distinctive topologies of partner-switching signaling networks correlate with their physiological roles

Regulatory networks controlling bacterial gene expression often evolve from common origins and share homologous proteins and similar network motifs. However, when functioning in different physiological contexts, these motifs may be re-arranged with different topologies that significantly affect network performance. Here we analyze two related signaling networks in the bacterium Bacillus subtilis in order to assess the consequences of their different topologies, with the aim of formulating design principles applicable to other systems. These two networks control the activities of the general stress response factor sigma(B) and the first sporulation-specific factor sigma(F). Both networks have at their core a "partner-switching" mechanism, in which an anti-sigma factor forms alternate complexes either with the sigma factor, holding it inactive, or with an anti-anti-sigma factor, thereby freeing sigma. However, clear differences in network structure are apparent: the anti-sigma factor for sigma(F) forms a long-lived, "dead-end" complex with its anti-anti-sigma factor and ADP, whereas the genes encoding sigma(B) and its network partners lie in a sigma(B)-controlled operon, resulting in positive and negative feedback loops. We constructed mathematical models of both networks and examined which features were critical for the performance of each design. The sigma(F) model predicts that the self-enhancing formation of the dead-end complex transforms the network into a largely irreversible hysteretic switch; the simulations reported here also demonstrate that hysteresis and slow turn off kinetics are the only two system properties associated with this complex formation. By contrast, the sigma(B) model predicts that the positive and negative feedback loops produce graded, reversible behavior with high regulatory capacity and fast response time. Our models demonstrate how alterations in network design result in different system properties that correlate with regulatory demands. These design principles agree with the known or suspected roles of similar networks in diverse bacteria.     

Stochastic Models and Numerical Algorithms for a Class of Regulatory Gene Networks

Regulatory gene networks contain generic modules, like those involving feedback loops, which are essential for the regulation of many biological functions (Guido et al. in Nature 439:856–860, 2006). We consider a class of self-regulated genes which are the building blocks of many regulatory gene networks, and study the steady-state distribution of the associated Gillespie algorithm by providing efficient numerical algorithms. We also study a regulatory gene network of interest in gene therapy, using mean-field models with time delays. Convergence of the related time-nonhomogeneous Markov chain is established for a class of linear catalytic networks with feedback loops.     

Reconstruction of Cellular Signal Transduction Networks Using Perturbation Assays and Linear Programming

Perturbation experiments for example using RNA interference (RNAi) offer an attractive way to elucidate gene function in a high throughput fashion. The placement of hit genes in their functional context and the inference of underlying networks from such data, however, are challenging tasks. One of the problems in network inference is the exponential number of possible network topologies for a given number of genes. Here, we introduce a novel mathematical approach to address this question. We formulate network inference as a linear optimization problem, which can be solved efficiently even for large-scale systems. We use simulated data to evaluate our approach, and show improved performance in particular on larger networks over state-of-the art methods. We achieve increased sensitivity and specificity, as well as a significant reduction in computing time. Furthermore, we show superior performance on noisy data. We then apply our approach to study the intracellular signaling of human primary nave CD4⁺ T-cells, as well as ErbB signaling in trastuzumab resistant breast cancer cells. In both cases, our approach recovers known interactions and points to additional relevant processes. In ErbB signaling, our results predict an important role of negative and positive feedback in controlling the cell cycle progression.     

Noise Propagation in Gene Regulation Networks Involving Interlinked Positive and Negative Feedback Loops

It is well known that noise is inevitable in gene regulatory networks due to the low-copy numbers of molecules and local environmental fluctuations. The prediction of noise effects is a key issue in ensuring reliable transmission of information. Interlinked positive and negative feedback loops are essential signal transduction motifs in biological networks. Positive feedback loops are generally believed to induce a switch-like behavior, whereas negative feedback loops are thought to suppress noise effects. Here, by using the signal sensitivity (susceptibility) and noise amplification to quantify noise propagation, we analyze an abstract model of the Myc/E2F/MiR-17-92 network that is composed of a coupling between the E2F/Myc positive feedback loop and the E2F/Myc/miR-17-92 negative feedback loop. The role of the feedback loop on noise effects is found to depend on the dynamic properties of the system. When the system is in monostability or bistability with high protein concentrations, noise is consistently suppressed. However, the negative feedback loop reduces this suppression ability (or improves the noise propagation) and enhances signal sensitivity. In the case of excitability, bistability, or monostability, noise is enhanced at low protein concentrations. The negative feedback loop reduces this noise enhancement as well as the signal sensitivity. In all cases, the positive feedback loop acts contrary to the negative feedback loop. We also found that increasing the time scale of the protein module or decreasing the noise autocorrelation time can enhance noise suppression; however, the systems sensitivity remains unchanged. Taken together, our results suggest that the negative/positive feedback mechanisms in coupled feedback loop dynamically buffer noise effects rather than only suppressing or amplifying the noise.     

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.