Principles of dynamical modularity in biological regulatory networks.
Ontology highlight
ABSTRACT:
SUBMITTER: Deritei D
PROVIDER: S-EPMC4793241 | biostudies-literature | 2016 Mar
REPOSITORIES: biostudies-literature
Publications
Principles of dynamical modularity in biological regulatory networks.
Deritei Dávid D Aird William C WC Ercsey-Ravasz Mária M Regan Erzsébet Ravasz ER
Scientific reports 20160316
Intractable diseases such as cancer are associated with breakdown in multiple individual functions, which conspire to create unhealthy phenotype-combinations. An important challenge is to decipher how these functions are coordinated in health and disease. We approach this by drawing on dynamical systems theory. We posit that distinct phenotype-combinations are generated by interactions among robust regulatory switches, each in control of a discrete set of phenotypic outcomes. First, we demonstra ...[more]
Similar Datasets
Project description:Network motifs, such as the feed-forward loop (FFL), introduce a range of complex behaviors to transcriptional regulatory networks, yet such properties are typically determined from their isolated study. We characterize the effects of crosstalk on FFL dynamics by modeling the cross regulation between two different FFLs and evaluate the extent to which these patterns occur in vivo. Analytical modeling suggests that crosstalk should overwhelmingly affect individual protein-expression dynamics. Counter to this expectation we find that entire FFLs are more likely than expected to resist the effects of crosstalk (≈20% for one crosstalk interaction) and remain dynamically modular. The likelihood that cross-linked FFLs are dynamically correlated increases monotonically with additional crosstalk, but is independent of the specific regulation type or connectivity of the interactions. Just one additional regulatory interaction is sufficient to drive the FFL dynamics to a statistically different state. Despite the potential for modularity between sparsely connected network motifs, Escherichia coli (E. coli) appears to favor crosstalk wherein at least one of the cross-linked FFLs remains modular. A gene ontology analysis reveals that stress response processes are significantly overrepresented in the cross-linked motifs found within E. coli. Although the daunting complexity of biological networks affects the dynamical properties of individual network motifs, some resist and remain modular, seemingly insulated from extrinsic perturbations-an intriguing possibility for nature to consistently and reliably provide certain network functionalities wherever the need arise.
| S-EPMC5406374 | biostudies-literature
Project description:Modeling and simulation of molecular systems helps in understanding the behavioral mechanism of biological regulation. Time delays in production and degradation of expressions are important parameters in biological regulation. Constraints on time delays provide insight into the dynamical behavior of a Biological Regulatory Network (BRN). A recently introduced Process Hitting (PH) Framework has been found efficient in static analysis of large BRNs, however, it lacks the inference of time delays and thus determination of their constraints associated with the evolution of the expression levels of biological entities of BRN is not possible. In this paper we propose a Hybrid Process Hitting scheme for introducing time delays in Process Hitting Framework for dynamical modeling and analysis of Large Biological Regulatory Networks. It provides valuable insights into the time delays corresponding to the changes in the expression levels of biological entities thus possibly helping in identification of therapeutic targets. The proposed framework is applied to a well-known BRNs of Bacteriophage ? and ERBB Receptor-regulated G1/S transition involved in the breast cancer to demonstrate the viability of our approach. Using the proposed approach, we are able to perform goal-oriented reduction of the BRN and also determine the constraints on time delays characterizing the evolution (dynamics) of the reduced BRN.
| S-EPMC6385622 | biostudies-literature
Project description:The behavior of gene modules in complex synthetic circuits is often unpredictable. After joining modules to create a circuit, downstream elements (such as binding sites for a regulatory protein) apply a load to upstream modules that can negatively affect circuit function. Here we devised a genetic device named a load driver that mitigates the impact of load on circuit function, and we demonstrate its behavior in Saccharomyces cerevisiae. The load driver implements the design principle of timescale separation: inclusion of the load driver's fast phosphotransfer processes restores the capability of a slower transcriptional circuit to respond to time-varying input signals even in the presence of substantial load. Without the load driver, we observed circuit behavior that suffered from a 76% delay in response time and a 25% decrease in system bandwidth due to load. With the addition of a load driver, circuit performance was almost completely restored. Load drivers will serve as fundamental building blocks in the creation of complex, higher-level genetic circuits.
| S-EPMC4262674 | biostudies-literature
Project description:The identification of communities, or modules, is a common operation in the analysis of large biological networks. The Disease Module Identification DREAM challenge established a framework to evaluate clustering approaches in a biomedical context, by testing the association of communities with GWAS-derived common trait and disease genes. We implemented here several extensions of the MolTi software that detects communities by optimizing multiplex (and monoplex) network modularity. In particular, MolTi now runs a randomized version of the Louvain algorithm, can consider edge and layer weights, and performs recursive clustering. On simulated networks, the randomization procedure clearly improves the detection of communities. On the DREAM challenge benchmark, the results strongly depend on the selected GWAS dataset and enrichment p -value threshold. However, the randomization procedure, as well as the consideration of weighted edges and layers generally increases the number of trait and disease community detected. The new version of MolTi and the scripts used for the DMI DREAM challenge are available at: https://github.com/gilles-didier/MolTi-DREAM.
| S-EPMC6107982 | biostudies-literature
Project description:The visualization of biological networks is critically important to aid researchers in understanding complex biological systems and arouses interest in designing efficient layout algorithms to draw biological networks according to their topology structures, especially for those networks with potential modules. The algorithms of grid layout series have an advantage in generating compact layouts with overlap-free nodes compared to force-directed; however, extant grid layout algorithms have difficulty in drawing modular networks and often generate layouts of high visual complexity when applied to networks with dense or clustered connectivity structure. To specifically assist the study of modular networks, we propose a grid- and modularity-based layout algorithm (GML) that consists of three stages: network preprocessing, module layout and grid optimization. The algorithm can draw complex biological networks with or without predefined modules based on the grid layout algorithm. It also outperforms other existing grid-based algorithms in the measurement of computation performance, ratio of edge-edge/node-edge crossings, relative edge lengths, and connectivity F-measures. GML helps users to gain insight into the network global characteristics through module layout, as well as to discern network details with grid optimization. GML has been developed as a VisANT plugin (https://hscz.github.io/Biological-Network-Visualization/) and is freely available to the research community.
| S-EPMC6715240 | biostudies-literature
Project description:BackgroundRecently there has been a lot of interest in identifying modules at the level of genetic and metabolic networks of organisms, as well as in identifying single genes and reactions that are essential for the organism. A goal of computational and systems biology is to go beyond identification towards an explanation of specific modules and essential genes and reactions in terms of specific structural or evolutionary constraints.ResultsIn the metabolic networks of Escherichia coli, Saccharomyces cerevisiae and Staphylococcus aureus, we identified metabolites with a low degree of connectivity, particularly those that are produced and/or consumed in just a single reaction. Using flux balance analysis (FBA) we also determined reactions essential for growth in these metabolic networks. We find that most reactions identified as essential in these networks turn out to be those involving the production or consumption of low degree metabolites. Applying graph theoretic methods to these metabolic networks, we identified connected clusters of these low degree metabolites. The genes involved in several operons in E. coli are correctly predicted as those of enzymes catalyzing the reactions of these clusters. Furthermore, we find that larger sized clusters are over-represented in the real network and are analogous to a 'network motif. Using FBA for the above mentioned three organisms we independently identified clusters of reactions whose fluxes are perfectly correlated. We find that the composition of the latter 'functional clusters' is also largely explained in terms of clusters of low degree metabolites in each of these organisms.ConclusionOur findings mean that most metabolic reactions that are essential can be tagged by one or more low degree metabolites. Those reactions are essential because they are the only ways of producing or consuming their respective tagged metabolites. Furthermore, reactions whose fluxes are strongly correlated can be thought of as 'glued together' by these low degree metabolites. The methods developed here could be used in predicting essential reactions and metabolic modules in other organisms from the list of metabolic reactions.
| S-EPMC1434774 | biostudies-literature
Project description:Cell-fate decisions during development are controlled by densely interconnected gene regulatory networks (GRNs) consisting of many genes. Inferring and predictively modeling these GRNs is crucial for understanding development and other physiological processes. Gene circuits, coupled differential equations that represent gene product synthesis with a switch-like function, provide a biologically realistic framework for modeling the time evolution of gene expression. However, their use has been limited to smaller networks due to the computational expense of inferring model parameters from gene expression data using global non-linear optimization. Here we show that the switch-like nature of gene regulation can be exploited to break the gene circuit inference problem into two simpler optimization problems that are amenable to computationally efficient supervised learning techniques. We present FIGR (Fast Inference of Gene Regulation), a novel classification-based inference approach to determining gene circuit parameters. We demonstrate FIGR's effectiveness on synthetic data generated from random gene circuits of up to 50 genes as well as experimental data from the gap gene system of Drosophila melanogaster, a benchmark for inferring dynamical GRN models. FIGR is faster than global non-linear optimization by a factor of 600 and its computational complexity scales much better with GRN size. On a practical level, FIGR can accurately infer the biologically realistic gap gene network in under a minute on desktop-class hardware instead of requiring hours of parallel computing. We anticipate that FIGR would enable the inference of much larger biologically realistic GRNs than was possible before.
| S-EPMC6893186 | biostudies-literature
Project description:Genetic regulatory networks (GRNs) regulate the flow of genetic information from the genome to expressed messenger RNAs (mRNAs) and thus are critical to controlling the phenotypic characteristics of cells. Numerous methods exist for profiling mRNA transcript levels and identifying protein-DNA binding interactions at the genome-wide scale. These enable researchers to determine the structure and output of transcriptional regulatory networks, but uncovering the complete structure and regulatory logic of GRNs remains a challenge. The field of GRN inference aims to meet this challenge using computational modeling to derive the structure and logic of GRNs from experimental data and to encode this knowledge in Boolean networks, Bayesian networks, ordinary differential equation (ODE) models, or other modeling frameworks. However, most existing models do not incorporate dynamic transcriptional data since it has historically been less widely available in comparison to "static" transcriptional data. We report the development of an evolutionary algorithm-based ODE modeling approach (named EA) that integrates kinetic transcription data and the theory of attractor matching to infer GRN architecture and regulatory logic. Our method outperformed six leading GRN inference methods, none of which incorporate kinetic transcriptional data, in predicting regulatory connections among TFs when applied to a small-scale engineered synthetic GRN in Saccharomyces cerevisiae. Moreover, we demonstrate the potential of our method to predict unknown transcriptional profiles that would be produced upon genetic perturbation of the GRN governing a two-state cellular phenotypic switch in Candida albicans. We established an iterative refinement strategy to facilitate candidate selection for experimentation; the experimental results in turn provide validation or improvement for the model. In this way, our GRN inference approach can expedite the development of a sophisticated mathematical model that can accurately describe the structure and dynamics of the in vivo GRN.
| S-EPMC10473541 | biostudies-literature
Project description:BackgroundQualitative dynamics of small gene regulatory networks have been studied in quite some details both with synchronous and asynchronous analysis. However, both methods have their drawbacks: synchronous analysis leads to spurious attractors and asynchronous analysis lacks computational efficiency, which is a problem to simulate large networks. We addressed this question through the analysis of a major biosynthesis pathway. Indeed the cholesterol synthesis pathway plays a pivotal role in dislypidemia and, ultimately, in cancer through intermediates such as mevalonate, farnesyl pyrophosphate and geranyl geranyl pyrophosphate, but no dynamic model of this pathway has been proposed until now.ResultsWe set up a computational framework to dynamically analyze large biological networks. This framework associates a classical and computationally efficient synchronous Boolean analysis with a newly introduced method based on Markov chains, which identifies spurious cycles among the results of the synchronous simulation. Based on this method, we present here the results of the analysis of the cholesterol biosynthesis pathway and its physiological regulation by the Sterol Response Element Binding Proteins (SREBPs), as well as the modeling of the action of statins, inhibitor drugs, on this pathway. The in silico experiments show the blockade of the cholesterol endogenous synthesis by statins and its regulation by SREPBs, in full agreement with the known biochemical features of the pathway.ConclusionWe believe that the method described here to identify spurious cycles opens new routes to compute large and biologically relevant models, thanks to the computational efficiency of synchronous simulation. Furthermore, to the best of our knowledge, we present here the first dynamic systems biology model of the human cholesterol pathway and several of its key regulatory control elements, hoping it would provide a good basis to perform in silico experiments and confront the resulting properties with published and experimental data. The model of the cholesterol pathway and its regulation, along with Boolean formulae used for simulation are available on our web site http://Bioinformaticsu613.free.fr. Graphical results of the simulation are also shown online. The SBML model is available in the BioModels database http://www.ebi.ac.uk/biomodels/ with submission ID: MODEL0568648427.
| S-EPMC2612667 | biostudies-literature
Project description:The long-lasting enhancement of synaptic effectiveness known as long-term potentiation (LTP) is considered to be the cellular basis of long-term memory. LTP elicits changes at the cellular and molecular level, including temporally specific alterations in gene networks. LTP can be seen as a biological process in which a transient signal sets a new homeostatic state that is "remembered" by cellular regulatory systems. Previously, we have shown that early growth response (Egr) transcription factors are of fundamental importance to gene networks recruited early after LTP induction. From a systems perspective, we hypothesized that these networks will show less stable architecture, while networks recruited later will exhibit increased stability, being more directly related to LTP consolidation. Using random Boolean network (RBN) simulations we found that the network derived at 24 h was markedly more stable than those derived at 20 min or 5 h post-LTP. This temporal effect on the vulnerability of the networks is mirrored by what is known about the vulnerability of LTP and memory itself. Differential gene co-expression analysis further highlighted the importance of the Egr family and found a rapid enrichment in connectivity at 20 min, followed by a systematic decrease, providing a potential explanation for the down-regulation of gene expression at 24 h documented in our preceding studies. We also found that the architecture exhibited by a control and the 24 h LTP co-expression networks fit well to a scale-free distribution, known to be robust against perturbations. By contrast the 20 min and 5 h networks showed more truncated distributions. These results suggest that a new homeostatic state is achieved 24 h post-LTP. Together, these data present an integrated view of the genomic response following LTP induction by which the stability of the networks regulated at different times parallel the properties observed at the synapse.
| S-EPMC4528166 | biostudies-literature