Inferring the perturbed microRNA regulatory networks from gene expression data using a network propagation based method

Background

MicroRNAs (miRNAs) are a class of endogenous small regulatory RNAs. Identifications of the dys-regulated or perturbed miRNAs and their key target genes are important for understanding the regulatory networks associated with the studied cellular processes. Several computational methods have been developed to infer the perturbed miRNA regulatory networks by integrating genome-wide gene expression data and sequence-based miRNA-target predictions. However, most of them only use the expression information of the miRNA direct targets, rarely considering the secondary effects of miRNA perturbation on the global gene regulatory networks.

Results

We proposed a network propagation based method to infer the perturbed miRNAs and their key target genes by integrating gene expressions and global gene regulatory network information. The method used random walk with restart in gene regulatory networks to model the network effects of the miRNA perturbation. Then, it evaluated the significance of the correlation between the network effects of the miRNA perturbation and the gene differential expression levels with a forward searching strategy. Results show that our method outperformed several compared methods in rediscovering the experimentally perturbed miRNAs in cancer cell lines. Then, we applied it on a gene expression dataset of colorectal cancer clinical patient samples and inferred the perturbed miRNA regulatory networks of colorectal cancer, including several known oncogenic or tumor-suppressive miRNAs, such as miR-17, miR-26 and miR-145.

Conclusions

Our network propagation based method takes advantage of the network effect of the miRNA perturbation on its target genes. It is a useful approach to infer the perturbed miRNAs and their key target genes associated with the studied biological processes using gene expression data.

Electronic supplementary material

The online version of this article (doi:10.1186/1471-2105-15-255) contains supplementary material, which is available to authorized users.     

Algebraic connectivity may explain the evolution of gene regulatory networks

Gene expression is a result of the interplay between the structure, type, kinetics, and specificity of gene regulatory interactions, whose diversity gives rise to the variety of life forms. As the dynamic behavior of gene regulatory networks depends on their structure, here we attempt to determine structural reasons which, despite the similarities in global network properties, may explain the large differences in organismal complexity. We demonstrate that the algebraic connectivity, the smallest non-trivial eigenvalue of the Laplacian, of the directed gene regulatory networks decreases with the increase of organismal complexity, and may therefore explain the difference between the variety of analyzed regulatory networks. In addition, our results point out that, for the species considered in this study, evolution favours decreasing concentration of strategically positioned feed forward loops, so that the network as a whole can increase the specificity towards changing environments. Moreover, contrary to the existing results, we show that the average degree, the length of the longest cascade, and the average cascade length of gene regulatory networks cannot recover the evolutionary relationships between organisms. Whereas the dynamical properties of special subnetworks are relatively well understood, there is still limited knowledge about the evolutionary reasons for the already identified design principles pertaining to these special subnetworks, underlying the global quantitative features of gene regulatory networks of different organisms. The behavior of the algebraic connectivity, which we show valid on gene regulatory networks extracted from curated databases, can serve as an additional evolutionary principle of organism-specific regulatory networks.     

A novel model-free approach for reconstruction of time-delayed gene regulatory networks

Many important biological processes (e.g. cellular differentiation during development, aging, disease etiology etc.) are very unlikely controlled by a single gene instead by the underlying complex regulatory interactions between thousands of genes within …     

Reliability of regulatory networks and its evolution

The problem of reliability of the dynamics in biological regulatory networks is studied in the framework of a generalized Boolean network model with continuous timing and noise. Using well-known artificial genetic networks such as the repressilator, we discuss concepts of reliability of rhythmic attractors. In a simple evolution process we investigate how overall network structure affects the reliability of the dynamics. In the course of the evolution, networks are selected for reliable dynamics. We find that most networks can be easily evolved towards reliable functioning while preserving the original function.     

A multi-objective differential evolutionary approach toward more stable gene regulatory networks

Models are of central importance in many scientific contexts. Mathematical and computational modeling of genetic regulatory networks promises to uncover the fundamental principles of living systems. Biological models, such as gene regulatory models, can help us better understand interactions among genes and how cells regulate their production of proteins and enzymes. One feature shared among living systems is their ability to cope with perturbations and remain stable, a property that is the result of evolutionary fine-tuning over many generations. In this study we use random Boolean networks (RBNs) as an abstract model of gene regulatory systems. By applying Differential Evolution (DE), an evolution-based optimization technique, we produce networks with increased stability. DE requires relatively few user-specified parameters, has fast convergence and does not rely on initial conditions to find the global minima within multi-dimensional search spaces.     

Dynamical approaches to modeling developmental gene regulatory networks

The network of interacting regulatory signals within a cell comprises one of the most complex and powerful computational systems in biology. Gene regulatory networks (GRNs) play a key role in transforming the information encoded in a genome into morphological form. To achieve this feat, GRNs must respond to and integrate environmental signals with their internal dynamics in a robust and coordinated fashion. The highly dynamic nature of this process lends itself to interpretation and analysis in the language of dynamical models. Modeling provides a means of systematically untangling the complicated structure of GRNs, a framework within which to simulate the behavior of reconstructed systems and, in some cases, suites of analytic tools for exploring that behavior and its implications. This review provides a general background to the idea of treating a regulatory network as a dynamical system, and describes a variety of different approaches that have been taken to the dynamical modeling of GRNs. Birth Defects Research (Part C) 87:131–142, 2009. © 2009 Wiley‐Liss, Inc.     

Preservation of dynamic properties in qualitative modeling frameworks for gene regulatory networks

Mathematical modeling often helps to provide a systems perspective on gene regulatory networks. In particular, qualitative approaches are useful when detailed kinetic information is lacking. Multiple methods have been developed that implement qualitative information in different ways, e.g., in purely discrete or hybrid discrete/continuous models. In this paper, we compare the discrete asynchronous logical modeling formalism for gene regulatory networks due to R. Thomas with piecewise affine differential equation models. We provide a local characterization of the qualitative dynamics of a piecewise affine differential equation model using the discrete dynamics of a corresponding Thomas model. Based on this result, we investigate the consistency of higher-level dynamical properties such as attractor characteristics and reachability. We show that although the two approaches are based on equivalent information, the resulting qualitative dynamics are different. In particular, the dynamics of the piecewise affine differential equation model is not a simple refinement of the dynamics of the Thomas model     

Towards precise reconstruction of gene regulatory networks by data integration

Background: More and more high-throughput datasets are available from multiple levels of measuring gene regulations. The reverse engineering of gene regulatory networks from these data offers a valuable research paradigm to decipher regulatory mechanisms. So far, numerous methods have been developed for reconstructing gene regulatory networks. Results: In this paper, we provide a review of bioinformatics methods for inferring gene regulatory network from omics data. To achieve the precision reconstruction of gene regulatory networks, an intuitive alternative is to integrate these available resources in a rational framework. We also provide computational perspectives in the endeavors of inferring gene regulatory networks from heterogeneous data. We highlight the importance of multi-omics data integration with prior knowledge in gene regulatory network inferences. Conclusions: We provide computational perspectives of inferring gene regulatory networks from multiple omics data and present theoretical analyses of existing challenges and possible solutions. We emphasize on prior knowledge and data integration in network inferences owing to their abilities of identifying regulatory causality.     

Synthetic circuits reveal how mechanisms of gene regulatory networks constrain evolution

Phenotypic variation is the raw material of adaptive Darwinian evolution. The phenotypic variation found in organismal development is biased towards certain phenotypes, but the molecular mechanisms behind such biases are still poorly understood. Gene regulatory networks have been proposed as one cause of constrained phenotypic variation. However, most pertinent evidence is theoretical rather than experimental. Here, we study evolutionary biases in two synthetic gene regulatory circuits expressed in Escherichia coli that produce a gene expression stripe—a pivotal pattern in embryonic development. The two parental circuits produce the same phenotype, but create it through different regulatory mechanisms. We show that mutations cause distinct novel phenotypes in the two networks and use a combination of experimental measurements, mathematical modelling and DNA sequencing to understand why mutations bring forth only some but not other novel gene expression phenotypes. Our results reveal that the regulatory mechanisms of networks restrict the possible phenotypic variation upon mutation. Consequently, seemingly equivalent networks can indeed be distinct in how they constrain the outcome of further evolution.     

An analysis of the class of gene regulatory functions implied by a biochemical model

Understanding the integrated behavior of genetic regulatory networks, in which genes regulate one another's activities via RNA and protein products, is emerging as a dominant problem in systems biology. One widely studied class of models of such networks includes genes whose expression values assume Boolean values (i.e., on or off). Design decisions in the development of Boolean network models of gene regulatory systems include the topology of the network (including the distribution of input- and output-connectivity) and the class of Boolean functions used by each gene (e.g., canalizing functions, post functions, etc.). For example, evidence from simulations suggests that biologically realistic dynamics can be produced by scale-free network topologies with canalizing Boolean functions. This work seeks further insights into the design of Boolean network models through the construction and analysis of a class of models that include more concrete biochemical mechanisms than the usual abstract model, including genes and gene products, dimerization, cis-binding sites, promoters and repressors. In this model, it is assumed that the system consists of N genes, with each gene producing one protein product. Proteins may form complexes such as dimers, trimers, etc. The model also includes cis-binding sites to which proteins may bind to form activators or repressors. Binding affinities are based on structural complementarity between proteins and binding sites, with molecular binding sites modeled by bit-strings. Biochemically plausible gene expression rules are used to derive a Boolean regulatory function for each gene in the system. The result is a network model in which both topological features and Boolean functions arise as emergent properties of the interactions of components at the biochemical level. A highly biased set of Boolean functions is observed in simulations of networks of various sizes, suggesting a new characterization of the subset of Boolean functions that are likely to appear in gene regulatory networks.     

重建基因调控网络

分子生物学的主要挑战是如何更好的理解基因间的调控机理。重建基因网络有助于探索生命系统的本质问题。这里对研究基因调控网络的起源、发展动向、目的和方法及目前所面临的挑战进行了综述。     

The effect of scale-free topology on the robustness and evolvability of genetic regulatory networks

We investigate how scale-free (SF) and Erd?s-Rényi (ER) topologies affect the interplay between evolvability and robustness of model gene regulatory networks with Boolean threshold dynamics. In agreement with Oikonomou and Cluzel (2006) we find that networks with SF_in topologies, that is SF topology for incoming nodes and ER topology for outgoing nodes, are significantly more evolvable towards specific oscillatory targets than networks with ER topology for both incoming and outgoing nodes. Similar results are found for networks with SF_both and SF_out topologies. The functionality of the SF_out topology, which most closely resembles the structure of biological gene networks (Babu et al., 2004), is compared to the ER topology in further detail through an extension to multiple target outputs, with either an oscillatory or a non-oscillatory nature. For multiple oscillatory targets of the same length, the differences between SF_out and ER networks are enhanced, but for non-oscillatory targets both types of networks show fairly similar evolvability. We find that SF networks generate oscillations much more easily than ER networks do, and this may explain why SF networks are more evolvable than ER networks are for oscillatory phenotypes. In spite of their greater evolvability, we find that networks with SF_out topologies are also more robust to mutations (mutational robustness) than ER networks. Furthermore, the SF_out topologies are more robust to changes in initial conditions (environmental robustness). For both topologies, we find that once a population of networks has reached the target state, further neutral evolution can lead to an increase in both the mutational robustness and the environmental robustness to changes in initial conditions.     

Gene regulatory networks in plants: learning causality from time and perturbation

The goal of systems biology is to generate models for predicting how a system will react under untested conditions or in response to genetic perturbations. This paper discusses experimental and analytical approaches to deriving causal relationships in gene regulatory networks.     

基于比较基因组学重构细菌的代谢途径和调控网络

微生物基因组学的迅速发展为从功能基因与蛋白、网络及其调控等不同的角度,全面理解与认识微生物的代谢过程、构建细胞工厂,提供了丰富的背景信息。基于基因组序列进行代谢网络重构,有助于发现新的代谢功能基因、调控元件、甚至新的代谢途径,从而优化设计细胞内从原料到产品的生物合成路线。然而,目前公共数据库平台中代谢途径基因的功能注释,许多是错误或不完整的。以下着重介绍了近年来出现的一些用于代谢途径和调控网络重构的新型比较基因组学技术,并以近期的丙酮丁醇梭菌中木糖代谢途径的重构工作为例来说明其应用。