Science.gov

Sample records for gene network parameters

  1. Listening to the noise: random fluctuations reveal gene network parameters

    SciTech Connect

    Munsky, Brian; Khammash, Mustafa

    2009-01-01

    The cellular environment is abuzz with noise. The origin of this noise is attributed to the inherent random motion of reacting molecules that take part in gene expression and post expression interactions. In this noisy environment, clonal populations of cells exhibit cell-to-cell variability that frequently manifests as significant phenotypic differences within the cellular population. The stochastic fluctuations in cellular constituents induced by noise can be measured and their statistics quantified. We show that these random fluctuations carry within them valuable information about the underlying genetic network. Far from being a nuisance, the ever-present cellular noise acts as a rich source of excitation that, when processed through a gene network, carries its distinctive fingerprint that encodes a wealth of information about that network. We demonstrate that in some cases the analysis of these random fluctuations enables the full identification of network parameters, including those that may otherwise be difficult to measure. This establishes a potentially powerful approach for the identification of gene networks and offers a new window into the workings of these networks.

  2. Network topology and parameter estimation: from experimental design methods to gene regulatory network kinetics using a community based approach

    PubMed Central

    2014-01-01

    Background Accurate estimation of parameters of biochemical models is required to characterize the dynamics of molecular processes. This problem is intimately linked to identifying the most informative experiments for accomplishing such tasks. While significant progress has been made, effective experimental strategies for parameter identification and for distinguishing among alternative network topologies remain unclear. We approached these questions in an unbiased manner using a unique community-based approach in the context of the DREAM initiative (Dialogue for Reverse Engineering Assessment of Methods). We created an in silico test framework under which participants could probe a network with hidden parameters by requesting a range of experimental assays; results of these experiments were simulated according to a model of network dynamics only partially revealed to participants. Results We proposed two challenges; in the first, participants were given the topology and underlying biochemical structure of a 9-gene regulatory network and were asked to determine its parameter values. In the second challenge, participants were given an incomplete topology with 11 genes and asked to find three missing links in the model. In both challenges, a budget was provided to buy experimental data generated in silico with the model and mimicking the features of different common experimental techniques, such as microarrays and fluorescence microscopy. Data could be bought at any stage, allowing participants to implement an iterative loop of experiments and computation. Conclusions A total of 19 teams participated in this competition. The results suggest that the combination of state-of-the-art parameter estimation and a varied set of experimental methods using a few datasets, mostly fluorescence imaging data, can accurately determine parameters of biochemical models of gene regulation. However, the task is considerably more difficult if the gene network topology is not completely

  3. Identification of robust adaptation gene regulatory network parameters using an improved particle swarm optimization algorithm.

    PubMed

    Huang, X N; Ren, H P

    2016-01-01

    Robust adaptation is a critical ability of gene regulatory network (GRN) to survive in a fluctuating environment, which represents the system responding to an input stimulus rapidly and then returning to its pre-stimulus steady state timely. In this paper, the GRN is modeled using the Michaelis-Menten rate equations, which are highly nonlinear differential equations containing 12 undetermined parameters. The robust adaption is quantitatively described by two conflicting indices. To identify the parameter sets in order to confer the GRNs with robust adaptation is a multi-variable, multi-objective, and multi-peak optimization problem, which is difficult to acquire satisfactory solutions especially high-quality solutions. A new best-neighbor particle swarm optimization algorithm is proposed to implement this task. The proposed algorithm employs a Latin hypercube sampling method to generate the initial population. The particle crossover operation and elitist preservation strategy are also used in the proposed algorithm. The simulation results revealed that the proposed algorithm could identify multiple solutions in one time running. Moreover, it demonstrated a superior performance as compared to the previous methods in the sense of detecting more high-quality solutions within an acceptable time. The proposed methodology, owing to its universality and simplicity, is useful for providing the guidance to design GRN with superior robust adaptation. PMID:27323043

  4. An Integrative Approach for Mapping Differentially Expressed Genes and Network Components Using Novel Parameters to Elucidate Key Regulatory Genes in Colorectal Cancer

    PubMed Central

    Sehgal, Manika; Gupta, Rajinder; Moussa, Ahmed; Singh, Tiratha Raj

    2015-01-01

    For examining the intricate biological processes concerned with colorectal cancer (CRC), a systems biology approach integrating several biological components and other influencing factors is essential to understand. We performed a comprehensive system level analysis for CRC which assisted in unravelling crucial network components and many regulatory elements through a coordinated view. Using this integrative approach, the perceptive of complexity hidden in a biological phenomenon is extensively simplified. The microarray analyses facilitated differential expression of 631 significant genes employed in the progression of disease and supplied interesting associated up and down regulated genes like jun, fos and mapk1. The transcriptional regulation of these genes was deliberated widely by examining transcription factors such as hnf4, nr2f1, znf219 and dr1 which directly influence the expression. Further, interactions of these genes/proteins were evaluated and crucial network motifs were detected to associate with the pathophysiology of CRC. The available standard statistical parameters such as z-score, p-value and significance profile were explored for the identification of key signatures from CRC pathway whereas a few novel parameters representing over-represented structures were also designed in the study. The applied approach revealed 5 key genes i.e. kras, araf, pik3r5, ralgds and akt3 via our novel designed parameters illustrating high statistical significance. These novel parameters can assist in scrutinizing candidate markers for diseases having known biological pathways. Further, investigating and targeting these proposed genes for experimental validations, instead being spellbound by the complicated pathway will certainly endow valuable insight in a well-timed systematic understanding of CRC. PMID:26222778

  5. GENE EXPRESSION NETWORKS

    EPA Science Inventory

    "Gene expression network" is the term used to describe the interplay, simple or complex, between two or more gene products in performing a specific cellular function. Although the delineation of such networks is complicated by the existence of multiple and subtle types of intera...

  6. Identifying Gene Interaction Networks

    PubMed Central

    Bebek, Gurkan

    2016-01-01

    In this chapter, we introduce interaction networks by describing how they are generated, where they are stored, and how they are shared. We focus on publicly available interaction networks and describe a simple way of utilizing these resources. As a case study, we used Cytoscape, an open source and easy-to-use network visualization and analysis tool to first gather and visualize a small network. We have analyzed this network’s topological features and have looked at functional enrichment of the network nodes by integrating the gene ontology database. The methods described are applicable to larger networks that can be collected from various resources. PMID:22307715

  7. Buffering in cyclic gene networks

    NASA Astrophysics Data System (ADS)

    Glyzin, S. D.; Kolesov, A. Yu.; Rozov, N. Kh.

    2016-06-01

    We consider cyclic chains of unidirectionally coupled delay differential-difference equations that are mathematical models of artificial oscillating gene networks. We establish that the buffering phenomenon is realized in these system for an appropriate choice of the parameters: any given finite number of stable periodic motions of a special type, the so-called traveling waves, coexist.

  8. Adaptive Models for Gene Networks

    PubMed Central

    Shin, Yong-Jun; Sayed, Ali H.; Shen, Xiling

    2012-01-01

    Biological systems are often treated as time-invariant by computational models that use fixed parameter values. In this study, we demonstrate that the behavior of the p53-MDM2 gene network in individual cells can be tracked using adaptive filtering algorithms and the resulting time-variant models can approximate experimental measurements more accurately than time-invariant models. Adaptive models with time-variant parameters can help reduce modeling complexity and can more realistically represent biological systems. PMID:22359614

  9. The gap gene network

    PubMed Central

    2010-01-01

    Gap genes are involved in segment determination during the early development of the fruit fly Drosophila melanogaster as well as in other insects. This review attempts to synthesize the current knowledge of the gap gene network through a comprehensive survey of the experimental literature. I focus on genetic and molecular evidence, which provides us with an almost-complete picture of the regulatory interactions responsible for trunk gap gene expression. I discuss the regulatory mechanisms involved, and highlight the remaining ambiguities and gaps in the evidence. This is followed by a brief discussion of molecular regulatory mechanisms for transcriptional regulation, as well as precision and size-regulation provided by the system. Finally, I discuss evidence on the evolution of gap gene expression from species other than Drosophila. My survey concludes that studies of the gap gene system continue to reveal interesting and important new insights into the role of gene regulatory networks in development and evolution. PMID:20927566

  10. Gene expression networks.

    PubMed

    Thomas, Reuben; Portier, Christopher J

    2013-01-01

    With the advent of microarrays and next-generation biotechnologies, the use of gene expression data has become ubiquitous in biological research. One potential drawback of these data is that they are very rich in features or genes though cost considerations allow for the use of only relatively small sample sizes. A useful way of getting at biologically meaningful interpretations of the environmental or toxicological condition of interest would be to make inferences at the level of a priori defined biochemical pathways or networks of interacting genes or proteins that are known to perform certain biological functions. This chapter describes approaches taken in the literature to make such inferences at the biochemical pathway level. In addition this chapter describes approaches to create hypotheses on genes playing important roles in response to a treatment, using organism level gene coexpression or protein-protein interaction networks. Also, approaches to reverse engineer gene networks or methods that seek to identify novel interactions between genes are described. Given the relatively small sample numbers typically available, these reverse engineering approaches are generally useful in inferring interactions only among a relatively small or an order 10 number of genes. Finally, given the vast amounts of publicly available gene expression data from different sources, this chapter summarizes the important sources of these data and characteristics of these sources or databases. In line with the overall aims of this book of providing practical knowledge to a researcher interested in analyzing gene expression data from a network perspective, the chapter provides convenient publicly accessible tools for performing analyses described, and in addition describe three motivating examples taken from the published literature that illustrate some of the relevant analyses. PMID:23086841

  11. Parameter extraction with neural networks

    NASA Astrophysics Data System (ADS)

    Cazzanti, Luca; Khan, Mumit; Cerrina, Franco

    1998-06-01

    In semiconductor processing, the modeling of the process is becoming more and more important. While the ultimate goal is that of developing a set of tools for designing a complete process (Technology CAD), it is also necessary to have modules to simulate the various technologies and, in particular, to optimize specific steps. This need is particularly acute in lithography, where the continuous decrease in CD forces the technologies to operate near their limits. In the development of a 'model' for a physical process, we face several levels of challenges. First, it is necessary to develop a 'physical model,' i.e. a rational description of the process itself on the basis of know physical laws. Second, we need an 'algorithmic model' to represent in a virtual environment the behavior of the 'physical model.' After a 'complete' model has been developed and verified, it becomes possible to do performance analysis. In many cases the input parameters are poorly known or not accessible directly to experiment. It would be extremely useful to obtain the values of these 'hidden' parameters from experimental results by comparing model to data. This is particularly severe, because the complexity and costs associated with semiconductor processing make a simple 'trial-and-error' approach infeasible and cost- inefficient. Even when computer models of the process already exists, obtaining data through simulations may be time consuming. Neural networks (NN) are powerful computational tools to predict the behavior of a system from an existing data set. They are able to adaptively 'learn' input/output mappings and to act as universal function approximators. In this paper we use artificial neural networks to build a mapping from the input parameters of the process to output parameters which are indicative of the performance of the process. Once the NN has been 'trained,' it is also possible to observe the process 'in reverse,' and to extract the values of the inputs which yield outputs

  12. Computation in gene networks

    NASA Astrophysics Data System (ADS)

    Ben-Hur, Asa; Siegelmann, Hava T.

    2004-03-01

    Genetic regulatory networks have the complex task of controlling all aspects of life. Using a model of gene expression by piecewise linear differential equations we show that this process can be considered as a process of computation. This is demonstrated by showing that this model can simulate memory bounded Turing machines. The simulation is robust with respect to perturbations of the system, an important property for both analog computers and biological systems. Robustness is achieved using a condition that ensures that the model equations, that are generally chaotic, follow a predictable dynamics.

  13. Analysis of Cascading Failure in Gene Networks

    PubMed Central

    Sun, Longxiao; Wang, Shudong; Li, Kaikai; Meng, Dazhi

    2012-01-01

    It is an important subject to research the functional mechanism of cancer-related genes make in formation and development of cancers. The modern methodology of data analysis plays a very important role for deducing the relationship between cancers and cancer-related genes and analyzing functional mechanism of genome. In this research, we construct mutual information networks using gene expression profiles of glioblast and renal in normal condition and cancer conditions. We investigate the relationship between structure and robustness in gene networks of the two tissues using a cascading failure model based on betweenness centrality. Define some important parameters such as the percentage of failure nodes of the network, the average size-ratio of cascading failure, and the cumulative probability of size-ratio of cascading failure to measure the robustness of the networks. By comparing control group and experiment groups, we find that the networks of experiment groups are more robust than that of control group. The gene that can cause large scale failure is called structural key gene. Some of them have been confirmed to be closely related to the formation and development of glioma and renal cancer respectively. Most of them are predicted to play important roles during the formation of glioma and renal cancer, maybe the oncogenes, suppressor genes, and other cancer candidate genes in the glioma and renal cancer cells. However, these studies provide little information about the detailed roles of identified cancer genes. PMID:23248647

  14. Approximate entropy of network parameters.

    PubMed

    West, James; Lacasa, Lucas; Severini, Simone; Teschendorff, Andrew

    2012-04-01

    We study the notion of approximate entropy within the framework of network theory. Approximate entropy is an uncertainty measure originally proposed in the context of dynamical systems and time series. We first define a purely structural entropy obtained by computing the approximate entropy of the so-called slide sequence. This is a surrogate of the degree sequence and it is suggested by the frequency partition of a graph. We examine this quantity for standard scale-free and Erdös-Rényi networks. By using classical results of Pincus, we show that our entropy measure often converges with network size to a certain binary Shannon entropy. As a second step, with specific attention to networks generated by dynamical processes, we investigate approximate entropy of horizontal visibility graphs. Visibility graphs allow us to naturally associate with a network the notion of temporal correlations, therefore providing the measure a dynamical garment. We show that approximate entropy distinguishes visibility graphs generated by processes with different complexity. The result probes to a greater extent these networks for the study of dynamical systems. Applications to certain biological data arising in cancer genomics are finally considered in the light of both approaches. PMID:22680542

  15. Approximate entropy of network parameters

    NASA Astrophysics Data System (ADS)

    West, James; Lacasa, Lucas; Severini, Simone; Teschendorff, Andrew

    2012-04-01

    We study the notion of approximate entropy within the framework of network theory. Approximate entropy is an uncertainty measure originally proposed in the context of dynamical systems and time series. We first define a purely structural entropy obtained by computing the approximate entropy of the so-called slide sequence. This is a surrogate of the degree sequence and it is suggested by the frequency partition of a graph. We examine this quantity for standard scale-free and Erdös-Rényi networks. By using classical results of Pincus, we show that our entropy measure often converges with network size to a certain binary Shannon entropy. As a second step, with specific attention to networks generated by dynamical processes, we investigate approximate entropy of horizontal visibility graphs. Visibility graphs allow us to naturally associate with a network the notion of temporal correlations, therefore providing the measure a dynamical garment. We show that approximate entropy distinguishes visibility graphs generated by processes with different complexity. The result probes to a greater extent these networks for the study of dynamical systems. Applications to certain biological data arising in cancer genomics are finally considered in the light of both approaches.

  16. Integrating heterogeneous gene expression data for gene regulatory network modelling.

    PubMed

    Sîrbu, Alina; Ruskin, Heather J; Crane, Martin

    2012-06-01

    Gene regulatory networks (GRNs) are complex biological systems that have a large impact on protein levels, so that discovering network interactions is a major objective of systems biology. Quantitative GRN models have been inferred, to date, from time series measurements of gene expression, but at small scale, and with limited application to real data. Time series experiments are typically short (number of time points of the order of ten), whereas regulatory networks can be very large (containing hundreds of genes). This creates an under-determination problem, which negatively influences the results of any inferential algorithm. Presented here is an integrative approach to model inference, which has not been previously discussed to the authors' knowledge. Multiple heterogeneous expression time series are used to infer the same model, and results are shown to be more robust to noise and parameter perturbation. Additionally, a wavelet analysis shows that these models display limited noise over-fitting within the individual datasets. PMID:21948152

  17. Building Developmental Gene Regulatory Networks

    PubMed Central

    Li, Enhu; Davidson, Eric H.

    2009-01-01

    Animal development is an elaborate process programmed by genomic regulatory instructions. Regulatory genes encode transcription factors and signal molecules, and their expression is under the control of cis-regulatory modules that define the logic of transcriptional responses to the inputs of other regulatory genes. The functional linkages amongst regulatory genes constitute the gene regulatory networks (GRNs) that govern cell specification and patterning in development. Constructing such networks requires identification of the regulatory genes involved and characterization of their temporal and spatial expression patterns. Interactions (activation/repression) among transcription factors or signals can be investigated by large-scale perturbation analysis, in which the function of each gene is specifically blocked. Resultant expression changes are then integrated to identify direct linkages, and to reveal the structure of the GRN. Predicted GRN linkages can be tested and verified by cis-regulatory analysis. The explanatory power of the GRN was shown in the lineage specification of sea urchin endomesoderm. Acquiring such networks is essential for a systematic and mechanistic understanding of the developmental process. PMID:19530131

  18. Prebiotic network evolution: six key parameters.

    PubMed

    Nghe, Philippe; Hordijk, Wim; Kauffman, Stuart A; Walker, Sara I; Schmidt, Francis J; Kemble, Harry; Yeates, Jessica A M; Lehman, Niles

    2015-12-01

    The origins of life likely required the cooperation among a set of molecular species interacting in a network. If so, then the earliest modes of evolutionary change would have been governed by the manners and mechanisms by which networks change their compositions over time. For molecular events, especially those in a pre-biological setting, these mechanisms have rarely been considered. We are only recently learning to apply the results of mathematical analyses of network dynamics to prebiotic events. Here, we attempt to forge connections between such analyses and the current state of knowledge in prebiotic chemistry. Of the many possible influences that could direct primordial network, six parameters emerge as the most influential when one considers the molecular characteristics of the best candidates for the emergence of biological information: polypeptides, RNA-like polymers, and lipids. These parameters are viable cores, connectivity kinetics, information control, scalability, resource availability, and compartmentalization. These parameters, both individually and jointly, guide the aggregate evolution of collectively autocatalytic sets. We are now in a position to translate these conclusions into a laboratory setting and test empirically the dynamics of prebiotic network evolution. PMID:26490759

  19. Gene networks controlling petal organogenesis.

    PubMed

    Huang, Tengbo; Irish, Vivian F

    2016-01-01

    One of the biggest unanswered questions in developmental biology is how growth is controlled. Petals are an excellent organ system for investigating growth control in plants: petals are dispensable, have a simple structure, and are largely refractory to environmental perturbations that can alter their size and shape. In recent studies, a number of genes controlling petal growth have been identified. The overall picture of how such genes function in petal organogenesis is beginning to be elucidated. This review will focus on studies using petals as a model system to explore the underlying gene networks that control organ initiation, growth, and final organ morphology. PMID:26428062

  20. Clinicopathologic and gene expression parameters predict liver cancer prognosis

    PubMed Central

    2011-01-01

    Background The prognosis of hepatocellular carcinoma (HCC) varies following surgical resection and the large variation remains largely unexplained. Studies have revealed the ability of clinicopathologic parameters and gene expression to predict HCC prognosis. However, there has been little systematic effort to compare the performance of these two types of predictors or combine them in a comprehensive model. Methods Tumor and adjacent non-tumor liver tissues were collected from 272 ethnic Chinese HCC patients who received curative surgery. We combined clinicopathologic parameters and gene expression data (from both tissue types) in predicting HCC prognosis. Cross-validation and independent studies were employed to assess prediction. Results HCC prognosis was significantly associated with six clinicopathologic parameters, which can partition the patients into good- and poor-prognosis groups. Within each group, gene expression data further divide patients into distinct prognostic subgroups. Our predictive genes significantly overlap with previously published gene sets predictive of prognosis. Moreover, the predictive genes were enriched for genes that underwent normal-to-tumor gene network transformation. Previously documented liver eSNPs underlying the HCC predictive gene signatures were enriched for SNPs that associated with HCC prognosis, providing support that these genes are involved in key processes of tumorigenesis. Conclusion When applied individually, clinicopathologic parameters and gene expression offered similar predictive power for HCC prognosis. In contrast, a combination of the two types of data dramatically improved the power to predict HCC prognosis. Our results also provided a framework for understanding the impact of gene expression on the processes of tumorigenesis and clinical outcome. PMID:22070665

  1. The Gene Network Underlying Hypodontia.

    PubMed

    Yin, W; Bian, Z

    2015-07-01

    Mammalian tooth development is a precise and complicated procedure. Several signaling pathways, such as nuclear factor (NF)-κB and WNT, are key regulators of tooth development. Any disturbance of these signaling pathways can potentially affect or block normal tooth development, and presently, there are more than 150 syndromes and 80 genes known to be related to tooth agenesis. Clarifying the interaction and crosstalk among these genes will provide important information regarding the mechanisms underlying missing teeth. In the current review, we summarize recently published findings on genes related to isolated and syndromic tooth agenesis; most of these genes function as positive regulators of cell proliferation or negative regulators of cell differentiation and apoptosis. Furthermore, we explore the corresponding networks involving these genes in addition to their implications for the clinical management of tooth agenesis. We conclude that this requires further study to improve patients' quality of life in the future. PMID:25910507

  2. Plant Evolution: Evolving Antagonistic Gene Regulatory Networks.

    PubMed

    Cooper, Endymion D

    2016-06-20

    Developing a structurally complex phenotype requires a complex regulatory network. A new study shows how gene duplication provides a potential source of antagonistic interactions, an important component of gene regulatory networks. PMID:27326708

  3. Gene networks and liar paradoxes

    PubMed Central

    Isalan, Mark

    2009-01-01

    Network motifs are small patterns of connections, found over-represented in gene regulatory networks. An example is the negative feedback loop (e.g. factor A represses itself). This opposes its own state so that when ‘on’ it tends towards ‘off’ – and vice versa. Here, we argue that such self-opposition, if considered dimensionlessly, is analogous to the liar paradox: ‘This statement is false’. When ‘true’ it implies ‘false’ – and vice versa. Such logical constructs have provided philosophical consternation for over 2000 years. Extending the analogy, other network topologies give strikingly varying outputs over different dimensions. For example, the motif ‘A activates B and A. B inhibits A’ can give switches or oscillators with time only, or can lead to Turing-type patterns with both space and time (spots, stripes or waves). It is argued here that the dimensionless form reduces to a variant of ‘The following statement is true. The preceding statement is false’. Thus, merely having a static topological description of a gene network can lead to a liar paradox. Network diagrams are only snapshots of dynamic biological processes and apparent paradoxes can reveal important biological mechanisms that are far from paradoxical when considered explicitly in time and space. PMID:19722183

  4. Gene networks and liar paradoxes.

    PubMed

    Isalan, Mark

    2009-10-01

    Network motifs are small patterns of connections, found over-represented in gene regulatory networks. An example is the negative feedback loop (e.g. factor A represses itself). This opposes its own state so that when 'on' it tends towards 'off' - and vice versa. Here, we argue that such self-opposition, if considered dimensionlessly, is analogous to the liar paradox: 'This statement is false'. When 'true' it implies 'false' - and vice versa. Such logical constructs have provided philosophical consternation for over 2000 years. Extending the analogy, other network topologies give strikingly varying outputs over different dimensions. For example, the motif 'A activates B and A. B inhibits A' can give switches or oscillators with time only, or can lead to Turing-type patterns with both space and time (spots, stripes or waves). It is argued here that the dimensionless form reduces to a variant of 'The following statement is true. The preceding statement is false'. Thus, merely having a static topological description of a gene network can lead to a liar paradox. Network diagrams are only snapshots of dynamic biological processes and apparent paradoxes can reveal important biological mechanisms that are far from paradoxical when considered explicitly in time and space. PMID:19722183

  5. Engineering stability in gene networks by autoregulation

    NASA Astrophysics Data System (ADS)

    Becskei, Attila; Serrano, Luis

    2000-06-01

    The genetic and biochemical networks which underlie such things as homeostasis in metabolism and the developmental programs of living cells, must withstand considerable variations and random perturbations of biochemical parameters. These occur as transient changes in, for example, transcription, translation, and RNA and protein degradation. The intensity and duration of these perturbations differ between cells in a population. The unique state of cells, and thus the diversity in a population, is owing to the different environmental stimuli the individual cells experience and the inherent stochastic nature of biochemical processes (for example, refs 5 and 6). It has been proposed, but not demonstrated, that autoregulatory, negative feedback loops in gene circuits provide stability, thereby limiting the range over which the concentrations of network components fluctuate. Here we have designed and constructed simple gene circuits consisting of a regulator and transcriptional repressor modules in Escherichia coli and we show the gain of stability produced by negative feedback.

  6. Engineering stability in gene networks by autoregulation.

    PubMed

    Becskei, A; Serrano, L

    2000-06-01

    The genetic and biochemical networks which underlie such things as homeostasis in metabolism and the developmental programs of living cells, must withstand considerable variations and random perturbations of biochemical parameters. These occur as transient changes in, for example, transcription, translation, and RNA and protein degradation. The intensity and duration of these perturbations differ between cells in a population. The unique state of cells, and thus the diversity in a population, is owing to the different environmental stimuli the individual cells experience and the inherent stochastic nature of biochemical processes (for example, refs 5 and 6). It has been proposed, but not demonstrated, that autoregulatory, negative feedback loops in gene circuits provide stability, thereby limiting the range over which the concentrations of network components fluctuate. Here we have designed and constructed simple gene circuits consisting of a regulator and transcriptional repressor modules in Escherichia coli and we show the gain of stability produced by negative feedback. PMID:10850721

  7. Exhaustive Search for Fuzzy Gene Networks from Microarray Data

    SciTech Connect

    Sokhansanj, B A; Fitch, J P; Quong, J N; Quong, A A

    2003-07-07

    Recent technological advances in high-throughput data collection allow for the study of increasingly complex systems on the scale of the whole cellular genome and proteome. Gene network models are required to interpret large and complex data sets. Rationally designed system perturbations (e.g. gene knock-outs, metabolite removal, etc) can be used to iteratively refine hypothetical models, leading to a modeling-experiment cycle for high-throughput biological system analysis. We use fuzzy logic gene network models because they have greater resolution than Boolean logic models and do not require the precise parameter measurement needed for chemical kinetics-based modeling. The fuzzy gene network approach is tested by exhaustive search for network models describing cyclin gene interactions in yeast cell cycle microarray data, with preliminary success in recovering interactions predicted by previous biological knowledge and other analysis techniques. Our goal is to further develop this method in combination with experiments we are performing on bacterial regulatory networks.

  8. Consensus gene regulatory networks: combining multiple microarray gene expression datasets

    NASA Astrophysics Data System (ADS)

    Peeling, Emma; Tucker, Allan

    2007-09-01

    In this paper we present a method for modelling gene regulatory networks by forming a consensus Bayesian network model from multiple microarray gene expression datasets. Our method is based on combining Bayesian network graph topologies and does not require any special pre-processing of the datasets, such as re-normalisation. We evaluate our method on a synthetic regulatory network and part of the yeast heat-shock response regulatory network using publicly available yeast microarray datasets. Results are promising; the consensus networks formed provide a broader view of the potential underlying network, obtaining an increased true positive rate over networks constructed from a single data source.

  9. Model parameter updating using Bayesian networks

    SciTech Connect

    Treml, C. A.; Ross, Timothy J.

    2004-01-01

    This paper outlines a model parameter updating technique for a new method of model validation using a modified model reference adaptive control (MRAC) framework with Bayesian Networks (BNs). The model parameter updating within this method is generic in the sense that the model/simulation to be validated is treated as a black box. It must have updateable parameters to which its outputs are sensitive, and those outputs must have metrics that can be compared to that of the model reference, i.e., experimental data. Furthermore, no assumptions are made about the statistics of the model parameter uncertainty, only upper and lower bounds need to be specified. This method is designed for situations where a model is not intended to predict a complete point-by-point time domain description of the item/system behavior; rather, there are specific points, features, or events of interest that need to be predicted. These specific points are compared to the model reference derived from actual experimental data. The logic for updating the model parameters to match the model reference is formed via a BN. The nodes of this BN consist of updateable model input parameters and the specific output values or features of interest. Each time the model is executed, the input/output pairs are used to adapt the conditional probabilities of the BN. Each iteration further refines the inferred model parameters to produce the desired model output. After parameter updating is complete and model inputs are inferred, reliabilities for the model output are supplied. Finally, this method is applied to a simulation of a resonance control cooling system for a prototype coupled cavity linac. The results are compared to experimental data.

  10. Order Parameters for Two-Dimensional Networks

    NASA Astrophysics Data System (ADS)

    Kaatz, Forrest; Bultheel, Adhemar; Egami, Takeshi

    2007-10-01

    We derive methods that explain how to quantify the amount of order in ``ordered'' and ``highly ordered'' porous arrays. Ordered arrays from bee honeycomb and several from the general field of nanoscience are compared. Accurate measures of the order in porous arrays are made using the discrete pair distribution function (PDF) and the Debye-Waller Factor (DWF) from 2-D discrete Fourier transforms calculated from the real-space data using MATLAB routines. An order parameter, OP3, is defined from the PDF to evaluate the total order in a given array such that an ideal network has the value of 1. When we compare PDFs of man-made arrays with that of our honeycomb we find OP3=0.399 for the honeycomb and OP3=0.572 for man's best hexagonal array. The DWF also scales with this order parameter with the least disorder from a computer-generated hexagonal array and the most disorder from a random array. An ideal hexagonal array normalizes a two-dimensional Fourier transform from which a Debye-Waller parameter is derived which describes the disorder in the arrays. An order parameter S, defined by the DWF, takes values from [0, 1] and for the analyzed man-made array is 0.90, while for the honeycomb it is 0.65. This presentation describes methods to quantify the order found in these arrays.

  11. Parameter incremental learning algorithm for neural networks.

    PubMed

    Wan, Sheng; Banta, Larry E

    2006-11-01

    In this paper, a novel stochastic (or online) training algorithm for neural networks, named parameter incremental learning (PIL) algorithm, is proposed and developed. The main idea of the PIL strategy is that the learning algorithm should not only adapt to the newly presented input-output training pattern by adjusting parameters, but also preserve the prior results. A general PIL algorithm for feedforward neural networks is accordingly presented as the first-order approximate solution to an optimization problem, where the performance index is the combination of proper measures of preservation and adaptation. The PIL algorithms for the multilayer perceptron (MLP) are subsequently derived. Numerical studies show that for all the three benchmark problems used in this paper the PIL algorithm for MLP is measurably superior to the standard online backpropagation (BP) algorithm and the stochastic diagonal Levenberg-Marquardt (SDLM) algorithm in terms of the convergence speed and accuracy. Other appealing features of the PIL algorithm are that it is computationally as simple as the BP algorithm, and as easy to use as the BP algorithm. It, therefore, can be applied, with better performance, to any situations where the standard online BP algorithm is applicable. PMID:17131658

  12. Evolving Robust Gene Regulatory Networks

    PubMed Central

    Noman, Nasimul; Monjo, Taku; Moscato, Pablo; Iba, Hitoshi

    2015-01-01

    Design and implementation of robust network modules is essential for construction of complex biological systems through hierarchical assembly of ‘parts’ and ‘devices’. The robustness of gene regulatory networks (GRNs) is ascribed chiefly to the underlying topology. The automatic designing capability of GRN topology that can exhibit robust behavior can dramatically change the current practice in synthetic biology. A recent study shows that Darwinian evolution can gradually develop higher topological robustness. Subsequently, this work presents an evolutionary algorithm that simulates natural evolution in silico, for identifying network topologies that are robust to perturbations. We present a Monte Carlo based method for quantifying topological robustness and designed a fitness approximation approach for efficient calculation of topological robustness which is computationally very intensive. The proposed framework was verified using two classic GRN behaviors: oscillation and bistability, although the framework is generalized for evolving other types of responses. The algorithm identified robust GRN architectures which were verified using different analysis and comparison. Analysis of the results also shed light on the relationship among robustness, cooperativity and complexity. This study also shows that nature has already evolved very robust architectures for its crucial systems; hence simulation of this natural process can be very valuable for designing robust biological systems. PMID:25616055

  13. Fast cosmological parameter estimation using neural networks

    NASA Astrophysics Data System (ADS)

    Auld, T.; Bridges, M.; Hobson, M. P.; Gull, S. F.

    2007-03-01

    We present a method for accelerating the calculation of cosmic microwave background (CMB) power spectra, matter power spectra and likelihood functions for use in cosmological parameter estimation. The algorithm, called COSMONET, is based on training a multilayer perceptron neural network and shares all the advantages of the recently released PICO algorithm of Fendt & Wandelt, but has several additional benefits in terms of simplicity, computational speed, memory requirements and ease of training. We demonstrate the capabilities of COSMONET by computing CMB power spectra over a box in the parameter space of flat Λ cold dark matter (ΛCDM) models containing the 3σ WMAP1-year confidence region. We also use COSMONET to compute the WMAP3-year (WMAP3) likelihood for flat ΛCDM models and show that marginalized posteriors on parameters derived are very similar to those obtained using CAMB and the WMAP3 code. We find that the average error in the power spectra is typically 2-3 per cent of cosmic variance, and that COSMONET is ~7 × 104 faster than CAMB (for flat models) and ~6 × 106 times faster than the official WMAP3 likelihood code. COSMONET and an interface to COSMOMC are publically available at http://www.mrao.cam.ac.uk/software/cosmonet.

  14. Inferring slowly-changing dynamic gene-regulatory networks

    PubMed Central

    2015-01-01

    Dynamic gene-regulatory networks are complex since the interaction patterns between their components mean that it is impossible to study parts of the network in separation. This holistic character of gene-regulatory networks poses a real challenge to any type of modelling. Graphical models are a class of models that connect the network with a conditional independence relationships between random variables. By interpreting these random variables as gene activities and the conditional independence relationships as functional non-relatedness, graphical models have been used to describe gene-regulatory networks. Whereas the literature has been focused on static networks, most time-course experiments are designed in order to tease out temporal changes in the underlying network. It is typically reasonable to assume that changes in genomic networks are few, because biological systems tend to be stable. We introduce a new model for estimating slow changes in dynamic gene-regulatory networks, which is suitable for high-dimensional data, e.g. time-course microarray data. Our aim is to estimate a dynamically changing genomic network based on temporal activity measurements of the genes in the network. Our method is based on the penalized likelihood with ℓ1-norm, that penalizes conditional dependencies between genes as well as differences between conditional independence elements across time points. We also present a heuristic search strategy to find optimal tuning parameters. We re-write the penalized maximum likelihood problem into a standard convex optimization problem subject to linear equality constraints. We show that our method performs well in simulation studies. Finally, we apply the proposed model to a time-course T-cell dataset. PMID:25917062

  15. Modular Composition of Gene Transcription Networks

    PubMed Central

    Gyorgy, Andras; Del Vecchio, Domitilla

    2014-01-01

    Predicting the dynamic behavior of a large network from that of the composing modules is a central problem in systems and synthetic biology. Yet, this predictive ability is still largely missing because modules display context-dependent behavior. One cause of context-dependence is retroactivity, a phenomenon similar to loading that influences in non-trivial ways the dynamic performance of a module upon connection to other modules. Here, we establish an analysis framework for gene transcription networks that explicitly accounts for retroactivity. Specifically, a module's key properties are encoded by three retroactivity matrices: internal, scaling, and mixing retroactivity. All of them have a physical interpretation and can be computed from macroscopic parameters (dissociation constants and promoter concentrations) and from the modules' topology. The internal retroactivity quantifies the effect of intramodular connections on an isolated module's dynamics. The scaling and mixing retroactivity establish how intermodular connections change the dynamics of connected modules. Based on these matrices and on the dynamics of modules in isolation, we can accurately predict how loading will affect the behavior of an arbitrary interconnection of modules. We illustrate implications of internal, scaling, and mixing retroactivity on the performance of recurrent network motifs, including negative autoregulation, combinatorial regulation, two-gene clocks, the toggle switch, and the single-input motif. We further provide a quantitative metric that determines how robust the dynamic behavior of a module is to interconnection with other modules. This metric can be employed both to evaluate the extent of modularity of natural networks and to establish concrete design guidelines to minimize retroactivity between modules in synthetic systems. PMID:24626132

  16. Modular composition of gene transcription networks.

    PubMed

    Gyorgy, Andras; Del Vecchio, Domitilla

    2014-03-01

    Predicting the dynamic behavior of a large network from that of the composing modules is a central problem in systems and synthetic biology. Yet, this predictive ability is still largely missing because modules display context-dependent behavior. One cause of context-dependence is retroactivity, a phenomenon similar to loading that influences in non-trivial ways the dynamic performance of a module upon connection to other modules. Here, we establish an analysis framework for gene transcription networks that explicitly accounts for retroactivity. Specifically, a module's key properties are encoded by three retroactivity matrices: internal, scaling, and mixing retroactivity. All of them have a physical interpretation and can be computed from macroscopic parameters (dissociation constants and promoter concentrations) and from the modules' topology. The internal retroactivity quantifies the effect of intramodular connections on an isolated module's dynamics. The scaling and mixing retroactivity establish how intermodular connections change the dynamics of connected modules. Based on these matrices and on the dynamics of modules in isolation, we can accurately predict how loading will affect the behavior of an arbitrary interconnection of modules. We illustrate implications of internal, scaling, and mixing retroactivity on the performance of recurrent network motifs, including negative autoregulation, combinatorial regulation, two-gene clocks, the toggle switch, and the single-input motif. We further provide a quantitative metric that determines how robust the dynamic behavior of a module is to interconnection with other modules. This metric can be employed both to evaluate the extent of modularity of natural networks and to establish concrete design guidelines to minimize retroactivity between modules in synthetic systems. PMID:24626132

  17. Stabilizing gene regulatory networks through feedforward loops

    NASA Astrophysics Data System (ADS)

    Kadelka, C.; Murrugarra, D.; Laubenbacher, R.

    2013-06-01

    The global dynamics of gene regulatory networks are known to show robustness to perturbations in the form of intrinsic and extrinsic noise, as well as mutations of individual genes. One molecular mechanism underlying this robustness has been identified as the action of so-called microRNAs that operate via feedforward loops. We present results of a computational study, using the modeling framework of stochastic Boolean networks, which explores the role that such network motifs play in stabilizing global dynamics. The paper introduces a new measure for the stability of stochastic networks. The results show that certain types of feedforward loops do indeed buffer the network against stochastic effects.

  18. Modeling of hysteresis in gene regulatory networks.

    PubMed

    Hu, J; Qin, K R; Xiang, C; Lee, T H

    2012-08-01

    Hysteresis, observed in many gene regulatory networks, has a pivotal impact on biological systems, which enhances the robustness of cell functions. In this paper, a general model is proposed to describe the hysteretic gene regulatory network by combining the hysteresis component and the transient dynamics. The Bouc-Wen hysteresis model is modified to describe the hysteresis component in the mammalian gene regulatory networks. Rigorous mathematical analysis on the dynamical properties of the model is presented to ensure the bounded-input-bounded-output (BIBO) stability and demonstrates that the original Bouc-Wen model can only generate a clockwise hysteresis loop while the modified model can describe both clockwise and counter clockwise hysteresis loops. Simulation studies have shown that the hysteresis loops from our model are consistent with the experimental observations in three mammalian gene regulatory networks and two E.coli gene regulatory networks, which demonstrate the ability and accuracy of the mathematical model to emulate natural gene expression behavior with hysteresis. A comparison study has also been conducted to show that this model fits the experiment data significantly better than previous ones in the literature. The successful modeling of the hysteresis in all the five hysteretic gene regulatory networks suggests that the new model has the potential to be a unified framework for modeling hysteresis in gene regulatory networks and provide better understanding of the general mechanism that drives the hysteretic function. PMID:22588784

  19. Bayesian Nonlinear Model Selection for Gene Regulatory Networks

    PubMed Central

    Ni, Yang; Stingo, Francesco C.; Baladandayuthapani, Veerabhadran

    2015-01-01

    Summary Gene regulatory networks represent the regulatory relationships between genes and their products and are important for exploring and defining the underlying biological processes of cellular systems. We develop a novel framework to recover the structure of nonlinear gene regulatory networks using semiparametric spline-based directed acyclic graphical models. Our use of splines allows the model to have both flexibility in capturing nonlinear dependencies as well as control of overfitting via shrinkage, using mixed model representations of penalized splines. We propose a novel discrete mixture prior on the smoothing parameter of the splines that allows for simultaneous selection of both linear and nonlinear functional relationships as well as inducing sparsity in the edge selection. Using simulation studies, we demonstrate the superior performance of our methods in comparison with several existing approaches in terms of network reconstruction and functional selection. We apply our methods to a gene expression dataset in glioblastoma multiforme, which reveals several interesting and biologically relevant nonlinear relationships. PMID:25854759

  20. EXAMINE: a computational approach to reconstructing gene regulatory networks.

    PubMed

    Deng, Xutao; Geng, Huimin; Ali, Hesham

    2005-08-01

    Reverse-engineering of gene networks using linear models often results in an underdetermined system because of excessive unknown parameters. In addition, the practical utility of linear models has remained unclear. We address these problems by developing an improved method, EXpression Array MINing Engine (EXAMINE), to infer gene regulatory networks from time-series gene expression data sets. EXAMINE takes advantage of sparse graph theory to overcome the excessive-parameter problem with an adaptive-connectivity model and fitting algorithm. EXAMINE also guarantees that the most parsimonious network structure will be found with its incremental adaptive fitting process. Compared to previous linear models, where a fully connected model is used, EXAMINE reduces the number of parameters by O(N), thereby increasing the chance of recovering the underlying regulatory network. The fitting algorithm increments the connectivity during the fitting process until a satisfactory fit is obtained. We performed a systematic study to explore the data mining ability of linear models. A guideline for using linear models is provided: If the system is small (3-20 elements), more than 90% of the regulation pathways can be determined correctly. For a large-scale system, either clustering is needed or it is necessary to integrate information in addition to expression profile. Coupled with the clustering method, we applied EXAMINE to rat central nervous system development (CNS) data with 112 genes. We were able to efficiently generate regulatory networks with statistically significant pathways that have been predicted previously. PMID:15951103

  1. Construction of a gene-gene interaction network with a combined score across multiple approaches.

    PubMed

    Zhang, A M; Song, H; Shen, Y H; Liu, Y

    2015-01-01

    Recent progress in computational methods for inves-tigating physical and functional gene interactions has provided new insights into the complexity of biological processes. An essential part of these methods is presented visually in the form of gene interaction networks that can be valuable in exploring the mechanisms of disease. Here, a combined network based on gene pairs with an extra layer of re-liability was constructed after converting and combining the gene pair scores using a novel algorithm across multiple approaches. Four groups of kidney cancer data sets from ArrayExpress were downloaded and analyzed to identify differentially expressed genes using a rank prod-ucts analysis tool. Gene co-expression network, protein-protein interac-tion, co-occurrence network and a combined network were constructed using empirical Bayesian meta-analysis approach, Search Tool for the Retrieval of Interacting Genes/Proteins (STRING) database, an odds ratio formula of the cBioPortal for Cancer Genomics and a novel rank algorithm with combined score, respectively. The topological features of these networks were then compared to evaluate their performances. The results indicated that the gene pairs and their relationship rank-ings were not uniform. The values of topological parameters, such as clustering coefficient and the fitting coefficient R(2) of interaction net-work constructed using our ranked based combination score, were much greater than the other networks. The combined network had a classic small world property which transferred information quickly and displayed great resilience to the dysfunction of low-degree hubs with high-clustering and short average path length. It also followed distinct-ly a scale-free network with a higher reliability. PMID:26125911

  2. Genes2FANs: connecting genes through functional association networks

    PubMed Central

    2012-01-01

    Background Protein-protein, cell signaling, metabolic, and transcriptional interaction networks are useful for identifying connections between lists of experimentally identified genes/proteins. However, besides physical or co-expression interactions there are many ways in which pairs of genes, or their protein products, can be associated. By systematically incorporating knowledge on shared properties of genes from diverse sources to build functional association networks (FANs), researchers may be able to identify additional functional interactions between groups of genes that are not readily apparent. Results Genes2FANs is a web based tool and a database that utilizes 14 carefully constructed FANs and a large-scale protein-protein interaction (PPI) network to build subnetworks that connect lists of human and mouse genes. The FANs are created from mammalian gene set libraries where mouse genes are converted to their human orthologs. The tool takes as input a list of human or mouse Entrez gene symbols to produce a subnetwork and a ranked list of intermediate genes that are used to connect the query input list. In addition, users can enter any PubMed search term and then the system automatically converts the returned results to gene lists using GeneRIF. This gene list is then used as input to generate a subnetwork from the user’s PubMed query. As a case study, we applied Genes2FANs to connect disease genes from 90 well-studied disorders. We find an inverse correlation between the counts of links connecting disease genes through PPI and links connecting diseases genes through FANs, separating diseases into two categories. Conclusions Genes2FANs is a useful tool for interpreting the relationships between gene/protein lists in the context of their various functions and networks. Combining functional association interactions with physical PPIs can be useful for revealing new biology and help form hypotheses for further experimentation. Our finding that disease genes in

  3. Using gene expression programming to infer gene regulatory networks from time-series data.

    PubMed

    Zhang, Yongqing; Pu, Yifei; Zhang, Haisen; Su, Yabo; Zhang, Lifang; Zhou, Jiliu

    2013-12-01

    Gene regulatory networks inference is currently a topic under heavy research in the systems biology field. In this paper, gene regulatory networks are inferred via evolutionary model based on time-series microarray data. A non-linear differential equation model is adopted. Gene expression programming (GEP) is applied to identify the structure of the model and least mean square (LMS) is used to optimize the parameters in ordinary differential equations (ODEs). The proposed work has been first verified by synthetic data with noise-free and noisy time-series data, respectively, and then its effectiveness is confirmed by three real time-series expression datasets. Finally, a gene regulatory network was constructed with 12 Yeast genes. Experimental results demonstrate that our model can improve the prediction accuracy of microarray time-series data effectively. PMID:24140883

  4. Gene Regulation Networks for Modeling Drosophila Development

    NASA Technical Reports Server (NTRS)

    Mjolsness, E.

    1999-01-01

    This chapter will very briefly introduce and review some computational experiments in using trainable gene regulation network models to simulate and understand selected episodes in the development of the fruit fly, Drosophila Melanogaster.

  5. Supervised classification for gene network reconstruction.

    PubMed

    Soinov, L A

    2003-12-01

    One of the central problems of functional genomics is revealing gene expression networks - the relationships between genes that reflect observations of how the expression level of each gene affects those of others. Microarray data are currently a major source of information about the interplay of biochemical network participants in living cells. Various mathematical techniques, such as differential equations, Bayesian and Boolean models and several statistical methods, have been applied to expression data in attempts to extract the underlying knowledge. Unsupervised clustering methods are often considered as the necessary first step in visualization and analysis of the expression data. As for supervised classification, the problem mainly addressed so far has been how to find discriminative genes separating various samples or experimental conditions. Numerous methods have been applied to identify genes that help to predict treatment outcome or to confirm a diagnosis, as well as to identify primary elements of gene regulatory circuits. However, less attention has been devoted to using supervised learning to uncover relationships between genes and/or their products. To start filling this gap a machine-learning approach for gene networks reconstruction is described here. This approach is based on building classifiers--functions, which determine the state of a gene's transcription machinery through expression levels of other genes. The method can be applied to various cases where relationships between gene expression levels could be expected. PMID:14641098

  6. Inversion of surface parameters using fast learning neural networks

    NASA Technical Reports Server (NTRS)

    Dawson, M. S.; Olvera, J.; Fung, A. K.; Manry, M. T.

    1992-01-01

    A neural network approach to the inversion of surface scattering parameters is presented. Simulated data sets based on a surface scattering model are used so that the data may be viewed as taken from a completely known randomly rough surface. The fast learning (FL) neural network and a multilayer perceptron (MLP) trained with backpropagation learning (BP network) are tested on the simulated backscattering data. The RMS error of training the FL network is found to be less than one half the error of the BP network while requiring one to two orders of magnitude less CPU time. When applied to inversion of parameters from a statistically rough surface, the FL method is successful at recovering the surface permittivity, the surface correlation length, and the RMS surface height in less time and with less error than the BP network. Further applications of the FL neural network to the inversion of parameters from backscatter measurements of an inhomogeneous layer above a half space are shown.

  7. Locus heterogeneity disease genes encode proteins with high interconnectivity in the human protein interaction network

    PubMed Central

    Keith, Benjamin P.; Robertson, David L.; Hentges, Kathryn E.

    2014-01-01

    Mutations in genes potentially lead to a number of genetic diseases with differing severity. These disease genes have been the focus of research in recent years showing that the disease gene population as a whole is not homogeneous, and can be categorized according to their interactions. Locus heterogeneity describes a single disorder caused by mutations in different genes each acting individually to cause the same disease. Using datasets of experimentally derived human disease genes and protein interactions, we created a protein interaction network to investigate the relationships between the products of genes associated with a disease displaying locus heterogeneity, and use network parameters to suggest properties that distinguish these disease genes from the overall disease gene population. Through the manual curation of known causative genes of 100 diseases displaying locus heterogeneity and 397 single-gene Mendelian disorders, we use network parameters to show that our locus heterogeneity network displays distinct properties from the global disease network and a Mendelian network. Using the global human proteome, through random simulation of the network we show that heterogeneous genes display significant interconnectivity. Further topological analysis of this network revealed clustering of locus heterogeneity genes that cause identical disorders, indicating that these disease genes are involved in similar biological processes. We then use this information to suggest additional genes that may contribute to diseases with locus heterogeneity. PMID:25538735

  8. Autonomous Boolean modeling of gene regulatory networks

    NASA Astrophysics Data System (ADS)

    Socolar, Joshua; Sun, Mengyang; Cheng, Xianrui

    2014-03-01

    In cases where the dynamical properties of gene regulatory networks are important, a faithful model must include three key features: a network topology; a functional response of each element to its inputs; and timing information about the transmission of signals across network links. Autonomous Boolean network (ABN) models are efficient representations of these elements and are amenable to analysis. We present an ABN model of the gene regulatory network governing cell fate specification in the early sea urchin embryo, which must generate three bands of distinct tissue types after several cell divisions, beginning from an initial condition with only two distinct cell types. Analysis of the spatial patterning problem and the dynamics of a network constructed from available experimental results reveals that a simple mechanism is at work in this case. Supported by NSF Grant DMS-10-68602

  9. Hopfield network with constraint parameter adaptation for overlapped shape recognition.

    PubMed

    Suganthan, P N; Teoh, E K; Mital, D P

    1999-01-01

    In this paper, we propose an energy formulation for homomorphic graph matching by the Hopfield network and a Lyapunov indirect method-based learning approach to adaptively learn the constraint parameter in the energy function. The adaptation scheme eliminates the need to specify the constraint parameter empirically and generates valid and better quality mappings than the analog Hopfield network with a fixed constraint parameter. The proposed Hopfield network with constraint parameter adaptation is applied to match silhouette images of keys and results are presented. PMID:18252543

  10. Modeling Gene Networks in Saccharomyces cerevisiae Based on Gene Expression Profiles

    PubMed Central

    Zhang, Yulin; Lv, Kebo; Wang, Shudong; Su, Jionglong; Meng, Dazhi

    2015-01-01

    Detailed and innovative analysis of gene regulatory network structures may reveal novel insights to biological mechanisms. Here we study how gene regulatory network in Saccharomyces cerevisiae can differ under aerobic and anaerobic conditions. To achieve this, we discretized the gene expression profiles and calculated the self-entropy of down- and upregulation of gene expression as well as joint entropy. Based on these quantities the uncertainty coefficient was calculated for each gene triplet, following which, separate gene logic networks were constructed for the aerobic and anaerobic conditions. Four structural parameters such as average degree, average clustering coefficient, average shortest path, and average betweenness were used to compare the structure of the corresponding aerobic and anaerobic logic networks. Five genes were identified to be putative key components of the two energy metabolisms. Furthermore, community analysis using the Newman fast algorithm revealed two significant communities for the aerobic but only one for the anaerobic network. David Gene Functional Classification suggests that, under aerobic conditions, one such community reflects the cell cycle and cell replication, while the other one is linked to the mitochondrial respiratory chain function. PMID:26839582

  11. Mutated Genes in Schizophrenia Map to Brain Networks

    MedlinePlus

    ... 2013 Mutated Genes in Schizophrenia Map to Brain Networks Schizophrenia networks in the prefrontal cortex area of the brain. ... of spontaneous mutations in genes that form a network in the front region of the brain. The ...

  12. Inference of Gene Regulatory Network Based on Local Bayesian Networks.

    PubMed

    Liu, Fei; Zhang, Shao-Wu; Guo, Wei-Feng; Wei, Ze-Gang; Chen, Luonan

    2016-08-01

    The inference of gene regulatory networks (GRNs) from expression data can mine the direct regulations among genes and gain deep insights into biological processes at a network level. During past decades, numerous computational approaches have been introduced for inferring the GRNs. However, many of them still suffer from various problems, e.g., Bayesian network (BN) methods cannot handle large-scale networks due to their high computational complexity, while information theory-based methods cannot identify the directions of regulatory interactions and also suffer from false positive/negative problems. To overcome the limitations, in this work we present a novel algorithm, namely local Bayesian network (LBN), to infer GRNs from gene expression data by using the network decomposition strategy and false-positive edge elimination scheme. Specifically, LBN algorithm first uses conditional mutual information (CMI) to construct an initial network or GRN, which is decomposed into a number of local networks or GRNs. Then, BN method is employed to generate a series of local BNs by selecting the k-nearest neighbors of each gene as its candidate regulatory genes, which significantly reduces the exponential search space from all possible GRN structures. Integrating these local BNs forms a tentative network or GRN by performing CMI, which reduces redundant regulations in the GRN and thus alleviates the false positive problem. The final network or GRN can be obtained by iteratively performing CMI and local BN on the tentative network. In the iterative process, the false or redundant regulations are gradually removed. When tested on the benchmark GRN datasets from DREAM challenge as well as the SOS DNA repair network in E.coli, our results suggest that LBN outperforms other state-of-the-art methods (ARACNE, GENIE3 and NARROMI) significantly, with more accurate and robust performance. In particular, the decomposition strategy with local Bayesian networks not only effectively reduce

  13. Inference of Gene Regulatory Network Based on Local Bayesian Networks

    PubMed Central

    Liu, Fei; Zhang, Shao-Wu; Guo, Wei-Feng; Chen, Luonan

    2016-01-01

    The inference of gene regulatory networks (GRNs) from expression data can mine the direct regulations among genes and gain deep insights into biological processes at a network level. During past decades, numerous computational approaches have been introduced for inferring the GRNs. However, many of them still suffer from various problems, e.g., Bayesian network (BN) methods cannot handle large-scale networks due to their high computational complexity, while information theory-based methods cannot identify the directions of regulatory interactions and also suffer from false positive/negative problems. To overcome the limitations, in this work we present a novel algorithm, namely local Bayesian network (LBN), to infer GRNs from gene expression data by using the network decomposition strategy and false-positive edge elimination scheme. Specifically, LBN algorithm first uses conditional mutual information (CMI) to construct an initial network or GRN, which is decomposed into a number of local networks or GRNs. Then, BN method is employed to generate a series of local BNs by selecting the k-nearest neighbors of each gene as its candidate regulatory genes, which significantly reduces the exponential search space from all possible GRN structures. Integrating these local BNs forms a tentative network or GRN by performing CMI, which reduces redundant regulations in the GRN and thus alleviates the false positive problem. The final network or GRN can be obtained by iteratively performing CMI and local BN on the tentative network. In the iterative process, the false or redundant regulations are gradually removed. When tested on the benchmark GRN datasets from DREAM challenge as well as the SOS DNA repair network in E.coli, our results suggest that LBN outperforms other state-of-the-art methods (ARACNE, GENIE3 and NARROMI) significantly, with more accurate and robust performance. In particular, the decomposition strategy with local Bayesian networks not only effectively reduce

  14. The Effect of Network Parameters on Pi-Sigma Neural Network for Temperature Forecasting

    NASA Astrophysics Data System (ADS)

    Husaini, Noor Aida; Ghazali, Rozaida; Nawi, Nazri Mohd; Ismail, Lokman Hakim

    In this paper, we present the effect of network parameters to forecast temperature of a suburban area in Batu Pahat, Johor. The common ways of predicting the temperature using Neural Network has been applied for most meteorological parameters. However, researchers frequently neglected the network parameters which might affect the Neural Network's performance. Therefore, this study tends to explore the effect of network parameters by using Pi Sigma Neural Network (PSNN) with backpropagation algorithm. The network's performance is evaluated using the historical dataset of temperature in Batu Pahat for one step-ahead and benchmarked against Multilayer Perceptron (MLP) for comparison. We found out that, network parameters have significantly affected the performance of PSNN for temperature forecasting. Towards the end of this paper, we concluded the best forecasting model to predict the temperature based on the comparison of our study.

  15. In silico evolution of gene cooption in pattern-forming gene networks.

    PubMed

    Spirov, Alexander V; Sabirov, Marat A; Holloway, David M

    2012-01-01

    Gene recruitment or cooption occurs when a gene, which may be part of an existing gene regulatory network (GRN), comes under the control of a new regulatory system. Such re-arrangement of pre-existing networks is likely more common for increasing genomic complexity than the creation of new genes. Using evolutionary computations (EC), we investigate how cooption affects the evolvability, outgrowth and robustness of GRNs. We use a data-driven model of insect segmentation, for the fruit fly Drosophila, and evaluate fitness by robustness to maternal variability-a major constraint in biological development. We compare two mechanisms of gene cooption: a simpler one with gene Introduction and Withdrawal operators; and one in which GRN elements can be altered by transposon infection. Starting from a minimal 2-gene network, insufficient for fitting the Drosophila gene expression patterns, we find a general trend of coopting available genes into the GRN, in order to better fit the data. With the transposon mechanism, we find co-evolutionary oscillations between genes and their transposons. These oscillations may offer a new technique in EC for overcoming premature convergence. Finally, we comment on how a differential equations (in contrast to Boolean) approach is necessary for addressing realistic continuous variation in biochemical parameters. PMID:23365523

  16. Genes and gene networks implicated in aggression related behaviour.

    PubMed

    Malki, Karim; Pain, Oliver; Du Rietz, Ebba; Tosto, Maria Grazia; Paya-Cano, Jose; Sandnabba, Kenneth N; de Boer, Sietse; Schalkwyk, Leonard C; Sluyter, Frans

    2014-10-01

    Aggressive behaviour is a major cause of mortality and morbidity. Despite of moderate heritability estimates, progress in identifying the genetic factors underlying aggressive behaviour has been limited. There are currently three genetic mouse models of high and low aggression created using selective breeding. This is the first study to offer a global transcriptomic characterization of the prefrontal cortex across all three genetic mouse models of aggression. A systems biology approach has been applied to transcriptomic data across the three pairs of selected inbred mouse strains (Turku Aggressive (TA) and Turku Non-Aggressive (TNA), Short Attack Latency (SAL) and Long Attack Latency (LAL) mice and North Carolina Aggressive (NC900) and North Carolina Non-Aggressive (NC100)), providing novel insight into the neurobiological mechanisms and genetics underlying aggression. First, weighted gene co-expression network analysis (WGCNA) was performed to identify modules of highly correlated genes associated with aggression. Probe sets belonging to gene modules uncovered by WGCNA were carried forward for network analysis using ingenuity pathway analysis (IPA). The RankProd non-parametric algorithm was then used to statistically evaluate expression differences across the genes belonging to modules significantly associated with aggression. IPA uncovered two pathways, involving NF-kB and MAPKs. The secondary RankProd analysis yielded 14 differentially expressed genes, some of which have previously been implicated in pathways associated with aggressive behaviour, such as Adrbk2. The results highlighted plausible candidate genes and gene networks implicated in aggression-related behaviour. PMID:25142712

  17. Geometry and topology of parameter space: investigating measures of robustness in regulatory networks

    PubMed Central

    Chaves, Madalena; Sengupta, Anirvan; Sontag, Eduardo D.

    2010-01-01

    The concept of robustness of regulatory networks has been closely related to the nature of the interactions among genes, and the capability of pattern maintenance or reproducibility. Defining this robustness property is a challenging task, but mathematical models have often associated it to the volume of the space of admissible parameters. Not only the volume of the space but also its topology and geometry contain information on essential aspects of the network, including feasible pathways, switching between two parallel pathways or distinct/disconnected active regions of parameters. A method is presented here to characterize the space of admissible parameters, by writing it as a semi-algebraic set, and then theoretically analyzing its topology and geometry, as well as volume. This method provides a more objective and complete measure of the robustness of a developmental module. As a detailed case study, the segment polarity gene network is analyzed. PMID:18987858

  18. Hysteresis in a synthetic mammalian gene network.

    PubMed

    Kramer, Beat P; Fussenegger, Martin

    2005-07-01

    Bistable and hysteretic switches, enabling cells to adopt multiple internal expression states in response to a single external input signal, have a pivotal impact on biological systems, ranging from cell-fate decisions to cell-cycle control. We have designed a synthetic hysteretic mammalian transcription network. A positive feedback loop, consisting of a transgene and transactivator (TA) cotranscribed by TA's cognate promoter, is repressed by constitutive expression of a macrolide-dependent transcriptional silencer, whose activity is modulated by the macrolide antibiotic erythromycin. The antibiotic concentration, at which a quasi-discontinuous switch of transgene expression occurs, depends on the history of the synthetic transcription circuitry. If the network components are imbalanced, a graded rather than a quasi-discontinuous signal integration takes place. These findings are consistent with a mathematical model. Synthetic gene networks, which are able to emulate natural gene expression behavior, may foster progress in future gene therapy and tissue engineering initiatives. PMID:15972812

  19. Mutational Robustness of Gene Regulatory Networks

    PubMed Central

    van Dijk, Aalt D. J.; van Mourik, Simon; van Ham, Roeland C. H. J.

    2012-01-01

    Mutational robustness of gene regulatory networks refers to their ability to generate constant biological output upon mutations that change network structure. Such networks contain regulatory interactions (transcription factor – target gene interactions) but often also protein-protein interactions between transcription factors. Using computational modeling, we study factors that influence robustness and we infer several network properties governing it. These include the type of mutation, i.e. whether a regulatory interaction or a protein-protein interaction is mutated, and in the case of mutation of a regulatory interaction, the sign of the interaction (activating vs. repressive). In addition, we analyze the effect of combinations of mutations and we compare networks containing monomeric with those containing dimeric transcription factors. Our results are consistent with available data on biological networks, for example based on evolutionary conservation of network features. As a novel and remarkable property, we predict that networks are more robust against mutations in monomer than in dimer transcription factors, a prediction for which analysis of conservation of DNA binding residues in monomeric vs. dimeric transcription factors provides indirect evidence. PMID:22295094

  20. From gene expressions to genetic networks

    NASA Astrophysics Data System (ADS)

    Cieplak, Marek

    2009-03-01

    A method based on the principle of entropy maximization is used to identify the gene interaction network with the highest probability of giving rise to experimentally observed transcript profiles [1]. In its simplest form, the method yields the pairwise gene interaction network, but it can also be extended to deduce higher order correlations. Analysis of microarray data from genes in Saccharomyces cerevisiae chemostat cultures exhibiting energy metabollic oscillations identifies a gene interaction network that reflects the intracellular communication pathways. These pathways adjust cellular metabolic activity and cell division to the limiting nutrient conditions that trigger metabolic oscillations. The success of the present approach in extracting meaningful genetic connections suggests that the maximum entropy principle is a useful concept for understanding living systems, as it is for other complex, nonequilibrium systems. The time-dependent behavior of the genetic network is found to involve only a few fundamental modes [2,3]. [4pt] REFERENCES:[0pt] [1] T. R. Lezon, J. R. Banavar, M. Cieplak, A. Maritan, and N. Fedoroff, Using the principle of entropy maximization to infer genetic interaction networks from gene expression patterns, Proc. Natl. Acad. Sci. (USA) 103, 19033-19038 (2006) [0pt] [2] N. S. Holter, M. Mitra, A. Maritan, M. Cieplak, J. R. Banavar, and N. V. Fedoroff, Fundamental patterns underlying gene expression profiles: simplicity from complexity, Proc. Natl. Acad. Sci. USA 97, 8409-8414 (2000) [0pt] [3] N. S. Holter, A. Maritan, M. Cieplak, N. V. Fedoroff, and J. R. Banavar, Dynamic modeling of gene expression data, Proc. Natl. Acad. Sci. USA 98, 1693-1698 (2001)

  1. Network enrichment analysis: extension of gene-set enrichment analysis to gene networks

    PubMed Central

    2012-01-01

    Background Gene-set enrichment analyses (GEA or GSEA) are commonly used for biological characterization of an experimental gene-set. This is done by finding known functional categories, such as pathways or Gene Ontology terms, that are over-represented in the experimental set; the assessment is based on an overlap statistic. Rich biological information in terms of gene interaction network is now widely available, but this topological information is not used by GEA, so there is a need for methods that exploit this type of information in high-throughput data analysis. Results We developed a method of network enrichment analysis (NEA) that extends the overlap statistic in GEA to network links between genes in the experimental set and those in the functional categories. For the crucial step in statistical inference, we developed a fast network randomization algorithm in order to obtain the distribution of any network statistic under the null hypothesis of no association between an experimental gene-set and a functional category. We illustrate the NEA method using gene and protein expression data from a lung cancer study. Conclusions The results indicate that the NEA method is more powerful than the traditional GEA, primarily because the relationships between gene sets were more strongly captured by network connectivity rather than by simple overlaps. PMID:22966941

  2. [A generalized chemical-kinetic method for modeling gene networks].

    PubMed

    Likhoshvaĭ, V A; Matushkin, Iu G; Ratushnyĭ, A V; Anan'ko, E A; Ignat'eva, E V; Podkolodnaia, O A

    2001-01-01

    Development of methods for mathematical simulation of biological systems and building specific simulations is an important trend of bioinformatics development. Here we describe the method of generalized chemokinetic simulation generating flexible and adequate simulations of various biological systems. Adequate simulations of complex nonlinear gene networks--control system of cholesterol by synthesis in the cell and erythrocyte differentiation and maturation--are given as the examples. The simulations were expressed in terms of unit processes--biochemical reactions. Optimal sets of parameters were determined and the systems were numerically simulated under various conditions. The simulations allow us to study possible functional conditions of these gene networks, calculate consequences of mutations, and define optimal strategies for their correction including therapeutic ones. Graphical user interface for these simulations is available at http://wwwmgs.bionet.nsc.ru/systems/MGL/GeneNet/. PMID:11771132

  3. Optimal Parameter for the Training of Multilayer Perceptron Neural Networks by Using Hierarchical Genetic Algorithm

    SciTech Connect

    Orozco-Monteagudo, Maykel; Taboada-Crispi, Alberto; Gutierrez-Hernandez, Liliana

    2008-11-06

    This paper deals with the controversial topic of the selection of the parameters of a genetic algorithm, in this case hierarchical, used for training of multilayer perceptron neural networks for the binary classification. The parameters to select are the crossover and mutation probabilities of the control and parametric genes and the permanency percent. The results can be considered as a guide for using this kind of algorithm.

  4. Generation of oscillating gene regulatory network motifs

    NASA Astrophysics Data System (ADS)

    van Dorp, M.; Lannoo, B.; Carlon, E.

    2013-07-01

    Using an improved version of an evolutionary algorithm originally proposed by François and Hakim [Proc. Natl. Acad. Sci. USAPNASA60027-842410.1073/pnas.0304532101 101, 580 (2004)], we generated small gene regulatory networks in which the concentration of a target protein oscillates in time. These networks may serve as candidates for oscillatory modules to be found in larger regulatory networks and protein interaction networks. The algorithm was run for 105 times to produce a large set of oscillating modules, which were systematically classified and analyzed. The robustness of the oscillations against variations of the kinetic rates was also determined, to filter out the least robust cases. Furthermore, we show that the set of evolved networks can serve as a database of models whose behavior can be compared to experimentally observed oscillations. The algorithm found three smallest (core) oscillators in which nonlinearities and number of components are minimal. Two of those are two-gene modules: the mixed feedback loop, already discussed in the literature, and an autorepressed gene coupled with a heterodimer. The third one is a single gene module which is competitively regulated by a monomer and a dimer. The evolutionary algorithm also generated larger oscillating networks, which are in part extensions of the three core modules and in part genuinely new modules. The latter includes oscillators which do not rely on feedback induced by transcription factors, but are purely of post-transcriptional type. Analysis of post-transcriptional mechanisms of oscillation may provide useful information for circadian clock research, as recent experiments showed that circadian rhythms are maintained even in the absence of transcription.

  5. Gene regulatory networks and the underlying biology of developmental toxicity

    EPA Science Inventory

    Embryonic cells are specified by large-scale networks of functionally linked regulatory genes. Knowledge of the relevant gene regulatory networks is essential for understanding phenotypic heterogeneity that emerges from disruption of molecular functions, cellular processes or sig...

  6. Parameter estimation and determinability analysis applied to Drosophila gap gene circuits

    PubMed Central

    Ashyraliyev, Maksat; Jaeger, Johannes; Blom, Joke G

    2008-01-01

    Background Mathematical modeling of real-life processes often requires the estimation of unknown parameters. Once the parameters are found by means of optimization, it is important to assess the quality of the parameter estimates, especially if parameter values are used to draw biological conclusions from the model. Results In this paper we describe how the quality of parameter estimates can be analyzed. We apply our methodology to assess parameter determinability for gene circuit models of the gap gene network in early Drosophila embryos. Conclusion Our analysis shows that none of the parameters of the considered model can be determined individually with reasonable accuracy due to correlations between parameters. Therefore, the model cannot be used as a tool to infer quantitative regulatory weights. On the other hand, our results show that it is still possible to draw reliable qualitative conclusions on the regulatory topology of the gene network. Moreover, it improves previous analyses of the same model by allowing us to identify those interactions for which qualitative conclusions are reliable, and those for which they are ambiguous. PMID:18817540

  7. Inversion of parameters for semiarid regions by a neural network

    NASA Technical Reports Server (NTRS)

    Zurk, Lisa M.; Davis, Daniel; Njoku, Eni G.; Tsang, Leung; Hwang, Jenq-Neng

    1992-01-01

    Microwave brightness temperatures obtained from a passive radiative transfer model are inverted through use of a neural network. The model is applicable to semiarid regions and produces dual-polarized brightness temperatures for 6.6-, 10.7-, and 37-GHz frequencies. A range of temperatures is generated by varying three geophysical parameters over acceptable ranges: soil moisture, vegetation moisture, and soil temperature. A multilayered perceptron (MLP) neural network is trained with a subset of the generated temperatures, and the remaining temperatures are inverted using a backpropagation method. Several synthetic terrains are devised and inverted by the network under local constraints. All the inversions show good agreement with the original geophysical parameters, falling within 5 percent of the actual value of the parameter range.

  8. Hybrid stochastic simplifications for multiscale gene networks

    PubMed Central

    Crudu, Alina; Debussche, Arnaud; Radulescu, Ovidiu

    2009-01-01

    Background Stochastic simulation of gene networks by Markov processes has important applications in molecular biology. The complexity of exact simulation algorithms scales with the number of discrete jumps to be performed. Approximate schemes reduce the computational time by reducing the number of simulated discrete events. Also, answering important questions about the relation between network topology and intrinsic noise generation and propagation should be based on general mathematical results. These general results are difficult to obtain for exact models. Results We propose a unified framework for hybrid simplifications of Markov models of multiscale stochastic gene networks dynamics. We discuss several possible hybrid simplifications, and provide algorithms to obtain them from pure jump processes. In hybrid simplifications, some components are discrete and evolve by jumps, while other components are continuous. Hybrid simplifications are obtained by partial Kramers-Moyal expansion [1-3] which is equivalent to the application of the central limit theorem to a sub-model. By averaging and variable aggregation we drastically reduce simulation time and eliminate non-critical reactions. Hybrid and averaged simplifications can be used for more effective simulation algorithms and for obtaining general design principles relating noise to topology and time scales. The simplified models reproduce with good accuracy the stochastic properties of the gene networks, including waiting times in intermittence phenomena, fluctuation amplitudes and stationary distributions. The methods are illustrated on several gene network examples. Conclusion Hybrid simplifications can be used for onion-like (multi-layered) approaches to multi-scale biochemical systems, in which various descriptions are used at various scales. Sets of discrete and continuous variables are treated with different methods and are coupled together in a physically justified approach. PMID:19735554

  9. Coloured noise effects on deformation parameters of permanent GPS networks

    NASA Astrophysics Data System (ADS)

    Razeghi, S. M.; Amiri-Simkooei, A. R.; Sharifi, M. A.

    2016-03-01

    Deformation analysis in general and strain analysis in particular using permanent GPS networks require proper analysis of time-series in which all functional effects are taken into consideration and all stochastic effects are captured using an appropriate noise model. This contribution addresses both issues when considering the strain parameters of a GPS network. Estimates of spatial correlation, time correlated noise, and multivariate power spectrum for daily position time-series of the Southern California Integrated GPS Network (SCIGN) stations collected between 1996 and 2011 are obtained. Significant signals with periods of 13.63 d and those related to the GPS draconitic year are identified in these time-series. We aim to assess the effect of a realistic noise model of the series on the uncertainties of the strain parameters including displacements, normal and shear strains, and rotations. For the SCIGN network considered, the following results are highlighted. Contrary to the common belief, the uncertainties of the displacements parameters become smaller when taking a realistic noise model into account. This however was not the case when assessing the noise characteristics of the normal and shear strain, and rotation parameters. The uncertainties increase nearly by a factor of two, in agreement to what is expected. Some of the significant deformation parameters of the white noise model become less significant in case of the realistic noise model.

  10. Construction of gene regulatory networks using biclustering and bayesian networks

    PubMed Central

    2011-01-01

    Background Understanding gene interactions in complex living systems can be seen as the ultimate goal of the systems biology revolution. Hence, to elucidate disease ontology fully and to reduce the cost of drug development, gene regulatory networks (GRNs) have to be constructed. During the last decade, many GRN inference algorithms based on genome-wide data have been developed to unravel the complexity of gene regulation. Time series transcriptomic data measured by genome-wide DNA microarrays are traditionally used for GRN modelling. One of the major problems with microarrays is that a dataset consists of relatively few time points with respect to the large number of genes. Dimensionality is one of the interesting problems in GRN modelling. Results In this paper, we develop a biclustering function enrichment analysis toolbox (BicAT-plus) to study the effect of biclustering in reducing data dimensions. The network generated from our system was validated via available interaction databases and was compared with previous methods. The results revealed the performance of our proposed method. Conclusions Because of the sparse nature of GRNs, the results of biclustering techniques differ significantly from those of previous methods. PMID:22018164

  11. Coherent organization in gene regulation: a study on six networks

    NASA Astrophysics Data System (ADS)

    Aral, Neşe; Kabakçıoğlu, Alkan

    2016-04-01

    Structural and dynamical fingerprints of evolutionary optimization in biological networks are still unclear. Here we analyze the dynamics of genetic regulatory networks responsible for the regulation of cell cycle and cell differentiation in three organisms or cell types each, and show that they follow a version of Hebb's rule which we have termed coherence. More precisely, we find that simultaneously expressed genes with a common target are less likely to act antagonistically at the attractors of the regulatory dynamics. We then investigate the dependence of coherence on structural parameters, such as the mean number of inputs per node and the activatory/repressory interaction ratio, as well as on dynamically determined quantities, such as the basin size and the number of expressed genes.

  12. Coherent organization in gene regulation: a study on six networks.

    PubMed

    Aral, Neşe; Kabakçıoğlu, Alkan

    2016-01-01

    Structural and dynamical fingerprints of evolutionary optimization in biological networks are still unclear. Here we analyze the dynamics of genetic regulatory networks responsible for the regulation of cell cycle and cell differentiation in three organisms or cell types each, and show that they follow a version of Hebb's rule which we have termed coherence. More precisely, we find that simultaneously expressed genes with a common target are less likely to act antagonistically at the attractors of the regulatory dynamics. We then investigate the dependence of coherence on structural parameters, such as the mean number of inputs per node and the activatory/repressory interaction ratio, as well as on dynamically determined quantities, such as the basin size and the number of expressed genes. PMID:27171925

  13. Pathway network inference from gene expression data

    PubMed Central

    2014-01-01

    Background The development of high-throughput omics technologies enabled genome-wide measurements of the activity of cellular elements and provides the analytical resources for the progress of the Systems Biology discipline. Analysis and interpretation of gene expression data has evolved from the gene to the pathway and interaction level, i.e. from the detection of differentially expressed genes, to the establishment of gene interaction networks and the identification of enriched functional categories. Still, the understanding of biological systems requires a further level of analysis that addresses the characterization of the interaction between functional modules. Results We present a novel computational methodology to study the functional interconnections among the molecular elements of a biological system. The PANA approach uses high-throughput genomics measurements and a functional annotation scheme to extract an activity profile from each functional block -or pathway- followed by machine-learning methods to infer the relationships between these functional profiles. The result is a global, interconnected network of pathways that represents the functional cross-talk within the molecular system. We have applied this approach to describe the functional transcriptional connections during the yeast cell cycle and to identify pathways that change their connectivity in a disease condition using an Alzheimer example. Conclusions PANA is a useful tool to deepen in our understanding of the functional interdependences that operate within complex biological systems. We show the approach is algorithmically consistent and the inferred network is well supported by the available functional data. The method allows the dissection of the molecular basis of the functional connections and we describe the different regulatory mechanisms that explain the network's topology obtained for the yeast cell cycle data. PMID:25032889

  14. Gene Regulatory Networks Elucidating Huanglongbing Disease Mechanisms

    PubMed Central

    Martinelli, Federico; Reagan, Russell L.; Uratsu, Sandra L.; Phu, My L.; Albrecht, Ute; Zhao, Weixiang; Davis, Cristina E.; Bowman, Kim D.; Dandekar, Abhaya M.

    2013-01-01

    Next-generation sequencing was exploited to gain deeper insight into the response to infection by Candidatus liberibacter asiaticus (CaLas), especially the immune disregulation and metabolic dysfunction caused by source-sink disruption. Previous fruit transcriptome data were compared with additional RNA-Seq data in three tissues: immature fruit, and young and mature leaves. Four categories of orchard trees were studied: symptomatic, asymptomatic, apparently healthy, and healthy. Principal component analysis found distinct expression patterns between immature and mature fruits and leaf samples for all four categories of trees. A predicted protein – protein interaction network identified HLB-regulated genes for sugar transporters playing key roles in the overall plant responses. Gene set and pathway enrichment analyses highlight the role of sucrose and starch metabolism in disease symptom development in all tissues. HLB-regulated genes (glucose-phosphate-transporter, invertase, starch-related genes) would likely determine the source-sink relationship disruption. In infected leaves, transcriptomic changes were observed for light reactions genes (downregulation), sucrose metabolism (upregulation), and starch biosynthesis (upregulation). In parallel, symptomatic fruits over-expressed genes involved in photosynthesis, sucrose and raffinose metabolism, and downregulated starch biosynthesis. We visualized gene networks between tissues inducing a source-sink shift. CaLas alters the hormone crosstalk, resulting in weak and ineffective tissue-specific plant immune responses necessary for bacterial clearance. Accordingly, expression of WRKYs (including WRKY70) was higher in fruits than in leaves. Systemic acquired responses were inadequately activated in young leaves, generally considered the sites where most new infections occur. PMID:24086326

  15. Inferring gene regulatory networks via nonlinear state-space models and exploiting sparsity.

    PubMed

    Noor, Amina; Serpedin, Erchin; Nounou, Mohamed; Nounou, Hazem N

    2012-01-01

    This paper considers the problem of learning the structure of gene regulatory networks from gene expression time series data. A more realistic scenario when the state space model representing a gene network evolves nonlinearly is considered while a linear model is assumed for the microarray data. To capture the nonlinearity, a particle filter-based state estimation algorithm is considered instead of the contemporary linear approximation-based approaches. The parameters characterizing the regulatory relations among various genes are estimated online using a Kalman filter. Since a particular gene interacts with a few other genes only, the parameter vector is expected to be sparse. The state estimates delivered by the particle filter and the observed microarray data are then subjected to a LASSO-based least squares regression operation which yields a parsimonious and efficient description of the regulatory network by setting the irrelevant coefficients to zero. The performance of the aforementioned algorithm is compared with the extended Kalman filter (EKF) and Unscented Kalman Filter (UKF) employing the Mean Square Error (MSE) as the fidelity criterion in recovering the parameters of gene regulatory networks from synthetic data and real biological data. Extensive computer simulations illustrate that the proposed particle filter-based network inference algorithm outperforms EKF and UKF, and therefore, it can serve as a natural framework for modeling gene regulatory networks with nonlinear and sparse structure. PMID:22350207

  16. On Bayesian Network Classifiers with Reduced Precision Parameters.

    PubMed

    Tschiatschek, Sebastian; Pernkopf, Franz

    2015-04-01

    Bayesian network classifier (BNCs) are typically implemented on nowadays desktop computers. However, many real world applications require classifier implementation on embedded or low power systems. Aspects for this purpose have not been studied rigorously. We partly close this gap by analyzing reduced precision implementations of BNCs. In detail, we investigate the quantization of the parameters of BNCs with discrete valued nodes including the implications on the classification rate (CR). We derive worst-case and probabilistic bounds on the CR for different bit-widths. These bounds are evaluated on several benchmark datasets. Furthermore, we compare the classification performance and the robustness of BNCs with generatively and discriminatively optimized parameters, i.e. parameters optimized for high data likelihood and parameters optimized for classification, with respect to parameter quantization. Generatively optimized parameters are more robust for very low bit-widths, i.e. less classifications change because of quantization. However, classification performance is better for discriminatively optimized parameters for all but very low bit-widths. Additionally, we perform analysis for margin-optimized tree augmented network (TAN) structures which outperform generatively optimized TAN structures in terms of CR and robustness. PMID:26353293

  17. Consequences of prenatal exposure to diazepam on the respiratory parameters, respiratory network activity and gene expression of alpha1 and alpha2 subunits of GABA(A) receptor in newborn rat.

    PubMed

    Picard, Nathalie; Guenin, Stéphanie; Perrin, Yolande; Hilaire, Gérard; Larnicol, Nicole

    2008-01-01

    Diazepam (DZP) enhances GABA action at GABA(A) receptor. Chronic prenatal administration of DZP delays the appearance of neonatal reflexes. We examined whether maternal intake of DZP might affect respiratory control system in newborn rats (0-3 day-old). This study was conducted on unrestrained animals and medulla-spinal cord preparations. In addition, the level of expression of the genes encoding for the alpha1 and alpha2 subunits of the GABA(A) receptor was assessed by quantitative real-time RT-PCR. In rats exposed to DZP, the respiratory frequency was significantly lower and the tidal volume higher than in controls with no significant alteration of the minute ventilation. The recovery from moderate hypoxia was delayed compared to controls. The respiratory-like frequency of medullary spinal cord preparation from DZP-exposed neonates was higher than in the control group. Acute applications of DZP (1 microM) to these preparations increased respiratory-like frequency in both groups, but this facilitation was attenuated following prenatal DZP exposure. The present data indicate that prenatal exposure to DZP alters both eupneic breathing and the respiratory response to hypoxia. These effects might partly be ascribed to the down-regulation of the expression of genes encoding GABA(A) receptor subunits. On the other hand, the effects of DZP exposure on reduced preparations suggested changes in the GABA(A) receptor efficiency and/or disruption of the normal development of the medullary respiratory network. PMID:18085262

  18. Intersecting transcription networks constrain gene regulatory evolution.

    PubMed

    Sorrells, Trevor R; Booth, Lauren N; Tuch, Brian B; Johnson, Alexander D

    2015-07-16

    Epistasis-the non-additive interactions between different genetic loci-constrains evolutionary pathways, blocking some and permitting others. For biological networks such as transcription circuits, the nature of these constraints and their consequences are largely unknown. Here we describe the evolutionary pathways of a transcription network that controls the response to mating pheromone in yeast. A component of this network, the transcription regulator Ste12, has evolved two different modes of binding to a set of its target genes. In one group of species, Ste12 binds to specific DNA binding sites, while in another lineage it occupies DNA indirectly, relying on a second transcription regulator to recognize DNA. We show, through the construction of various possible evolutionary intermediates, that evolution of the direct mode of DNA binding was not directly accessible to the ancestor. Instead, it was contingent on a lineage-specific change to an overlapping transcription network with a different function, the specification of cell type. These results show that analysing and predicting the evolution of cis-regulatory regions requires an understanding of their positions in overlapping networks, as this placement constrains the available evolutionary pathways. PMID:26153861

  19. Intersecting transcription networks constrain gene regulatory evolution

    PubMed Central

    Sorrells, Trevor R; Booth, Lauren N; Tuch, Brian B; Johnson, Alexander D

    2015-01-01

    Epistasis—the non-additive interactions between different genetic loci—constrains evolutionary pathways, blocking some and permitting others1–8. For biological networks such as transcription circuits, the nature of these constraints and their consequences are largely unknown. Here we describe the evolutionary pathways of a transcription network that controls the response to mating pheromone in yeasts9. A component of this network, the transcription regulator Ste12, has evolved two different modes of binding to a set of its target genes. In one group of species, Ste12 binds to specific DNA binding sites, while in another lineage it occupies DNA indirectly, relying on a second transcription regulator to recognize DNA. We show, through the construction of various possible evolutionary intermediates, that evolution of the direct mode of DNA binding was not directly accessible to the ancestor. Instead, it was contingent on a lineage-specific change to an overlapping transcription network with a different function, the specification of cell type. These results show that analyzing and predicting the evolution of cis-regulatory regions requires an understanding of their positions in overlapping networks, as this placement constrains the available evolutionary pathways. PMID:26153861

  20. Tuning RED parameters in satellite networks using control theory

    NASA Astrophysics Data System (ADS)

    Sridharan, Mukundan; Durresi, Arjan; Chellappan, Sriram; Ozbay, Hitay; Jain, Raj

    2003-08-01

    Congestion in the Internet results in wasted bandwidth and also stands in the way of guaranteeing QoS. The effect of congestion is multiplied many fold in Satellite networks, where the resources are very expensive. Thus congestion control has a special significance in the performance of Satellite networks. In today's Internet, congestion control is implemented mostly using some form of the de facto standard, RED. But tuning of parameters in RED has been a major problem throughout. Achieving high throughput with corresponding low delays is the main goal in parameter setting. It is also desired to keep the oscillations in the queue low to reduce jitter, so that the QoS guarantees can be improved. In this paper, we use a previously linearized fluid flow model of TCP-RED to study the performance and stability of the Queue in the router. We use classical control tools like Tracking Error minimization and Delay Margin to study the performance, stability of the system. We use the above-mentioned tools to provide guidelines for setting the parameters in RED, such that the throughput, delay and jitter of the system are optimized. Thus we provide guidelines for optimizing satellite IP networks. We apply our results exclusively for optimizing the performance of satellite networks, where the effects of congestion are much pronounced and need for optimization is much important. We use ns simulator to validate our results to support our analysis.

  1. Paper-based Synthetic Gene Networks

    PubMed Central

    Pardee, Keith; Green, Alexander A.; Ferrante, Tom; Cameron, D. Ewen; DaleyKeyser, Ajay; Yin, Peng; Collins, James J.

    2014-01-01

    Synthetic gene networks have wide-ranging uses in reprogramming and rewiring organisms. To date, there has not been a way to harness the vast potential of these networks beyond the constraints of a laboratory or in vivo environment. Here, we present an in vitro paper-based platform that provides a new venue for synthetic biologists to operate, and a much-needed medium for the safe deployment of engineered gene circuits beyond the lab. Commercially available cell-free systems are freeze-dried onto paper, enabling the inexpensive, sterile and abiotic distribution of synthetic biology-based technologies for the clinic, global health, industry, research and education. For field use, we create circuits with colorimetric outputs for detection by eye, and fabricate a low-cost, electronic optical interface. We demonstrate this technology with small molecule and RNA actuation of genetic switches, rapid prototyping of complex gene circuits, and programmable in vitro diagnostics, including glucose sensors and strain-specific Ebola virus sensors. PMID:25417167

  2. Paper-based synthetic gene networks.

    PubMed

    Pardee, Keith; Green, Alexander A; Ferrante, Tom; Cameron, D Ewen; DaleyKeyser, Ajay; Yin, Peng; Collins, James J

    2014-11-01

    Synthetic gene networks have wide-ranging uses in reprogramming and rewiring organisms. To date, there has not been a way to harness the vast potential of these networks beyond the constraints of a laboratory or in vivo environment. Here, we present an in vitro paper-based platform that provides an alternate, versatile venue for synthetic biologists to operate and a much-needed medium for the safe deployment of engineered gene circuits beyond the lab. Commercially available cell-free systems are freeze dried onto paper, enabling the inexpensive, sterile, and abiotic distribution of synthetic-biology-based technologies for the clinic, global health, industry, research, and education. For field use, we create circuits with colorimetric outputs for detection by eye and fabricate a low-cost, electronic optical interface. We demonstrate this technology with small-molecule and RNA actuation of genetic switches, rapid prototyping of complex gene circuits, and programmable in vitro diagnostics, including glucose sensors and strain-specific Ebola virus sensors. PMID:25417167

  3. Extraction of exposure parameters by using neural networks

    NASA Astrophysics Data System (ADS)

    Jeon, Kyoung-Ah; Kim, Hyoung-Hee; Yoo, Ji-Yong; Park, Jun-Taek; Oh, Hye-Keun

    2003-06-01

    Dill"s ABC parameters are key parameters for the simulation of photolithography patterning. The exposure parameters of each resist should be exactly known to simulate the desired pattern. In ordinary extracting methods of Dill"s ABC parameters, the changed refractive index and the absorption coefficient of photoresist are needed during exposure process. Generally, these methods are not easy to be applied in a normal fab because of a difficulty of in-situ measuring. An empirical E0 (dose-to-clear) swing curve is used to extract ABC exposure parameters previously by our group. Dill"s ABC parameters are not independent from each other and different values of them would cause the dose to clear swing curve variation. By using the known relationship of ABC parameters, the experimental swing curves are to be matched with the simulated ones in order to extract the parameters. But sometimes this method is not easy in matching the procedure and performing simulation. This procedure would take much time for matching between the experimental data and the simulation by the naked eyes, and also the simulations are performed over and over again for different conditions. In this paper, Dill"s ABC parameters were extracted by applying the values, which are quantitatively determined by measuring the mean value, period, slope, and amplitude of the swing curve, to the neural network algorithm. As a result, Dill"s ABC parameters were able to rapidly and accurately extracted with some of the quantified values of the swing curve. This method of extracting the exposure parameters can be used in a normal fab so that any engineer can easily obtain the exposure parameters and apply them to the simulation tools.

  4. Next-Generation Synthetic Gene Networks

    PubMed Central

    Lu, Timothy K.; Khalil, Ahmad S.; Collins, James J.

    2009-01-01

    Synthetic biology is focused on the rational construction of biological systems based on engineering principles. During the field’s first decade of development, significant progress has been made in designing biological parts and assembling them into genetic circuits to achieve basic functionalities. These circuits have been used to construct proof-of-principle systems with promising results in industrial and medical applications. However, advances in synthetic biology have been limited by a lack of interoperable parts, techniques for dynamically probing biological systems, and frameworks for the reliable construction and operation of complex, higher-order networks. Here, we highlight challenges and goals for next-generation synthetic gene networks, in the context of potential applications in medicine, biotechnology, bioremediation, and bioenergy. PMID:20010597

  5. Pathway-Dependent Effectiveness of Network Algorithms for Gene Prioritization

    PubMed Central

    Shim, Jung Eun; Hwang, Sohyun; Lee, Insuk

    2015-01-01

    A network-based approach has proven useful for the identification of novel genes associated with complex phenotypes, including human diseases. Because network-based gene prioritization algorithms are based on propagating information of known phenotype-associated genes through networks, the pathway structure of each phenotype might significantly affect the effectiveness of algorithms. We systematically compared two popular network algorithms with distinct mechanisms – direct neighborhood which propagates information to only direct network neighbors, and network diffusion which diffuses information throughout the entire network – in prioritization of genes for worm and human phenotypes. Previous studies reported that network diffusion generally outperforms direct neighborhood for human diseases. Although prioritization power is generally measured for all ranked genes, only the top candidates are significant for subsequent functional analysis. We found that high prioritizing power of a network algorithm for all genes cannot guarantee successful prioritization of top ranked candidates for a given phenotype. Indeed, the majority of the phenotypes that were more efficiently prioritized by network diffusion showed higher prioritizing power for top candidates by direct neighborhood. We also found that connectivity among pathway genes for each phenotype largely determines which network algorithm is more effective, suggesting that the network algorithm used for each phenotype should be chosen with consideration of pathway gene connectivity. PMID:26091506

  6. Discovering Implicit Entity Relation with the Gene-Citation-Gene Network

    PubMed Central

    Song, Min; Han, Nam-Gi; Kim, Yong-Hwan; Ding, Ying; Chambers, Tamy

    2013-01-01

    In this paper, we apply the entitymetrics model to our constructed Gene-Citation-Gene (GCG) network. Based on the premise there is a hidden, but plausible, relationship between an entity in one article and an entity in its citing article, we constructed a GCG network of gene pairs implicitly connected through citation. We compare the performance of this GCG network to a gene-gene (GG) network constructed over the same corpus but which uses gene pairs explicitly connected through traditional co-occurrence. Using 331,411 MEDLINE abstracts collected from 18,323 seed articles and their references, we identify 25 gene pairs. A comparison of these pairs with interactions found in BioGRID reveal that 96% of the gene pairs in the GCG network have known interactions. We measure network performance using degree, weighted degree, closeness, betweenness centrality and PageRank. Combining all measures, we find the GCG network has more gene pairs, but a lower matching rate than the GG network. However, combining top ranked genes in both networks produces a matching rate of 35.53%. By visualizing both the GG and GCG networks, we find that cancer is the most dominant disease associated with the genes in both networks. Overall, the study indicates that the GCG network can be useful for detecting gene interaction in an implicit manner. PMID:24358368

  7. Discovering implicit entity relation with the gene-citation-gene network.

    PubMed

    Song, Min; Han, Nam-Gi; Kim, Yong-Hwan; Ding, Ying; Chambers, Tamy

    2013-01-01

    In this paper, we apply the entitymetrics model to our constructed Gene-Citation-Gene (GCG) network. Based on the premise there is a hidden, but plausible, relationship between an entity in one article and an entity in its citing article, we constructed a GCG network of gene pairs implicitly connected through citation. We compare the performance of this GCG network to a gene-gene (GG) network constructed over the same corpus but which uses gene pairs explicitly connected through traditional co-occurrence. Using 331,411 MEDLINE abstracts collected from 18,323 seed articles and their references, we identify 25 gene pairs. A comparison of these pairs with interactions found in BioGRID reveal that 96% of the gene pairs in the GCG network have known interactions. We measure network performance using degree, weighted degree, closeness, betweenness centrality and PageRank. Combining all measures, we find the GCG network has more gene pairs, but a lower matching rate than the GG network. However, combining top ranked genes in both networks produces a matching rate of 35.53%. By visualizing both the GG and GCG networks, we find that cancer is the most dominant disease associated with the genes in both networks. Overall, the study indicates that the GCG network can be useful for detecting gene interaction in an implicit manner. PMID:24358368

  8. Inferring robust gene networks from expression data by a sensitivity-based incremental evolution method

    PubMed Central

    2012-01-01

    Background Reconstructing gene regulatory networks (GRNs) from expression data is one of the most important challenges in systems biology research. Many computational models and methods have been proposed to automate the process of network reconstruction. Inferring robust networks with desired behaviours remains challenging, however. This problem is related to network dynamics but has yet to be investigated using network modeling. Results We propose an incremental evolution approach for inferring GRNs that takes network robustness into consideration and can deal with a large number of network parameters. Our approach includes a sensitivity analysis procedure to iteratively select the most influential network parameters, and it uses a swarm intelligence procedure to perform parameter optimization. We have conducted a series of experiments to evaluate the external behaviors and internal robustness of the networks inferred by the proposed approach. The results and analyses have verified the effectiveness of our approach. Conclusions Sensitivity analysis is crucial to identifying the most sensitive parameters that govern the network dynamics. It can further be used to derive constraints for network parameters in the network reconstruction process. The experimental results show that the proposed approach can successfully infer robust GRNs with desired system behaviors. PMID:22595005

  9. Identifying Functional Gene Regulatory Network Phenotypes Underlying Single Cell Transcriptional Variability

    PubMed Central

    Park, James; Ogunnaike, Babatunde; Schwaber, James; Vadigepalli, Rajanikanth

    2014-01-01

    Summary/abstract Recent analysis of single-cell transcriptomic data has revealed a surprising organization of the transcriptional variability pervasive across individual neurons. In response to distinct combinations of synaptic input-type, a new organization of neuronal subtypes emerged based on transcriptional states that were aligned along a gradient of correlated gene expression. Individual neurons traverse across these transcriptional states in response to cellular inputs. However, the regulatory network interactions driving these changes remain unclear. Here we present a novel fuzzy logic-based approach to infer quantitative gene regulatory network models from highly variable single-cell gene expression data. Our approach involves developing an a priori regulatory network that is then trained against in vivo single-cell gene expression data in order to identify causal gene interactions and corresponding quantitative model parameters. Simulations of the inferred gene regulatory network response to experimentally observed stimuli levels mirrored the pattern and quantitative range of gene expression across individual neurons remarkably well. In addition, the network identification results revealed that distinct regulatory interactions, coupled with differences in the regulatory network stimuli, drive the variable gene expression patterns observed across the neuronal subtypes. We also identified a key difference between the neuronal subtype-specific networks with respect to negative feedback regulation, with the catecholaminergic subtype network lacking such interactions. Furthermore, by varying regulatory network stimuli over a wide range, we identified several cases in which divergent neuronal subtypes could be driven towards similar transcriptional states by distinct stimuli operating on subtype-specific regulatory networks. Based on these results, we conclude that heterogeneous single-cell gene expression profiles should be interpreted through a regulatory

  10. Biomarker Gene Signature Discovery Integrating Network Knowledge

    PubMed Central

    Cun, Yupeng; Fröhlich, Holger

    2012-01-01

    Discovery of prognostic and diagnostic biomarker gene signatures for diseases, such as cancer, is seen as a major step towards a better personalized medicine. During the last decade various methods, mainly coming from the machine learning or statistical domain, have been proposed for that purpose. However, one important obstacle for making gene signatures a standard tool in clinical diagnosis is the typical low reproducibility of these signatures combined with the difficulty to achieve a clear biological interpretation. For that purpose in the last years there has been a growing interest in approaches that try to integrate information from molecular interaction networks. Here we review the current state of research in this field by giving an overview about so-far proposed approaches. PMID:24832044

  11. Neural networks forecast in small catchments with transfer of network parameters

    NASA Astrophysics Data System (ADS)

    Maca, P.; Havlicek, V.; Hermanovsky, M.; Horacek, S.; Pech, P.

    2009-04-01

    This contribution deals with neural network approach for short term forecast on small catchments. The applied methodology is based on theory of multilayer perceptron (MLP), feed forward neural network with back propagation optimization procedure was tested in order to explore the possibilities to transfer parameters between different catchments. Supervised optimization of network parameters and structure was investigated. A software tool was created for these research and operative purposes. The hourly discharges and rainfall data of real flood events served as an input to MLP. Seven catchments with areas, which range from 10 to 250 square kilometres and which are situated in the east part of the Czech Republic, were selected. The input data were normalized by parametric method. Variable configuration of neural network was tested in number of modes represented by different combination of learning and testing data sets. The analysis focuses on ability of the model to forecast the flood event with different peak discharge magnitudes. This should be achieved in both application steps - MLP learning and testing within given catchment and in step of parameter transfer of well learned network to another catchment. The length of prediction ranged from one hour to six hours ahead. The results showed that the model is capable to provide satisfying short term discharge forecast for the most of studied cases, including successful parameter transfer among different catchments. This was accomplished by using optimization of parameters which determine not only the structure and behaviour of applied network but also the transformation of input data.

  12. NetDecoder: a network biology platform that decodes context-specific biological networks and gene activities.

    PubMed

    da Rocha, Edroaldo Lummertz; Ung, Choong Yong; McGehee, Cordelia D; Correia, Cristina; Li, Hu

    2016-06-01

    The sequential chain of interactions altering the binary state of a biomolecule represents the 'information flow' within a cellular network that determines phenotypic properties. Given the lack of computational tools to dissect context-dependent networks and gene activities, we developed NetDecoder, a network biology platform that models context-dependent information flows using pairwise phenotypic comparative analyses of protein-protein interactions. Using breast cancer, dyslipidemia and Alzheimer's disease as case studies, we demonstrate NetDecoder dissects subnetworks to identify key players significantly impacting cell behaviour specific to a given disease context. We further show genes residing in disease-specific subnetworks are enriched in disease-related signalling pathways and information flow profiles, which drive the resulting disease phenotypes. We also devise a novel scoring scheme to quantify key genes-network routers, which influence many genes, key targets, which are influenced by many genes, and high impact genes, which experience a significant change in regulation. We show the robustness of our results against parameter changes. Our network biology platform includes freely available source code (http://www.NetDecoder.org) for researchers to explore genome-wide context-dependent information flow profiles and key genes, given a set of genes of particular interest and transcriptome data. More importantly, NetDecoder will enable researchers to uncover context-dependent drug targets. PMID:26975659

  13. Construction of Gene Regulatory Networks Using Recurrent Neural Networks and Swarm Intelligence

    PubMed Central

    Khan, Abhinandan; Mandal, Sudip; Pal, Rajat Kumar; Saha, Goutam

    2016-01-01

    We have proposed a methodology for the reverse engineering of biologically plausible gene regulatory networks from temporal genetic expression data. We have used established information and the fundamental mathematical theory for this purpose. We have employed the Recurrent Neural Network formalism to extract the underlying dynamics present in the time series expression data accurately. We have introduced a new hybrid swarm intelligence framework for the accurate training of the model parameters. The proposed methodology has been first applied to a small artificial network, and the results obtained suggest that it can produce the best results available in the contemporary literature, to the best of our knowledge. Subsequently, we have implemented our proposed framework on experimental (in vivo) datasets. Finally, we have investigated two medium sized genetic networks (in silico) extracted from GeneNetWeaver, to understand how the proposed algorithm scales up with network size. Additionally, we have implemented our proposed algorithm with half the number of time points. The results indicate that a reduction of 50% in the number of time points does not have an effect on the accuracy of the proposed methodology significantly, with a maximum of just over 15% deterioration in the worst case. PMID:27298752

  14. Reverse engineering of gene regulatory networks.

    PubMed

    Cho, K H; Choo, S M; Jung, S H; Kim, J R; Choi, H S; Kim, J

    2007-05-01

    Systems biology is a multi-disciplinary approach to the study of the interactions of various cellular mechanisms and cellular components. Owing to the development of new technologies that simultaneously measure the expression of genetic information, systems biological studies involving gene interactions are increasingly prominent. In this regard, reconstructing gene regulatory networks (GRNs) forms the basis for the dynamical analysis of gene interactions and related effects on cellular control pathways. Various approaches of inferring GRNs from gene expression profiles and biological information, including machine learning approaches, have been reviewed, with a brief introduction of DNA microarray experiments as typical tools for measuring levels of messenger ribonucleic acid (mRNA) expression. In particular, the inference methods are classified according to the required input information, and the main idea of each method is elucidated by comparing its advantages and disadvantages with respect to the other methods. In addition, recent developments in this field are introduced and discussions on the challenges and opportunities for future research are provided. PMID:17591174

  15. Gene Coexpression Network Analysis as a Source of Functional Annotation for Rice Genes

    PubMed Central

    Childs, Kevin L.; Davidson, Rebecca M.; Buell, C. Robin

    2011-01-01

    With the existence of large publicly available plant gene expression data sets, many groups have undertaken data analyses to construct gene coexpression networks and functionally annotate genes. Often, a large compendium of unrelated or condition-independent expression data is used to construct gene networks. Condition-dependent expression experiments consisting of well-defined conditions/treatments have also been used to create coexpression networks to help examine particular biological processes. Gene networks derived from either condition-dependent or condition-independent data can be difficult to interpret if a large number of genes and connections are present. However, algorithms exist to identify modules of highly connected and biologically relevant genes within coexpression networks. In this study, we have used publicly available rice (Oryza sativa) gene expression data to create gene coexpression networks using both condition-dependent and condition-independent data and have identified gene modules within these networks using the Weighted Gene Coexpression Network Analysis method. We compared the number of genes assigned to modules and the biological interpretability of gene coexpression modules to assess the utility of condition-dependent and condition-independent gene coexpression networks. For the purpose of providing functional annotation to rice genes, we found that gene modules identified by coexpression analysis of condition-dependent gene expression experiments to be more useful than gene modules identified by analysis of a condition-independent data set. We have incorporated our results into the MSU Rice Genome Annotation Project database as additional expression-based annotation for 13,537 genes, 2,980 of which lack a functional annotation description. These results provide two new types of functional annotation for our database. Genes in modules are now associated with groups of genes that constitute a collective functional annotation of those

  16. Noise measurements as proxies for traffic parameters in monitoring networks.

    PubMed

    Can, A; Dekoninck, L; Rademaker, M; Van Renterghem, T; De Baets, B; Botteldooren, D

    2011-12-01

    The present research describes how microphones could be used as proxies for traffic parameter measurements for the estimation of airborne pollutant emissions. We consider two distinct measurement campaigns of 7 and 12 days, at two different locations along the urban ring road in Antwerp, Belgium, where sound pressure levels and traffic parameters were measured simultaneously. Noise indicators are calculated and used to construct models to estimate traffic parameters. It is found that relying on different statistical levels and selecting specific sound frequencies permits an accurate estimation of traffic intensities and mean vehicle speeds, both for light and heavy vehicles. Estimations of R(2) values ranging between 0.81 and 0.92 are obtained, depending on the location and traffic parameters. Furthermore, the usefulness of these estimated traffic parameters in a monitoring strategy is assessed. Carbon monoxide, hydrocarbon and nitrogen oxide emissions are calculated with the airborne pollutant emission model Artemis. The Artemis outputs fed with directly measured and estimated traffic parameters (based on noise measurements) are very similar. Finally, a method is proposed to enable using a model calibrated at one location at another location without the need for new calibration, making it straightforward to include new measurement locations in a monitoring network. PMID:22000916

  17. NetDecoder: a network biology platform that decodes context-specific biological networks and gene activities

    PubMed Central

    da Rocha, Edroaldo Lummertz; Ung, Choong Yong; McGehee, Cordelia D.; Correia, Cristina; Li, Hu

    2016-01-01

    The sequential chain of interactions altering the binary state of a biomolecule represents the ‘information flow’ within a cellular network that determines phenotypic properties. Given the lack of computational tools to dissect context-dependent networks and gene activities, we developed NetDecoder, a network biology platform that models context-dependent information flows using pairwise phenotypic comparative analyses of protein–protein interactions. Using breast cancer, dyslipidemia and Alzheimer's disease as case studies, we demonstrate NetDecoder dissects subnetworks to identify key players significantly impacting cell behaviour specific to a given disease context. We further show genes residing in disease-specific subnetworks are enriched in disease-related signalling pathways and information flow profiles, which drive the resulting disease phenotypes. We also devise a novel scoring scheme to quantify key genes—network routers, which influence many genes, key targets, which are influenced by many genes, and high impact genes, which experience a significant change in regulation. We show the robustness of our results against parameter changes. Our network biology platform includes freely available source code (http://www.NetDecoder.org) for researchers to explore genome-wide context-dependent information flow profiles and key genes, given a set of genes of particular interest and transcriptome data. More importantly, NetDecoder will enable researchers to uncover context-dependent drug targets. PMID:26975659

  18. Phosphorylation network rewiring by gene duplication

    PubMed Central

    Freschi, Luca; Courcelles, Mathieu; Thibault, Pierre; Michnick, Stephen W; Landry, Christian R

    2011-01-01

    Elucidating how complex regulatory networks have assembled during evolution requires a detailed understanding of the evolutionary dynamics that follow gene duplication events, including changes in post-translational modifications. We compared the phosphorylation profiles of paralogous proteins in the budding yeast Saccharomyces cerevisiae to that of a species that diverged from the budding yeast before the duplication of those genes. We found that 100 million years of post-duplication divergence are sufficient for the majority of phosphorylation sites to be lost or gained in one paralog or the other, with a strong bias toward losses. However, some losses may be partly compensated for by the evolution of other phosphosites, as paralogous proteins tend to preserve similar numbers of phosphosites over time. We also found that up to 50% of kinase–substrate relationships may have been rewired during this period. Our results suggest that after gene duplication, proteins tend to subfunctionalize at the level of post-translational regulation and that even when phosphosites are preserved, there is a turnover of the kinases that phosphorylate them. PMID:21734643

  19. How to identify essential genes from molecular networks?

    PubMed Central

    del Rio, Gabriel; Koschützki, Dirk; Coello, Gerardo

    2009-01-01

    Background The prediction of essential genes from molecular networks is a way to test the understanding of essentiality in the context of what is known about the network. However, the current knowledge on molecular network structures is incomplete yet, and consequently the strategies aimed to predict essential genes are prone to uncertain predictions. We propose that simultaneously evaluating different network structures and different algorithms representing gene essentiality (centrality measures) may identify essential genes in networks in a reliable fashion. Results By simultaneously analyzing 16 different centrality measures on 18 different reconstructed metabolic networks for Saccharomyces cerevisiae, we show that no single centrality measure identifies essential genes from these networks in a statistically significant way; however, the combination of at least 2 centrality measures achieves a reliable prediction of most but not all of the essential genes. No improvement is achieved in the prediction of essential genes when 3 or 4 centrality measures were combined. Conclusion The method reported here describes a reliable procedure to predict essential genes from molecular networks. Our results show that essential genes may be predicted only by combining centrality measures, revealing the complex nature of the function of essential genes. PMID:19822021

  20. Gene network inference by fusing data from diverse distributions

    PubMed Central

    Žitnik, Marinka; Zupan, Blaž

    2015-01-01

    Motivation: Markov networks are undirected graphical models that are widely used to infer relations between genes from experimental data. Their state-of-the-art inference procedures assume the data arise from a Gaussian distribution. High-throughput omics data, such as that from next generation sequencing, often violates this assumption. Furthermore, when collected data arise from multiple related but otherwise nonidentical distributions, their underlying networks are likely to have common features. New principled statistical approaches are needed that can deal with different data distributions and jointly consider collections of datasets. Results: We present FuseNet, a Markov network formulation that infers networks from a collection of nonidentically distributed datasets. Our approach is computationally efficient and general: given any number of distributions from an exponential family, FuseNet represents model parameters through shared latent factors that define neighborhoods of network nodes. In a simulation study, we demonstrate good predictive performance of FuseNet in comparison to several popular graphical models. We show its effectiveness in an application to breast cancer RNA-sequencing and somatic mutation data, a novel application of graphical models. Fusion of datasets offers substantial gains relative to inference of separate networks for each dataset. Our results demonstrate that network inference methods for non-Gaussian data can help in accurate modeling of the data generated by emergent high-throughput technologies. Availability and implementation: Source code is at https://github.com/marinkaz/fusenet. Contact: blaz.zupan@fri.uni-lj.si Supplementary information: Supplementary information is available at Bioinformatics online. PMID:26072487

  1. Mechanistically Consistent Reduced Models of Synthetic Gene Networks

    PubMed Central

    Mier-y-Terán-Romero, Luis; Silber, Mary; Hatzimanikatis, Vassily

    2013-01-01

    Designing genetic networks with desired functionalities requires an accurate mathematical framework that accounts for the essential mechanistic details of the system. Here, we formulate a time-delay model of protein translation and mRNA degradation by systematically reducing a detailed mechanistic model that explicitly accounts for the ribosomal dynamics and the cleaving of mRNA by endonucleases. We exploit various technical and conceptual advantages that our time-delay model offers over the mechanistic model to probe the behavior of a self-repressing gene over wide regions of parameter space. We show that a heuristic time-delay model of protein synthesis of a commonly used form yields a notably different prediction for the parameter region where sustained oscillations occur. This suggests that such heuristics can lead to erroneous results. The functional forms that arise from our systematic reduction can be used for every system that involves transcription and translation and they could replace the commonly used heuristic time-delay models for these processes. The results from our analysis have important implications for the design of synthetic gene networks and stress that such design must be guided by a combination of heuristic models and mechanistic models that include all relevant details of the process. PMID:23663853

  2. Centrality Analysis Methods for Biological Networks and Their Application to Gene Regulatory Networks

    PubMed Central

    Koschützki, Dirk; Schreiber, Falk

    2008-01-01

    The structural analysis of biological networks includes the ranking of the vertices based on the connection structure of a network. To support this analysis we discuss centrality measures which indicate the importance of vertices, and demonstrate their applicability on a gene regulatory network. We show that common centrality measures result in different valuations of the vertices and that novel measures tailored to specific biological investigations are useful for the analysis of biological networks, in particular gene regulatory networks. PMID:19787083

  3. Arabidopsis gene co-expression network and its functional modules

    PubMed Central

    Mao, Linyong; Van Hemert, John L; Dash, Sudhansu; Dickerson, Julie A

    2009-01-01

    Background Biological networks characterize the interactions of biomolecules at a systems-level. One important property of biological networks is the modular structure, in which nodes are densely connected with each other, but between which there are only sparse connections. In this report, we attempted to find the relationship between the network topology and formation of modular structure by comparing gene co-expression networks with random networks. The organization of gene functional modules was also investigated. Results We constructed a genome-wide Arabidopsis gene co-expression network (AGCN) by using 1094 microarrays. We then analyzed the topological properties of AGCN and partitioned the network into modules by using an efficient graph clustering algorithm. In the AGCN, 382 hub genes formed a clique, and they were densely connected only to a small subset of the network. At the module level, the network clustering results provide a systems-level understanding of the gene modules that coordinate multiple biological processes to carry out specific biological functions. For instance, the photosynthesis module in AGCN involves a very large number (> 1000) of genes which participate in various biological processes including photosynthesis, electron transport, pigment metabolism, chloroplast organization and biogenesis, cofactor metabolism, protein biosynthesis, and vitamin metabolism. The cell cycle module orchestrated the coordinated expression of hundreds of genes involved in cell cycle, DNA metabolism, and cytoskeleton organization and biogenesis. We also compared the AGCN constructed in this study with a graphical Gaussian model (GGM) based Arabidopsis gene network. The photosynthesis, protein biosynthesis, and cell cycle modules identified from the GGM network had much smaller module sizes compared with the modules found in the AGCN, respectively. Conclusion This study reveals new insight into the topological properties of biological networks. The

  4. The Inferred Cardiogenic Gene Regulatory Network in the Mammalian Heart

    PubMed Central

    Li, Xing; Thiagarajan, Raghuram; Nelson, Timothy J.; Tomita-Mitchell, Aoy; Beard, Daniel A.

    2014-01-01

    Cardiac development is a complex, multiscale process encompassing cell fate adoption, differentiation and morphogenesis. To elucidate pathways underlying this process, a recently developed algorithm to reverse engineer gene regulatory networks was applied to time-course microarray data obtained from the developing mouse heart. Approximately 200 genes of interest were input into the algorithm to generate putative network topologies that are capable of explaining the experimental data via model simulation. To cull specious network interactions, thousands of putative networks are merged and filtered to generate scale-free, hierarchical networks that are statistically significant and biologically relevant. The networks are validated with known gene interactions and used to predict regulatory pathways important for the developing mammalian heart. Area under the precision-recall curve and receiver operator characteristic curve are 9% and 58%, respectively. Of the top 10 ranked predicted interactions, 4 have already been validated. The algorithm is further tested using a network enriched with known interactions and another depleted of them. The inferred networks contained more interactions for the enriched network versus the depleted network. In all test cases, maximum performance of the algorithm was achieved when the purely data-driven method of network inference was combined with a data-independent, functional-based association method. Lastly, the network generated from the list of approximately 200 genes of interest was expanded using gene-profile uniqueness metrics to include approximately 900 additional known mouse genes and to form the most likely cardiogenic gene regulatory network. The resultant network supports known regulatory interactions and contains several novel cardiogenic regulatory interactions. The method outlined herein provides an informative approach to network inference and leads to clear testable hypotheses related to gene regulation. PMID:24971943

  5. Designing a parallel evolutionary algorithm for inferring gene networks on the cloud computing environment

    PubMed Central

    2014-01-01

    Background To improve the tedious task of reconstructing gene networks through testing experimentally the possible interactions between genes, it becomes a trend to adopt the automated reverse engineering procedure instead. Some evolutionary algorithms have been suggested for deriving network parameters. However, to infer large networks by the evolutionary algorithm, it is necessary to address two important issues: premature convergence and high computational cost. To tackle the former problem and to enhance the performance of traditional evolutionary algorithms, it is advisable to use parallel model evolutionary algorithms. To overcome the latter and to speed up the computation, it is advocated to adopt the mechanism of cloud computing as a promising solution: most popular is the method of MapReduce programming model, a fault-tolerant framework to implement parallel algorithms for inferring large gene networks. Results This work presents a practical framework to infer large gene networks, by developing and parallelizing a hybrid GA-PSO optimization method. Our parallel method is extended to work with the Hadoop MapReduce programming model and is executed in different cloud computing environments. To evaluate the proposed approach, we use a well-known open-source software GeneNetWeaver to create several yeast S. cerevisiae sub-networks and use them to produce gene profiles. Experiments have been conducted and the results have been analyzed. They show that our parallel approach can be successfully used to infer networks with desired behaviors and the computation time can be largely reduced. Conclusions Parallel population-based algorithms can effectively determine network parameters and they perform better than the widely-used sequential algorithms in gene network inference. These parallel algorithms can be distributed to the cloud computing environment to speed up the computation. By coupling the parallel model population-based optimization method and the parallel

  6. Optimization of a Stochastically Simulated Gene Network Model via Simulated Annealing

    PubMed Central

    Tomshine, Jonathan; Kaznessis, Yiannis N.

    2006-01-01

    By rearranging naturally occurring genetic components, gene networks can be created that display novel functions. When designing these networks, the kinetic parameters describing DNA/protein binding are of great importance, as these parameters strongly influence the behavior of the resulting gene network. This article presents an optimization method based on simulated annealing to locate combinations of kinetic parameters that produce a desired behavior in a genetic network. Since gene expression is an inherently stochastic process, the simulation component of simulated annealing optimization is conducted using an accurate multiscale simulation algorithm to calculate an ensemble of network trajectories at each iteration of the simulated annealing algorithm. Using the three-gene repressilator of Elowitz and Leibler as an example, we show that gene network optimizations can be conducted using a mechanistically realistic model integrated stochastically. The repressilator is optimized to give oscillations of an arbitrary specified period. These optimized designs may then provide a starting-point for the selection of genetic components needed to realize an in vivo system. PMID:16920827

  7. Neural networks for regional employment forecasts: are the parameters relevant?

    NASA Astrophysics Data System (ADS)

    Patuelli, Roberto; Reggiani, Aura; Nijkamp, Peter; Schanne, Norbert

    2011-03-01

    In this paper, we present a review of various computational experiments concerning neural network (NN) models developed for regional employment forecasting. NNs are nowadays widely used in several fields because of their flexible specification structure. A series of NN experiments is presented in the paper, using two data sets on German NUTS-3 districts. Individual forecasts are computed by our models for each district in order to answer the following question: How relevant are NN parameters in comparison to NN structure? Comprehensive testing of these parameters is limited in the literature. Building on different specifications of NN models—in terms of explanatory variables and NN structures—we propose a systematic choice of NN learning parameters and internal functions by means of a sensitivity analysis. Our results show that different combinations of NN parameters provide significantly varying statistical performance and forecasting power. Finally, we note that the sets of parameters chosen for a given model specification cannot be light-heartedly applied to different or more complex models.

  8. A swarm intelligence framework for reconstructing gene networks: searching for biologically plausible architectures.

    PubMed

    Kentzoglanakis, Kyriakos; Poole, Matthew

    2012-01-01

    In this paper, we investigate the problem of reverse engineering the topology of gene regulatory networks from temporal gene expression data. We adopt a computational intelligence approach comprising swarm intelligence techniques, namely particle swarm optimization (PSO) and ant colony optimization (ACO). In addition, the recurrent neural network (RNN) formalism is employed for modeling the dynamical behavior of gene regulatory systems. More specifically, ACO is used for searching the discrete space of network architectures and PSO for searching the corresponding continuous space of RNN model parameters. We propose a novel solution construction process in the context of ACO for generating biologically plausible candidate architectures. The objective is to concentrate the search effort into areas of the structure space that contain architectures which are feasible in terms of their topological resemblance to real-world networks. The proposed framework is initially applied to the reconstruction of a small artificial network that has previously been studied in the context of gene network reverse engineering. Subsequently, we consider an artificial data set with added noise for reconstructing a subnetwork of the genetic interaction network of S. cerevisiae (yeast). Finally, the framework is applied to a real-world data set for reverse engineering the SOS response system of the bacterium Escherichia coli. Results demonstrate the relative advantage of utilizing problem-specific knowledge regarding biologically plausible structural properties of gene networks over conducting a problem-agnostic search in the vast space of network architectures. PMID:21576756

  9. Tensor methods for parameter estimation and bifurcation analysis of stochastic reaction networks

    PubMed Central

    Liao, Shuohao; Vejchodský, Tomáš; Erban, Radek

    2015-01-01

    Stochastic modelling of gene regulatory networks provides an indispensable tool for understanding how random events at the molecular level influence cellular functions. A common challenge of stochastic models is to calibrate a large number of model parameters against the experimental data. Another difficulty is to study how the behaviour of a stochastic model depends on its parameters, i.e. whether a change in model parameters can lead to a significant qualitative change in model behaviour (bifurcation). In this paper, tensor-structured parametric analysis (TPA) is developed to address these computational challenges. It is based on recently proposed low-parametric tensor-structured representations of classical matrices and vectors. This approach enables simultaneous computation of the model properties for all parameter values within a parameter space. The TPA is illustrated by studying the parameter estimation, robustness, sensitivity and bifurcation structure in stochastic models of biochemical networks. A Matlab implementation of the TPA is available at http://www.stobifan.org. PMID:26063822

  10. Trainable Gene Regulation Networks with Applications to Drosophila Pattern Formation

    NASA Technical Reports Server (NTRS)

    Mjolsness, Eric

    2000-01-01

    This chapter will very briefly introduce and review some computational experiments in using trainable gene regulation network models to simulate and understand selected episodes in the development of the fruit fly, Drosophila melanogaster. For details the reader is referred to the papers introduced below. It will then introduce a new gene regulation network model which can describe promoter-level substructure in gene regulation. As described in chapter 2, gene regulation may be thought of as a combination of cis-acting regulation by the extended promoter of a gene (including all regulatory sequences) by way of the transcription complex, and of trans-acting regulation by the transcription factor products of other genes. If we simplify the cis-action by using a phenomenological model which can be tuned to data, such as a unit or other small portion of an artificial neural network, then the full transacting interaction between multiple genes during development can be modelled as a larger network which can again be tuned or trained to data. The larger network will in general need to have recurrent (feedback) connections since at least some real gene regulation networks do. This is the basic modeling approach taken, which describes how a set of recurrent neural networks can be used as a modeling language for multiple developmental processes including gene regulation within a single cell, cell-cell communication, and cell division. Such network models have been called "gene circuits", "gene regulation networks", or "genetic regulatory networks", sometimes without distinguishing the models from the actual modeled systems.

  11. A Comprehensive Evaluation of Disease Phenotype Networks for Gene Prioritization

    PubMed Central

    Li, Jianhua; Lin, Xiaoyan; Teng, Yueyang; Qi, Shouliang; Xiao, Dayu; Zhang, Jianying; Kang, Yan

    2016-01-01

    Identification of disease-causing genes is a fundamental challenge for human health studies. The phenotypic similarity among diseases may reflect the interactions at the molecular level, and phenotype comparison can be used to predict disease candidate genes. Online Mendelian Inheritance in Man (OMIM) is a database of human genetic diseases and related genes that has become an authoritative source of disease phenotypes. However, disease phenotypes have been described by free text; thus, standardization of phenotypic descriptions is needed before diseases can be compared. Several disease phenotype networks have been established in OMIM using different standardization methods. Two of these networks are important for phenotypic similarity analysis: the first and most commonly used network (mimMiner) is standardized by medical subject heading, and the other network (resnikHPO) is the first to be standardized by human phenotype ontology. This paper comprehensively evaluates for the first time the accuracy of these two networks in gene prioritization based on protein–protein interactions using large-scale, leave-one-out cross-validation experiments. The results show that both networks can effectively prioritize disease-causing genes, and the approach that relates two diseases using a logistic function improves prioritization performance. Tanimoto, one of four methods for normalizing resnikHPO, generates a symmetric network and it performs similarly to mimMiner. Furthermore, an integration of these two networks outperforms either network alone in gene prioritization, indicating that these two disease networks are complementary. PMID:27415759

  12. Graphical Features of Functional Genes in Human Protein Interaction Network.

    PubMed

    Wang, Pei; Chen, Yao; Lü, Jinhu; Wang, Qingyun; Yu, Xinghuo

    2016-06-01

    With the completion of the human genome project, it is feasible to investigate large-scale human protein interaction network (HPIN) with complex networks theory. Proteins are encoded by genes. Essential, viable, disease, conserved, housekeeping (HK) and tissue-enriched (TE) genes are functional genes, which are organized and functioned via interaction networks. Based on up-to-date data from various databases or literature, two large-scale HPINs and six subnetworks are constructed. We illustrate that the HPINs and most of the subnetworks are sparse, small-world, scale-free, disassortative and with hierarchical modularity. Among the six subnetworks, essential, disease and HK subnetworks are more densely connected than the others. Statistical analysis on the topological structures of the HPIN reveals that the lethal, the conserved, the HK and the TE genes are with hallmark graphical features. Receiver operating characteristic (ROC) curves indicate that the essential genes can be distinguished from the viable ones with accuracy as high as almost 70%. Closeness, semi-local and eigenvector centralities can distinguish the HK genes from the TE ones with accuracy around 82%. Furthermore, the Venn diagram, cluster dendgrams and classifications of disease genes reveal that some classes of disease genes are with hallmark graphical features, especially for cancer genes, HK disease genes and TE disease genes. The findings facilitate the identification of some functional genes via topological structures. The investigations shed some light on the characteristics of the compete interactome, which have potential implications in networked medicine and biological network control. PMID:26841412

  13. The Effects of Gene Recruitment on the Evolvability and Robustness of Pattern-Forming Gene Networks

    NASA Astrophysics Data System (ADS)

    Spirov, Alexander V.; Holloway, David M.

    Gene recruitment or co-option is defined as the placement of a new gene under a foreign regulatory system. Such re-arrangement of pre-existing regulatory networks can lead to an increase in genomic complexity. This reorganization is recognized as a major driving force in evolution. We simulated the evolution of gene networks by means of the Genetic Algorithms (GA) technique. We used standard GA methods of point mutation and multi-point crossover, as well as our own operators for introducing or withdrawing new genes on the network. The starting point for our computer evolutionary experiments was a 4-gene dynamic model representing the real genetic network controlling segmentation in the fruit fly Drosophila. Model output was fit to experimentally observed gene expression patterns in the early fly embryo. We compared this to output for networks with more and less genes, and with variation in maternal regulatory input. We found that the mutation operator, together with the gene introduction procedure, was sufficient for recruiting new genes into pre-existing networks. Reinforcement of the evolutionary search by crossover operators facilitates this recruitment, but is not necessary. Gene recruitment causes outgrowth of an evolving network, resulting in redundancy, in the sense that the number of genes goes up, as well as the regulatory interactions on the original genes. The recruited genes can have uniform or patterned expressions, many of which recapitulate gene patterns seen in flies, including genes which are not explicitly put in our model. Recruitment of new genes can affect the evolvability of networks (in general, their ability to produce the variation to facilitate adaptive evolution). We see this in particular with a 2-gene subnetwork. To study robustness, we have subjected the networks to experimental levels of variability in maternal regulatory patterns. The majority of networks are not robust to these perturbations. However, a significant subset of the

  14. Functional-Network-Based Gene Set Analysis Using Gene-Ontology

    PubMed Central

    Chang, Billy; Kustra, Rafal; Tian, Weidong

    2013-01-01

    To account for the functional non-equivalence among a set of genes within a biological pathway when performing gene set analysis, we introduce GOGANPA, a network-based gene set analysis method, which up-weights genes with functions relevant to the gene set of interest. The genes are weighted according to its degree within a genome-scale functional network constructed using the functional annotations available from the gene ontology database. By benchmarking GOGANPA using a well-studied P53 data set and three breast cancer data sets, we will demonstrate the power and reproducibility of our proposed method over traditional unweighted approaches and a competing network-based approach that involves a complex integrated network. GOGANPA’s sole reliance on gene ontology further allows GOGANPA to be widely applicable to the analysis of any gene-ontology-annotated genome. PMID:23418449

  15. C. elegans Metabolic Gene Regulatory Networks Govern the Cellular Economy

    PubMed Central

    Watson, Emma; Walhout, Albertha J.M.

    2014-01-01

    Diet greatly impacts metabolism in health and disease. In response to the presence or absence of specific nutrients, metabolic gene regulatory networks sense the metabolic state of the cell and regulate metabolic flux accordingly, for instance by the transcriptional control of metabolic enzymes. Here we discuss recent insights regarding metazoan metabolic regulatory networks using the nematode Caenorhabditis elegans as a model, including the modular organization of metabolic gene regulatory networks, the prominent impact of diet on the transcriptome and metabolome, specialized roles of nuclear hormone receptors in responding to dietary conditions, regulation of metabolic genes and metabolic regulators by microRNAs, and feedback between metabolic genes and their regulators. PMID:24731597

  16. Hidden Markov induced Dynamic Bayesian Network for recovering time evolving gene regulatory networks.

    PubMed

    Zhu, Shijia; Wang, Yadong

    2015-01-01

    Dynamic Bayesian Networks (DBN) have been widely used to recover gene regulatory relationships from time-series data in computational systems biology. Its standard assumption is 'stationarity', and therefore, several research efforts have been recently proposed to relax this restriction. However, those methods suffer from three challenges: long running time, low accuracy and reliance on parameter settings. To address these problems, we propose a novel non-stationary DBN model by extending each hidden node of Hidden Markov Model into a DBN (called HMDBN), which properly handles the underlying time-evolving networks. Correspondingly, an improved structural EM algorithm is proposed to learn the HMDBN. It dramatically reduces searching space, thereby substantially improving computational efficiency. Additionally, we derived a novel generalized Bayesian Information Criterion under the non-stationary assumption (called BWBIC), which can help significantly improve the reconstruction accuracy and largely reduce over-fitting. Moreover, the re-estimation formulas for all parameters of our model are derived, enabling us to avoid reliance on parameter settings. Compared to the state-of-the-art methods, the experimental evaluation of our proposed method on both synthetic and real biological data demonstrates more stably high prediction accuracy and significantly improved computation efficiency, even with no prior knowledge and parameter settings. PMID:26680653

  17. Hidden Markov induced Dynamic Bayesian Network for recovering time evolving gene regulatory networks

    NASA Astrophysics Data System (ADS)

    Zhu, Shijia; Wang, Yadong

    2015-12-01

    Dynamic Bayesian Networks (DBN) have been widely used to recover gene regulatory relationships from time-series data in computational systems biology. Its standard assumption is ‘stationarity’, and therefore, several research efforts have been recently proposed to relax this restriction. However, those methods suffer from three challenges: long running time, low accuracy and reliance on parameter settings. To address these problems, we propose a novel non-stationary DBN model by extending each hidden node of Hidden Markov Model into a DBN (called HMDBN), which properly handles the underlying time-evolving networks. Correspondingly, an improved structural EM algorithm is proposed to learn the HMDBN. It dramatically reduces searching space, thereby substantially improving computational efficiency. Additionally, we derived a novel generalized Bayesian Information Criterion under the non-stationary assumption (called BWBIC), which can help significantly improve the reconstruction accuracy and largely reduce over-fitting. Moreover, the re-estimation formulas for all parameters of our model are derived, enabling us to avoid reliance on parameter settings. Compared to the state-of-the-art methods, the experimental evaluation of our proposed method on both synthetic and real biological data demonstrates more stably high prediction accuracy and significantly improved computation efficiency, even with no prior knowledge and parameter settings.

  18. Hidden Markov induced Dynamic Bayesian Network for recovering time evolving gene regulatory networks

    PubMed Central

    Zhu, Shijia; Wang, Yadong

    2015-01-01

    Dynamic Bayesian Networks (DBN) have been widely used to recover gene regulatory relationships from time-series data in computational systems biology. Its standard assumption is ‘stationarity’, and therefore, several research efforts have been recently proposed to relax this restriction. However, those methods suffer from three challenges: long running time, low accuracy and reliance on parameter settings. To address these problems, we propose a novel non-stationary DBN model by extending each hidden node of Hidden Markov Model into a DBN (called HMDBN), which properly handles the underlying time-evolving networks. Correspondingly, an improved structural EM algorithm is proposed to learn the HMDBN. It dramatically reduces searching space, thereby substantially improving computational efficiency. Additionally, we derived a novel generalized Bayesian Information Criterion under the non-stationary assumption (called BWBIC), which can help significantly improve the reconstruction accuracy and largely reduce over-fitting. Moreover, the re-estimation formulas for all parameters of our model are derived, enabling us to avoid reliance on parameter settings. Compared to the state-of-the-art methods, the experimental evaluation of our proposed method on both synthetic and real biological data demonstrates more stably high prediction accuracy and significantly improved computation efficiency, even with no prior knowledge and parameter settings. PMID:26680653

  19. Identifying disease candidate genes via large-scale gene network analysis.

    PubMed

    Kim, Haseong; Park, Taesung; Gelenbe, Erol

    2014-01-01

    Gene Regulatory Networks (GRN) provide systematic views of complex living systems, offering reliable and large-scale GRNs to identify disease candidate genes. A reverse engineering technique, Bayesian Model Averaging-based Networks (BMAnet), which ensembles all appropriate linear models to tackle uncertainty in model selection that integrates heterogeneous biological data sets is introduced. Using network evaluation metrics, we compare the networks that are thus identified. The metric 'Random walk with restart (Rwr)' is utilised to search for disease genes. In a simulation our method shows better performance than elastic-net and Gaussian graphical models, but topological quantities vary among the three methods. Using real-data, brain tumour gene expression samples consisting of non-tumour, grade III and grade IV are analysed to estimate networks with a total of 4422 genes. Based on these networks, 169 brain tumour-related candidate genes were identified and some were found to relate to 'wound', 'apoptosis', and 'cell death' processes. PMID:25796737

  20. Pathogenic Network Analysis Predicts Candidate Genes for Cervical Cancer

    PubMed Central

    Zhang, Yun-Xia

    2016-01-01

    Purpose. The objective of our study was to predicate candidate genes in cervical cancer (CC) using a network-based strategy and to understand the pathogenic process of CC. Methods. A pathogenic network of CC was extracted based on known pathogenic genes (seed genes) and differentially expressed genes (DEGs) between CC and normal controls. Subsequently, cluster analysis was performed to identify the subnetworks in the pathogenic network using ClusterONE. Each gene in the pathogenic network was assigned a weight value, and then candidate genes were obtained based on the weight distribution. Eventually, pathway enrichment analysis for candidate genes was performed. Results. In this work, a total of 330 DEGs were identified between CC and normal controls. From the pathogenic network, 2 intensely connected clusters were extracted, and a total of 52 candidate genes were detected under the weight values greater than 0.10. Among these candidate genes, VIM had the highest weight value. Moreover, candidate genes MMP1, CDC45, and CAT were, respectively, enriched in pathway in cancer, cell cycle, and methane metabolism. Conclusion. Candidate pathogenic genes including MMP1, CDC45, CAT, and VIM might be involved in the pathogenesis of CC. We believe that our results can provide theoretical guidelines for future clinical application. PMID:27034707

  1. Implicit methods for qualitative modeling of gene regulatory networks.

    PubMed

    Garg, Abhishek; Mohanram, Kartik; De Micheli, Giovanni; Xenarios, Ioannis

    2012-01-01

    Advancements in high-throughput technologies to measure increasingly complex biological phenomena at the genomic level are rapidly changing the face of biological research from the single-gene single-protein experimental approach to studying the behavior of a gene in the context of the entire genome (and proteome). This shift in research methodologies has resulted in a new field of network biology that deals with modeling cellular behavior in terms of network structures such as signaling pathways and gene regulatory networks. In these networks, different biological entities such as genes, proteins, and metabolites interact with each other, giving rise to a dynamical system. Even though there exists a mature field of dynamical systems theory to model such network structures, some technical challenges are unique to biology such as the inability to measure precise kinetic information on gene-gene or gene-protein interactions and the need to model increasingly large networks comprising thousands of nodes. These challenges have renewed interest in developing new computational techniques for modeling complex biological systems. This chapter presents a modeling framework based on Boolean algebra and finite-state machines that are reminiscent of the approach used for digital circuit synthesis and simulation in the field of very-large-scale integration (VLSI). The proposed formalism enables a common mathematical framework to develop computational techniques for modeling different aspects of the regulatory networks such as steady-state behavior, stochasticity, and gene perturbation experiments. PMID:21938638

  2. Stochastic Gene Expression in Networks of Post-transcriptional Regulators

    NASA Astrophysics Data System (ADS)

    Baker, Charles; Jia, Tao; Pendar, Hodjat; Kulkarni, Rahul

    2012-02-01

    Post-transcriptional regulators, such as small RNAs and microRNAs, are critical elements of diverse cellular pathways. It has been postulated that, in several important cases, the role of these regulators is to to modulate the noise in gene expression for the regulated target. Correspondingly, general stochastic models have been developed, and results obtained, for the case in which a single sRNA regulates a single mRNA target. We generalize these results to networks containing a single mRNA regulated by multiple sRNAs and to networks containing multiple mRNAs regulated by a single sRNA. For these systems, we obtain exact expressions relating the mean levels of the sRNAs to the mean levels of the mRNAs. Additionally, we consider the convergence of the original model to an approximate model which considers sRNA concentrations to be high; for the latter model we derive an analytic form for the generating function of the protein distribution. Finally, we discuss potential experimental protocols which, in combination with the derived results, can be used to infer the underlying gene expression parameters.

  3. Variability of multifractal parameters in an urban precipitation monitoring network

    NASA Astrophysics Data System (ADS)

    Licznar, Paweł; De Michele, Carlo; Dżugaj, Dagmara; Niesobska, Maria

    2014-05-01

    Precipitation especially over urban areas is considered a highly non-linear process, with wide variability over a broad range of temporal and spatial scales. Despite obvious limitations of rainfall gauges location at urban sites, rainfall monitoring by gauge networks is a standard solution of urban hydrology. Often urban precipitation gauge networks are formed by modern electronic gauges and connected to control units of centralized urban drainage systems. Precipitation data, recorded online through these gauge networks, are used in so called Real-Time-Control (RTC) systems for the development of optimal strategies of urban drainage outflows management. As a matter of fact, the operation of RTC systems is motivated mainly by the urge of reducing the severity of urban floods and combined sewerage overflows, but at the same time, it creates new valuable precipitation data sources. The variability of precipitation process could be achieved by investigating multifractal behavior displayed by the temporal structure of precipitation data. There are multiply scientific communications concerning multifractal properties of point-rainfall data from different worldwide locations. However, very little is known about the close variability of multifractal parameters among closely located gauges, at the distances of single kilometers. Having this in mind, here we assess the variability of multifractal parameters among gauges of the urban precipitation monitoring network in Warsaw, Poland. We base our analysis on the set of 1-minute rainfall time series recorded in the period 2008-2011 by 25 electronic weighing type gauges deployed around the city by the Municipal Water Supply and Sewerage Company in Warsaw as a part of local RTC system. The presence of scale invariance and multifractal properties in the precipitation process was investigated with spectral analysis, functional box counting method and studying the probability distributions and statistical moments of the rainfall

  4. An Arabidopsis gene network based on the graphical Gaussian model

    PubMed Central

    Ma, Shisong; Gong, Qingqiu; Bohnert, Hans J.

    2007-01-01

    We describe a gene network for the Arabidopsis thaliana transcriptome based on a modified graphical Gaussian model (GGM). Through partial correlation (pcor), GGM infers coregulation patterns between gene pairs conditional on the behavior of other genes. Regularized GGM calculated pcor between gene pairs among ∼2000 input genes at a time. Regularized GGM coupled with iterative random samplings of genes was expanded into a network that covered the Arabidopsis genome (22,266 genes). This resulted in a network of 18,625 interactions (edges) among 6760 genes (nodes) with high confidence and connections representing ∼0.01% of all possible edges. When queried for selected genes, locally coherent subnetworks mainly related to metabolic functions, and stress responses emerged. Examples of networks for biochemical pathways, cell wall metabolism, and cold responses are presented. GGM displayed known coregulation pathways as subnetworks and added novel components to known edges. Finally, the network reconciled individual subnetworks in a topology joined at the whole-genome level and provided a general framework that can instruct future studies on plant metabolism and stress responses. The network model is included. PMID:17921353

  5. Hub-Centered Gene Network Reconstruction Using Automatic Relevance Determination

    PubMed Central

    Böck, Matthias; Ogishima, Soichi; Tanaka, Hiroshi; Kramer, Stefan; Kaderali, Lars

    2012-01-01

    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. PMID:22570688

  6. Using Effective Subnetworks to Predict Selected Properties of Gene Networks

    PubMed Central

    Gunaratne, Gemunu H.; Gunaratne, Preethi H.; Seemann, Lars; Török, Andrei

    2010-01-01

    Background Difficulties associated with implementing gene therapy are caused by the complexity of the underlying regulatory networks. The forms of interactions between the hundreds of genes, proteins, and metabolites in these networks are not known very accurately. An alternative approach is to limit consideration to genes on the network. Steady state measurements of these influence networks can be obtained from DNA microarray experiments. However, since they contain a large number of nodes, the computation of influence networks requires a prohibitively large set of microarray experiments. Furthermore, error estimates of the network make verifiable predictions impossible. Methodology/Principal Findings Here, we propose an alternative approach. Rather than attempting to derive an accurate model of the network, we ask what questions can be addressed using lower dimensional, highly simplified models. More importantly, is it possible to use such robust features in applications? We first identify a small group of genes that can be used to affect changes in other nodes of the network. The reduced effective empirical subnetwork (EES) can be computed using steady state measurements on a small number of genetically perturbed systems. We show that the EES can be used to make predictions on expression profiles of other mutants, and to compute how to implement pre-specified changes in the steady state of the underlying biological process. These assertions are verified in a synthetic influence network. We also use previously published experimental data to compute the EES associated with an oxygen deprivation network of E.coli, and use it to predict gene expression levels on a double mutant. The predictions are significantly different from the experimental results for less than of genes. Conclusions/Significance The constraints imposed by gene expression levels of mutants can be used to address a selected set of questions about a gene network. PMID:20949025

  7. Reveal genes functionally associated with ACADS by a network study.

    PubMed

    Chen, Yulong; Su, Zhiguang

    2015-09-15

    Establishing a systematic network is aimed at finding essential human gene-gene/gene-disease pathway by means of network inter-connecting patterns and functional annotation analysis. In the present study, we have analyzed functional gene interactions of short-chain acyl-coenzyme A dehydrogenase gene (ACADS). ACADS plays a vital role in free fatty acid β-oxidation and regulates energy homeostasis. Modules of highly inter-connected genes in disease-specific ACADS network are derived by integrating gene function and protein interaction data. Among the 8 genes in ACADS web retrieved from both STRING and GeneMANIA, ACADS is effectively conjoined with 4 genes including HAHDA, HADHB, ECHS1 and ACAT1. The functional analysis is done via ontological briefing and candidate disease identification. We observed that the highly efficient-interlinked genes connected with ACADS are HAHDA, HADHB, ECHS1 and ACAT1. Interestingly, the ontological aspect of genes in the ACADS network reveals that ACADS, HAHDA and HADHB play equally vital roles in fatty acid metabolism. The gene ACAT1 together with ACADS indulges in ketone metabolism. Our computational gene web analysis also predicts potential candidate disease recognition, thus indicating the involvement of ACADS, HAHDA, HADHB, ECHS1 and ACAT1 not only with lipid metabolism but also with infant death syndrome, skeletal myopathy, acute hepatic encephalopathy, Reye-like syndrome, episodic ketosis, and metabolic acidosis. The current study presents a comprehensible layout of ACADS network, its functional strategies and candidate disease approach associated with ACADS network. PMID:26045367

  8. Network analysis of EtOH-related candidate genes.

    PubMed

    Guo, An-Yuan; Sun, Jingchun; Jia, Peilin; Zhao, Zhongming

    2010-05-01

    Recently, we collected many large-scale datasets for alcohol dependence and EtOH response in five organisms and deposited them in our EtOH-related gene resource database (ERGR, http://bioinfo.mc.vanderbilt.edu/ERGR/). Based on multidimensional evidence among these datasets, we prioritized 57 EtOH-related candidate genes. To explore their biological roles, and the molecular mechanisms of EtOH response and alcohol dependence, we examined the features of these genes by the Gene Ontology (GO) term-enrichment test and network/pathway analysis. Our analysis revealed that these candidate genes were highly enriched in alcohol dependence/alcoholism and highly expressed in brain or liver tissues. All the significantly enriched GO terms were related to neurotransmitter systems or EtOH metabolic processes. Using the Ingenuity Pathway Analysis system, we found that these genes were involved in networks of neurological disease, cardiovascular disease, inflammatory response, and small molecular metabolism. Many key genes in signaling pathways were in the central position of these networks. Furthermore, our protein-protein interaction (PPI) network analysis suggested some novel candidate genes which also had evidence in the ERGR database. This study demonstrated that our candidate gene selection is effective and our network/pathway analysis is useful for uncovering the molecular mechanisms of EtOH response and alcohol dependence. This approach can be applied to study the features of candidate genes of other complex traits/phenotypes. PMID:20491071

  9. An efficient automated parameter tuning framework for spiking neural networks

    PubMed Central

    Carlson, Kristofor D.; Nageswaran, Jayram Moorkanikara; Dutt, Nikil; Krichmar, Jeffrey L.

    2014-01-01

    As the desire for biologically realistic spiking neural networks (SNNs) increases, tuning the enormous number of open parameters in these models becomes a difficult challenge. SNNs have been used to successfully model complex neural circuits that explore various neural phenomena such as neural plasticity, vision systems, auditory systems, neural oscillations, and many other important topics of neural function. Additionally, SNNs are particularly well-adapted to run on neuromorphic hardware that will support biological brain-scale architectures. Although the inclusion of realistic plasticity equations, neural dynamics, and recurrent topologies has increased the descriptive power of SNNs, it has also made the task of tuning these biologically realistic SNNs difficult. To meet this challenge, we present an automated parameter tuning framework capable of tuning SNNs quickly and efficiently using evolutionary algorithms (EA) and inexpensive, readily accessible graphics processing units (GPUs). A sample SNN with 4104 neurons was tuned to give V1 simple cell-like tuning curve responses and produce self-organizing receptive fields (SORFs) when presented with a random sequence of counterphase sinusoidal grating stimuli. A performance analysis comparing the GPU-accelerated implementation to a single-threaded central processing unit (CPU) implementation was carried out and showed a speedup of 65× of the GPU implementation over the CPU implementation, or 0.35 h per generation for GPU vs. 23.5 h per generation for CPU. Additionally, the parameter value solutions found in the tuned SNN were studied and found to be stable and repeatable. The automated parameter tuning framework presented here will be of use to both the computational neuroscience and neuromorphic engineering communities, making the process of constructing and tuning large-scale SNNs much quicker and easier. PMID:24550771

  10. Hopfield neural networks for on-line parameter estimation.

    PubMed

    Alonso, Hugo; Mendonça, Teresa; Rocha, Paula

    2009-05-01

    This paper addresses the problem of using Hopfield Neural Networks (HNNs) for on-line parameter estimation. As presented here, a HNN is a nonautonomous nonlinear dynamical system able to produce a time-evolving estimate of the actual parameterization. The stability analysis of the HNN is carried out under more general assumptions than those previously considered in the literature, yielding a weaker sufficient condition under which the estimation error asymptotically converges to zero. Furthermore, a robustness analysis is made, showing that, under the presence of perturbations, the estimation error converges to a bounded neighbourhood of zero, whose size decreases with the size of the perturbations. The results obtained are illustrated by means of two case studies, where the HNN is compared with two other methods. PMID:19386467

  11. Analysis of bHLH coding genes using gene co-expression network approach.

    PubMed

    Srivastava, Swati; Sanchita; Singh, Garima; Singh, Noopur; Srivastava, Gaurava; Sharma, Ashok

    2016-07-01

    Network analysis provides a powerful framework for the interpretation of data. It uses novel reference network-based metrices for module evolution. These could be used to identify module of highly connected genes showing variation in co-expression network. In this study, a co-expression network-based approach was used for analyzing the genes from microarray data. Our approach consists of a simple but robust rank-based network construction. The publicly available gene expression data of Solanum tuberosum under cold and heat stresses were considered to create and analyze a gene co-expression network. The analysis provide highly co-expressed module of bHLH coding genes based on correlation values. Our approach was to analyze the variation of genes expression, according to the time period of stress through co-expression network approach. As the result, the seed genes were identified showing multiple connections with other genes in the same cluster. Seed genes were found to be vary in different time periods of stress. These analyzed seed genes may be utilized further as marker genes for developing the stress tolerant plant species. PMID:27178572

  12. The transfer and transformation of collective network information in gene-matched networks

    PubMed Central

    Kitsukawa, Takashi; Yagi, Takeshi

    2015-01-01

    Networks, such as the human society network, social and professional networks, and biological system networks, contain vast amounts of information. Information signals in networks are distributed over nodes and transmitted through intricately wired links, making the transfer and transformation of such information difficult to follow. Here we introduce a novel method for describing network information and its transfer using a model network, the Gene-matched network (GMN), in which nodes (neurons) possess attributes (genes). In the GMN, nodes are connected according to their expression of common genes. Because neurons have multiple genes, the GMN is cluster-rich. We show that, in the GMN, information transfer and transformation were controlled systematically, according to the activity level of the network. Furthermore, information transfer and transformation could be traced numerically with a vector using genes expressed in the activated neurons, the active-gene array, which was used to assess the relative activity among overlapping neuronal groups. Interestingly, this coding style closely resembles the cell-assembly neural coding theory. The method introduced here could be applied to many real-world networks, since many systems, including human society and various biological systems, can be represented as a network of this type. PMID:26450411

  13. The transfer and transformation of collective network information in gene-matched networks.

    PubMed

    Kitsukawa, Takashi; Yagi, Takeshi

    2015-01-01

    Networks, such as the human society network, social and professional networks, and biological system networks, contain vast amounts of information. Information signals in networks are distributed over nodes and transmitted through intricately wired links, making the transfer and transformation of such information difficult to follow. Here we introduce a novel method for describing network information and its transfer using a model network, the Gene-matched network (GMN), in which nodes (neurons) possess attributes (genes). In the GMN, nodes are connected according to their expression of common genes. Because neurons have multiple genes, the GMN is cluster-rich. We show that, in the GMN, information transfer and transformation were controlled systematically, according to the activity level of the network. Furthermore, information transfer and transformation could be traced numerically with a vector using genes expressed in the activated neurons, the active-gene array, which was used to assess the relative activity among overlapping neuronal groups. Interestingly, this coding style closely resembles the cell-assembly neural coding theory. The method introduced here could be applied to many real-world networks, since many systems, including human society and various biological systems, can be represented as a network of this type. PMID:26450411

  14. Evolutionary and Topological Properties of Genes and Community Structures in Human Gene Regulatory Networks.

    PubMed

    Szedlak, Anthony; Smith, Nicholas; Liu, Li; Paternostro, Giovanni; Piermarocchi, Carlo

    2016-06-01

    The diverse, specialized genes present in today's lifeforms evolved from a common core of ancient, elementary genes. However, these genes did not evolve individually: gene expression is controlled by a complex network of interactions, and alterations in one gene may drive reciprocal changes in its proteins' binding partners. Like many complex networks, these gene regulatory networks (GRNs) are composed of communities, or clusters of genes with relatively high connectivity. A deep understanding of the relationship between the evolutionary history of single genes and the topological properties of the underlying GRN is integral to evolutionary genetics. Here, we show that the topological properties of an acute myeloid leukemia GRN and a general human GRN are strongly coupled with its genes' evolutionary properties. Slowly evolving ("cold"), old genes tend to interact with each other, as do rapidly evolving ("hot"), young genes. This naturally causes genes to segregate into community structures with relatively homogeneous evolutionary histories. We argue that gene duplication placed old, cold genes and communities at the center of the networks, and young, hot genes and communities at the periphery. We demonstrate this with single-node centrality measures and two new measures of efficiency, the set efficiency and the interset efficiency. We conclude that these methods for studying the relationships between a GRN's community structures and its genes' evolutionary properties provide new perspectives for understanding evolutionary genetics. PMID:27359334

  15. Functional Gene Networks: R/Bioc package to generate and analyse gene networks derived from functional enrichment and clustering

    PubMed Central

    Aibar, Sara; Fontanillo, Celia; Droste, Conrad; De Las Rivas, Javier

    2015-01-01

    Summary: Functional Gene Networks (FGNet) is an R/Bioconductor package that generates gene networks derived from the results of functional enrichment analysis (FEA) and annotation clustering. The sets of genes enriched with specific biological terms (obtained from a FEA platform) are transformed into a network by establishing links between genes based on common functional annotations and common clusters. The network provides a new view of FEA results revealing gene modules with similar functions and genes that are related to multiple functions. In addition to building the functional network, FGNet analyses the similarity between the groups of genes and provides a distance heatmap and a bipartite network of functionally overlapping genes. The application includes an interface to directly perform FEA queries using different external tools: DAVID, GeneTerm Linker, TopGO or GAGE; and a graphical interface to facilitate the use. Availability and implementation: FGNet is available in Bioconductor, including a tutorial. URL: http://bioconductor.org/packages/release/bioc/html/FGNet.html Contact: jrivas@usal.es Supplementary information: Supplementary data are available at Bioinformatics online. PMID:25600944

  16. NetworkAnalyst for statistical, visual and network-based meta-analysis of gene expression data.

    PubMed

    Xia, Jianguo; Gill, Erin E; Hancock, Robert E W

    2015-06-01

    Meta-analysis of gene expression data sets is increasingly performed to help identify robust molecular signatures and to gain insights into underlying biological processes. The complicated nature of such analyses requires both advanced statistics and innovative visualization strategies to support efficient data comparison, interpretation and hypothesis generation. NetworkAnalyst (http://www.networkanalyst.ca) is a comprehensive web-based tool designed to allow bench researchers to perform various common and complex meta-analyses of gene expression data via an intuitive web interface. By coupling well-established statistical procedures with state-of-the-art data visualization techniques, NetworkAnalyst allows researchers to easily navigate large complex gene expression data sets to determine important features, patterns, functions and connections, thus leading to the generation of new biological hypotheses. This protocol provides a step-wise description of how to effectively use NetworkAnalyst to perform network analysis and visualization from gene lists; to perform meta-analysis on gene expression data while taking into account multiple metadata parameters; and, finally, to perform a meta-analysis of multiple gene expression data sets. NetworkAnalyst is designed to be accessible to biologists rather than to specialist bioinformaticians. The complete protocol can be executed in ∼1.5 h. Compared with other similar web-based tools, NetworkAnalyst offers a unique visual analytics experience that enables data analysis within the context of protein-protein interaction networks, heatmaps or chord diagrams. All of these analysis methods provide the user with supporting statistical and functional evidence. PMID:25950236

  17. GINI: From ISH Images to Gene Interaction Networks

    PubMed Central

    Puniyani, Kriti; Xing, Eric P.

    2013-01-01

    Accurate inference of molecular and functional interactions among genes, especially in multicellular organisms such as Drosophila, often requires statistical analysis of correlations not only between the magnitudes of gene expressions, but also between their temporal-spatial patterns. The ISH (in-situ-hybridization)-based gene expression micro-imaging technology offers an effective approach to perform large-scale spatial-temporal profiling of whole-body mRNA abundance. However, analytical tools for discovering gene interactions from such data remain an open challenge due to various reasons, including difficulties in extracting canonical representations of gene activities from images, and in inference of statistically meaningful networks from such representations. In this paper, we present GINI, a machine learning system for inferring gene interaction networks from Drosophila embryonic ISH images. GINI builds on a computer-vision-inspired vector-space representation of the spatial pattern of gene expression in ISH images, enabled by our recently developed system; and a new multi-instance-kernel algorithm that learns a sparse Markov network model, in which, every gene (i.e., node) in the network is represented by a vector-valued spatial pattern rather than a scalar-valued gene intensity as in conventional approaches such as a Gaussian graphical model. By capturing the notion of spatial similarity of gene expression, and at the same time properly taking into account the presence of multiple images per gene via multi-instance kernels, GINI is well-positioned to infer statistically sound, and biologically meaningful gene interaction networks from image data. Using both synthetic data and a small manually curated data set, we demonstrate the effectiveness of our approach in network building. Furthermore, we report results on a large publicly available collection of Drosophila embryonic ISH images from the Berkeley Drosophila Genome Project, where GINI makes novel and

  18. Time-Delayed Models of Gene Regulatory Networks

    PubMed Central

    Parmar, K.; Blyuss, K. B.; Kyrychko, Y. N.; Hogan, S. J.

    2015-01-01

    We discuss different mathematical models of gene regulatory networks as relevant to the onset and development of cancer. After discussion of alternative modelling approaches, we use a paradigmatic two-gene network to focus on the role played by time delays in the dynamics of gene regulatory networks. We contrast the dynamics of the reduced model arising in the limit of fast mRNA dynamics with that of the full model. The review concludes with the discussion of some open problems. PMID:26576197

  19. Phenotype accessibility and noise in random threshold gene regulatory networks.

    PubMed

    Pinho, Ricardo; Garcia, Victor; Feldman, Marcus W

    2014-01-01

    Evolution requires phenotypic variation in a population of organisms for selection to function. Gene regulatory processes involved in organismal development affect the phenotypic diversity of organisms. Since only a fraction of all possible phenotypes are predicted to be accessed by the end of development, organisms may evolve strategies to use environmental cues and noise-like fluctuations to produce additional phenotypic diversity, and hence to enhance the speed of adaptation. We used a generic model of organismal development --gene regulatory networks-- to investigate how different levels of noise on gene expression states (i.e. phenotypes) may affect access to new, unique phenotypes, thereby affecting phenotypic diversity. We studied additional strategies that organisms might adopt to attain larger phenotypic diversity: either by augmenting their genome or the number of gene expression states. This was done for different types of gene regulatory networks that allow for distinct levels of regulatory influence on gene expression or are more likely to give rise to stable phenotypes. We found that if gene expression is binary, increasing noise levels generally decreases phenotype accessibility for all network types studied. If more gene expression states are considered, noise can moderately enhance the speed of discovery if three or four gene expression states are allowed, and if there are enough distinct regulatory networks in the population. These results were independent of the network types analyzed, and were robust to different implementations of noise. Hence, for noise to increase the number of accessible phenotypes in gene regulatory networks, very specific conditions need to be satisfied. If the number of distinct regulatory networks involved in organismal development is large enough, and the acquisition of more genes or fine tuning of their expression states proves costly to the organism, noise can be useful in allowing access to more unique phenotypes

  20. Phenotype Accessibility and Noise in Random Threshold Gene Regulatory Networks

    PubMed Central

    Feldman, Marcus W.

    2015-01-01

    Evolution requires phenotypic variation in a population of organisms for selection to function. Gene regulatory processes involved in organismal development affect the phenotypic diversity of organisms. Since only a fraction of all possible phenotypes are predicted to be accessed by the end of development, organisms may evolve strategies to use environmental cues and noise-like fluctuations to produce additional phenotypic diversity, and hence to enhance the speed of adaptation. We used a generic model of organismal development --gene regulatory networks-- to investigate how different levels of noise on gene expression states (i.e. phenotypes) may affect access to new, unique phenotypes, thereby affecting phenotypic diversity. We studied additional strategies that organisms might adopt to attain larger phenotypic diversity: either by augmenting their genome or the number of gene expression states. This was done for different types of gene regulatory networks that allow for distinct levels of regulatory influence on gene expression or are more likely to give rise to stable phenotypes. We found that if gene expression is binary, increasing noise levels generally decreases phenotype accessibility for all network types studied. If more gene expression states are considered, noise can moderately enhance the speed of discovery if three or four gene expression states are allowed, and if there are enough distinct regulatory networks in the population. These results were independent of the network types analyzed, and were robust to different implementations of noise. Hence, for noise to increase the number of accessible phenotypes in gene regulatory networks, very specific conditions need to be satisfied. If the number of distinct regulatory networks involved in organismal development is large enough, and the acquisition of more genes or fine tuning of their expression states proves costly to the organism, noise can be useful in allowing access to more unique phenotypes

  1. The propagation of perturbations in rewired bacterial gene networks

    PubMed Central

    Baumstark, Rebecca; Hänzelmann, Sonja; Tsuru, Saburo; Schaerli, Yolanda; Francesconi, Mirko; Mancuso, Francesco M.; Castelo, Robert; Isalan, Mark

    2015-01-01

    What happens to gene expression when you add new links to a gene regulatory network? To answer this question, we profile 85 network rewirings in E. coli. Here we report that concerted patterns of differential expression propagate from reconnected hub genes. The rewirings link promoter regions to different transcription factor and σ-factor genes, resulting in perturbations that span four orders of magnitude, changing up to ∼70% of the transcriptome. Importantly, factor connectivity and promoter activity both associate with perturbation size. Perturbations from related rewirings have more similar transcription profiles and a statistical analysis reveals ∼20 underlying states of the system, associating particular gene groups with rewiring constructs. We examine two large clusters (ribosomal and flagellar genes) in detail. These represent alternative global outcomes from different rewirings because of antagonism between these major cell states. This data set of systematically related perturbations enables reverse engineering and discovery of underlying network interactions. PMID:26670742

  2. Regulatory gene networks and the properties of the developmental process

    NASA Technical Reports Server (NTRS)

    Davidson, Eric H.; McClay, David R.; Hood, Leroy

    2003-01-01

    Genomic instructions for development are encoded in arrays of regulatory DNA. These specify large networks of interactions among genes producing transcription factors and signaling components. The architecture of such networks both explains and predicts developmental phenomenology. Although network analysis is yet in its early stages, some fundamental commonalities are already emerging. Two such are the use of multigenic feedback loops to ensure the progressivity of developmental regulatory states and the prevalence of repressive regulatory interactions in spatial control processes. Gene regulatory networks make it possible to explain the process of development in causal terms and eventually will enable the redesign of developmental regulatory circuitry to achieve different outcomes.

  3. Analyse multiple disease subtypes and build associated gene networks using genome-wide expression profiles

    PubMed Central

    2015-01-01

    Background Despite the large increase of transcriptomic studies that look for gene signatures on diseases, there is still a need for integrative approaches that obtain separation of multiple pathological states providing robust selection of gene markers for each disease subtype and information about the possible links or relations between those genes. Results We present a network-oriented and data-driven bioinformatic approach that searches for association of genes and diseases based on the analysis of genome-wide expression data derived from microarrays or RNA-Seq studies. The approach aims to (i) identify gene sets associated to different pathological states analysed together; (ii) identify a minimum subset within these genes that unequivocally differentiates and classifies the compared disease subtypes; (iii) provide a measurement of the discriminant power of these genes and (iv) identify links between the genes that characterise each of the disease subtypes. This bioinformatic approach is implemented in an R package, named geNetClassifier, available as an open access tool in Bioconductor. To illustrate the performance of the tool, we applied it to two independent datasets: 250 samples from patients with four major leukemia subtypes analysed using expression arrays; another leukemia dataset analysed with RNA-Seq that includes a subtype also present in the previous set. The results show the selection of key deregulated genes recently reported in the literature and assigned to the leukemia subtypes studied. We also show, using these independent datasets, the selection of similar genes in a network built for the same disease subtype. Conclusions The construction of gene networks related to specific disease subtypes that include parameters such as gene-to-gene association, gene disease specificity and gene discriminant power can be very useful to draw gene-disease maps and to unravel the molecular features that characterize specific pathological states. The

  4. Robust model matching design methodology for a stochastic synthetic gene network.

    PubMed

    Chen, Bor-Sen; Chang, Chia-Hung; Wang, Yu-Chao; Wu, Chih-Hung; Lee, Hsiao-Ching

    2011-03-01

    Synthetic biology has shown its potential and promising applications in the last decade. However, many synthetic gene networks cannot work properly and maintain their desired behaviors due to intrinsic parameter variations and extrinsic disturbances. In this study, the intrinsic parameter uncertainties and external disturbances are modeled in a non-linear stochastic gene network to mimic the real environment in the host cell. Then a non-linear stochastic robust matching design methodology is introduced to withstand the intrinsic parameter fluctuations and to attenuate the extrinsic disturbances in order to achieve a desired reference matching purpose. To avoid solving the Hamilton-Jacobi inequality (HJI) in the non-linear stochastic robust matching design, global linearization technique is used to simplify the design procedure by solving a set of linear matrix inequalities (LMIs). As a result, the proposed matching design methodology of the robust synthetic gene network can be efficiently designed with the help of LMI toolbox in Matlab. Finally, two in silico design examples of the robust synthetic gene network are given to illustrate the design procedure and to confirm the robust model matching performance to achieve the desired behavior in spite of stochastic parameter fluctuations and environmental disturbances in the host cell. PMID:21215760

  5. PoplarGene: poplar gene network and resource for mining functional information for genes from woody plants

    PubMed Central

    Liu, Qi; Ding, Changjun; Chu, Yanguang; Chen, Jiafei; Zhang, Weixi; Zhang, Bingyu; Huang, Qinjun; Su, Xiaohua

    2016-01-01

    Poplar is not only an important resource for the production of paper, timber and other wood-based products, but it has also emerged as an ideal model system for studying woody plants. To better understand the biological processes underlying various traits in poplar, e.g., wood development, a comprehensive functional gene interaction network is highly needed. Here, we constructed a genome-wide functional gene network for poplar (covering ~70% of the 41,335 poplar genes) and created the network web service PoplarGene, offering comprehensive functional interactions and extensive poplar gene functional annotations. PoplarGene incorporates two network-based gene prioritization algorithms, neighborhood-based prioritization and context-based prioritization, which can be used to perform gene prioritization in a complementary manner. Furthermore, the co-functional information in PoplarGene can be applied to other woody plant proteomes with high efficiency via orthology transfer. In addition to poplar gene sequences, the webserver also accepts Arabidopsis reference gene as input to guide the search for novel candidate functional genes in PoplarGene. We believe that PoplarGene (http://bioinformatics.caf.ac.cn/PoplarGene and http://124.127.201.25/PoplarGene) will greatly benefit the research community, facilitating studies of poplar and other woody plants. PMID:27515999

  6. PoplarGene: poplar gene network and resource for mining functional information for genes from woody plants.

    PubMed

    Liu, Qi; Ding, Changjun; Chu, Yanguang; Chen, Jiafei; Zhang, Weixi; Zhang, Bingyu; Huang, Qinjun; Su, Xiaohua

    2016-01-01

    Poplar is not only an important resource for the production of paper, timber and other wood-based products, but it has also emerged as an ideal model system for studying woody plants. To better understand the biological processes underlying various traits in poplar, e.g., wood development, a comprehensive functional gene interaction network is highly needed. Here, we constructed a genome-wide functional gene network for poplar (covering ~70% of the 41,335 poplar genes) and created the network web service PoplarGene, offering comprehensive functional interactions and extensive poplar gene functional annotations. PoplarGene incorporates two network-based gene prioritization algorithms, neighborhood-based prioritization and context-based prioritization, which can be used to perform gene prioritization in a complementary manner. Furthermore, the co-functional information in PoplarGene can be applied to other woody plant proteomes with high efficiency via orthology transfer. In addition to poplar gene sequences, the webserver also accepts Arabidopsis reference gene as input to guide the search for novel candidate functional genes in PoplarGene. We believe that PoplarGene (http://bioinformatics.caf.ac.cn/PoplarGene and http://124.127.201.25/PoplarGene) will greatly benefit the research community, facilitating studies of poplar and other woody plants. PMID:27515999

  7. In silico network topology-based prediction of gene essentiality

    NASA Astrophysics Data System (ADS)

    da Silva, João Paulo Müller; Acencio, Marcio Luis; Mombach, José Carlos Merino; Vieira, Renata; da Silva, José Camargo; Lemke, Ney; Sinigaglia, Marialva

    2008-02-01

    The identification of genes essential for survival is important for the understanding of the minimal requirements for cellular life and for drug design. As experimental studies with the purpose of building a catalog of essential genes for a given organism are time-consuming and laborious, a computational approach which could predict gene essentiality with high accuracy would be of great value. We present here a novel computational approach, called NTPGE (Network Topology-based Prediction of Gene Essentiality), that relies on the network topology features of a gene to estimate its essentiality. The first step of NTPGE is to construct the integrated molecular network for a given organism comprising protein physical, metabolic and transcriptional regulation interactions. The second step consists in training a decision-tree-based machine-learning algorithm on known essential and non-essential genes of the organism of interest, considering as learning attributes the network topology information for each of these genes. Finally, the decision-tree classifier generated is applied to the set of genes of this organism to estimate essentiality for each gene. We applied the NTPGE approach for discovering the essential genes in Escherichia coli and then assessed its performance.

  8. Network tuned multiple rank aggregation and applications to gene ranking

    PubMed Central

    2015-01-01

    With the development of various high throughput technologies and analysis methods, researchers can study different aspects of a biological phenomenon simultaneously or one aspect repeatedly with different experimental techniques and analysis methods. The output from each study is a rank list of components of interest. Aggregation of the rank lists of components, such as proteins, genes and single nucleotide variants (SNV), produced by these experiments has been proven to be helpful in both filtering the noise and bringing forth a more complete understanding of the biological problems. Current available rank aggregation methods do not consider the network information that has been observed to provide vital contributions in many data integration studies. We developed network tuned rank aggregation methods incorporating network information and demonstrated its superior performance over aggregation methods without network information. The methods are tested on predicting the Gene Ontology function of yeast proteins. We validate the methods using combinations of three gene expression data sets and three protein interaction networks as well as an integrated network by combining the three networks. Results show that the aggregated rank lists are more meaningful if protein interaction network is incorporated. Among the methods compared, CGI_RRA and CGI_Endeavour, which integrate rank lists with networks using CGI [1] followed by rank aggregation using either robust rank aggregation (RRA) [2] or Endeavour [3] perform the best. Finally, we use the methods to locate target genes of transcription factors. PMID:25708095

  9. Evolutionary and Topological Properties of Genes and Community Structures in Human Gene Regulatory Networks

    PubMed Central

    Szedlak, Anthony; Smith, Nicholas; Liu, Li; Paternostro, Giovanni; Piermarocchi, Carlo

    2016-01-01

    The diverse, specialized genes present in today’s lifeforms evolved from a common core of ancient, elementary genes. However, these genes did not evolve individually: gene expression is controlled by a complex network of interactions, and alterations in one gene may drive reciprocal changes in its proteins’ binding partners. Like many complex networks, these gene regulatory networks (GRNs) are composed of communities, or clusters of genes with relatively high connectivity. A deep understanding of the relationship between the evolutionary history of single genes and the topological properties of the underlying GRN is integral to evolutionary genetics. Here, we show that the topological properties of an acute myeloid leukemia GRN and a general human GRN are strongly coupled with its genes’ evolutionary properties. Slowly evolving (“cold”), old genes tend to interact with each other, as do rapidly evolving (“hot”), young genes. This naturally causes genes to segregate into community structures with relatively homogeneous evolutionary histories. We argue that gene duplication placed old, cold genes and communities at the center of the networks, and young, hot genes and communities at the periphery. We demonstrate this with single-node centrality measures and two new measures of efficiency, the set efficiency and the interset efficiency. We conclude that these methods for studying the relationships between a GRN’s community structures and its genes’ evolutionary properties provide new perspectives for understanding evolutionary genetics. PMID:27359334

  10. Asymmetric Regulation of Peripheral Genes by Two Transcriptional Regulatory Networks

    PubMed Central

    Li, Jing-Ru; Suzuki, Takahiro; Nishimura, Hajime; Kishima, Mami; Maeda, Shiori; Suzuki, Harukazu

    2016-01-01

    Transcriptional regulatory network (TRN) reconstitution and deconstruction occur simultaneously during reprogramming; however, it remains unclear how the starting and targeting TRNs regulate the induction and suppression of peripheral genes. Here we analyzed the regulation using direct cell reprogramming from human dermal fibroblasts to monocytes as the platform. We simultaneously deconstructed fibroblastic TRN and reconstituted monocytic TRN; monocytic and fibroblastic gene expression were analyzed in comparison with that of fibroblastic TRN deconstruction only or monocytic TRN reconstitution only. Global gene expression analysis showed cross-regulation of TRNs. Detailed analysis revealed that knocking down fibroblastic TRN positively affected half of the upregulated monocytic genes, indicating that intrinsic fibroblastic TRN interfered with the expression of induced genes. In contrast, reconstitution of monocytic TRN showed neutral effects on the majority of fibroblastic gene downregulation. This study provides an explicit example that demonstrates how two networks together regulate gene expression during cell reprogramming processes and contributes to the elaborate exploration of TRNs. PMID:27483142

  11. Comparative genomics of mammalian hibernators using gene networks.

    PubMed

    Villanueva-Cañas, José Luis; Faherty, Sheena L; Yoder, Anne D; Albà, M Mar

    2014-09-01

    In recent years, the study of the molecular processes involved in mammalian hibernation has shifted from investigating a few carefully selected candidate genes to large-scale analysis of differential gene expression. The availability of high-throughput data provides an unprecedented opportunity to ask whether phylogenetically distant species show similar mechanisms of genetic control, and how these relate to particular genes and pathways involved in the hibernation phenotype. In order to address these questions, we compare 11 datasets of differentially expressed (DE) genes from two ground squirrel species, one bat species, and the American black bear, as well as a list of genes extracted from the literature that previously have been correlated with the drastic physiological changes associated with hibernation. We identify several genes that are DE in different species, indicating either ancestral adaptations or evolutionary convergence. When we use a network approach to expand the original datasets of DE genes to large gene networks using available interactome data, a higher agreement between datasets is achieved. This indicates that the same key pathways are important for activating and maintaining the hibernation phenotype. Functional-term-enrichment analysis identifies several important metabolic and mitochondrial processes that are critical for hibernation, such as fatty acid beta-oxidation and mitochondrial transport. We do not detect any enrichment of positive selection signatures in the coding sequences of genes from the networks of hibernation-associated genes, supporting the hypothesis that the genetic processes shaping the hibernation phenotype are driven primarily by changes in gene regulation. PMID:24881044

  12. Reconstruction of a Functional Human Gene Network, with an Application for Prioritizing Positional Candidate Genes

    PubMed Central

    Franke, Lude; Bakel, Harm van; Fokkens, Like; de Jong, Edwin D.; Egmont-Petersen, Michael; Wijmenga, Cisca

    2006-01-01

    Most common genetic disorders have a complex inheritance and may result from variants in many genes, each contributing only weak effects to the disease. Pinpointing these disease genes within the myriad of susceptibility loci identified in linkage studies is difficult because these loci may contain hundreds of genes. However, in any disorder, most of the disease genes will be involved in only a few different molecular pathways. If we know something about the relationships between the genes, we can assess whether some genes (which may reside in different loci) functionally interact with each other, indicating a joint basis for the disease etiology. There are various repositories of information on pathway relationships. To consolidate this information, we developed a functional human gene network that integrates information on genes and the functional relationships between genes, based on data from the Kyoto Encyclopedia of Genes and Genomes, the Biomolecular Interaction Network Database, Reactome, the Human Protein Reference Database, the Gene Ontology database, predicted protein-protein interactions, human yeast two-hybrid interactions, and microarray coexpressions. We applied this network to interrelate positional candidate genes from different disease loci and then tested 96 heritable disorders for which the Online Mendelian Inheritance in Man database reported at least three disease genes. Artificial susceptibility loci, each containing 100 genes, were constructed around each disease gene, and we used the network to rank these genes on the basis of their functional interactions. By following up the top five genes per artificial locus, we were able to detect at least one known disease gene in 54% of the loci studied, representing a 2.8-fold increase over random selection. This suggests that our method can significantly reduce the cost and effort of pinpointing true disease genes in analyses of disorders for which numerous loci have been reported but for which

  13. Correlated gene expression supports synchronous activity in brain networks

    PubMed Central

    Richiardi, Jonas; Altmann, Andre; Milazzo, Anna-Clare; Chang, Catie; Chakravarty, M. Mallar; Banaschewski, Tobias; Barker, Gareth J.; Bokde, Arun L.W.; Bromberg, Uli; Büchel, Christian; Conrod, Patricia; Fauth-Bühler, Mira; Flor, Herta; Frouin, Vincent; Gallinat, Jürgen; Garavan, Hugh; Gowland, Penny; Heinz, Andreas; Lemaître, Hervé; Mann, Karl F.; Martinot, Jean-Luc; Nees, Frauke; Paus, Tomáš; Pausova, Zdenka; Rietschel, Marcella; Robbins, Trevor W.; Smolka, Michael N.; Spanagel, Rainer; Ströhle, Andreas; Schumann, Gunter; Hawrylycz, Mike; Poline, Jean-Baptiste; Greicius, Michael D.

    2016-01-01

    During rest, brain activity is synchronized between different regions widely distributed throughout the brain, forming functional networks. However, the molecular mechanisms supporting functional connectivity remain undefined. We show that functional brain networks defined with resting-state functional magnetic resonance imaging can be recapitulated by using measures of correlated gene expression in a post mortem brain tissue data set. The set of 136 genes we identify is significantly enriched for ion channels. Polymorphisms in this set of genes significantly affect resting-state functional connectivity in a large sample of healthy adolescents. Expression levels of these genes are also significantly associated with axonal connectivity in the mouse. The results provide convergent, multimodal evidence that resting-state functional networks correlate with the orchestrated activity of dozens of genes linked to ion channel activity and synaptic function. PMID:26068849

  14. Multiobjective H2/H∞ synthetic gene network design based on promoter libraries.

    PubMed

    Wu, Chih-Hung; Zhang, Weihei; Chen, Bor-Sen

    2011-10-01

    Some current promoter libraries have been developed for synthetic gene networks. But an efficient method to engineer a synthetic gene network with some desired behaviors by selecting adequate promoters from these promoter libraries has not been presented. Thus developing a systematic method to efficiently employ promoter libraries to improve the engineering of synthetic gene networks with desired behaviors is appealing for synthetic biologists. In this study, a synthetic gene network with intrinsic parameter fluctuations and environmental disturbances in vivo is modeled by a nonlinear stochastic system. In order to engineer a synthetic gene network with a desired behavior despite intrinsic parameter fluctuations and environmental disturbances in vivo, a multiobjective H(2)/H(∞) reference tracking (H(2) optimal tracking and H(∞) noise filtering) design is introduced. The H(2) optimal tracking can make the tracking errors between the behaviors of a synthetic gene network and the desired behaviors as small as possible from the minimum mean square error point of view, and the H(∞) noise filtering can attenuate all possible noises, from the worst-case noise effect point of view, to achieve a desired noise filtering ability. If the multiobjective H(2)/H(∞) reference tracking design is satisfied, the synthetic gene network can robustly and optimally track the desired behaviors, simultaneously. First, based on the dynamic gene regulation, the existing promoter libraries are redefined by their promoter activities so that they can be efficiently selected in the design procedure. Then a systematic method is developed to select an adequate promoter set from the redefined promoter libraries to synthesize a gene network satisfying these two design objectives. But the multiobjective H(2)/H(∞) reference tracking design problem needs to solve a difficult Hamilton-Jacobi Inequality (HJI)-constrained optimization problem. Therefore, the fuzzy approximation method is

  15. Altimeter waveform parameters retrieval using Artificial Neural Networks

    NASA Astrophysics Data System (ADS)

    Swain, Debadatta; Sasamal, S. K.

    2012-07-01

    Waveform retracking and analysis methods form an integral part of any altimeter data processing to derive useable information. This is significant owing to the strong heterogeneity in the waveforms resulting of returns of altimeter pulses from uneven geographical features. The waveforms consisting of altimeter return pulses follow the Brown model over the deep oceans. However, the waveforms become rather complex when received over coastal and land regions owing to large scale inhomogeneities. The present work attempts to characterize altimeter return pulses (consisting of slope, amplitude and range) on the basis of the surface responsible for the echo followed by estimation of these waveform parameters based on an Artificial Neural Network Technique (ANN). An ANN is a non-linear parallel-distributed computer model highly effective for classification type of problems. ANNs are widely applied for pattern recognition since their non-linear characteristics makes them very suitable for application to processes with internal inhomogeneities. To demonstrate the technique, we have utilized JASON-2 high resolution waveform data over multiple passes spanning varied geographical topography covering open ocean, coasts, and in-land water bodies. The ANN model is formulated by first training and testing with data sets identified for various topography classifications. Following this, the model estimations are validated with actual altimeter returns forming the waveform, and that have not been used during the ANN model formulation process. The work aims to demonstrate the ANN technique for high resolution altimeter waveform analysis.

  16. Gene-based and semantic structure of the Gene Ontology as a complex network

    NASA Astrophysics Data System (ADS)

    Coronnello, Claudia; Tumminello, Michele; Miccichè, Salvatore

    2016-09-01

    The last decade has seen the advent and consolidation of ontology based tools for the identification and biological interpretation of classes of genes, such as the Gene Ontology. The Gene Ontology (GO) is constantly evolving over time. The information accumulated time-by-time and included in the GO is encoded in the definition of terms and in the setting up of semantic relations amongst terms. Here we investigate the Gene Ontology from a complex network perspective. We consider the semantic network of terms naturally associated with the semantic relationships provided by the Gene Ontology consortium. Moreover, the GO is a natural example of bipartite network of terms and genes. Here we are interested in studying the properties of the projected network of terms, i.e. a gene-based weighted network of GO terms, in which a link between any two terms is set if at least one gene is annotated in both terms. One aim of the present paper is to compare the structural properties of the semantic and the gene-based network. The relative importance of terms is very similar in the two networks, but the community structure changes. We show that in some cases GO terms that appear to be distinct from a semantic point of view are instead connected, and appear in the same community when considering their gene content. The identification of such gene-based communities of terms might therefore be the basis of a simple protocol aiming at improving the semantic structure of GO. Information about terms that share large gene content might also be important from a biomedical point of view, as it might reveal how genes over-expressed in a certain term also affect other biological processes, molecular functions and cellular components not directly linked according to GO semantics.

  17. Network-Based Inference Framework for Identifying Cancer Genes from Gene Expression Data

    PubMed Central

    Yang, Bo; Zhang, Junying; Yin, Yaling; Zhang, Yuanyuan

    2013-01-01

    Great efforts have been devoted to alleviate uncertainty of detected cancer genes as accurate identification of oncogenes is of tremendous significance and helps unravel the biological behavior of tumors. In this paper, we present a differential network-based framework to detect biologically meaningful cancer-related genes. Firstly, a gene regulatory network construction algorithm is proposed, in which a boosting regression based on likelihood score and informative prior is employed for improving accuracy of identification. Secondly, with the algorithm, two gene regulatory networks are constructed from case and control samples independently. Thirdly, by subtracting the two networks, a differential-network model is obtained and then used to rank differentially expressed hub genes for identification of cancer biomarkers. Compared with two existing gene-based methods (t-test and lasso), the method has a significant improvement in accuracy both on synthetic datasets and two real breast cancer datasets. Furthermore, identified six genes (TSPYL5, CD55, CCNE2, DCK, BBC3, and MUC1) susceptible to breast cancer were verified through the literature mining, GO analysis, and pathway functional enrichment analysis. Among these oncogenes, TSPYL5 and CCNE2 have been already known as prognostic biomarkers in breast cancer, CD55 has been suspected of playing an important role in breast cancer prognosis from literature evidence, and other three genes are newly discovered breast cancer biomarkers. More generally, the differential-network schema can be extended to other complex diseases for detection of disease associated-genes. PMID:24073403

  18. Parameter identification and synchronization for uncertain network group with different structures

    NASA Astrophysics Data System (ADS)

    Li, Chengren; Lü, Ling; Sun, Ying; Wang, Ying; Wang, Wenjun; Sun, Ao

    2016-09-01

    We design a novel synchronization technique to research the synchronization of network group constituted of uncertain networks with different structures. Based on Lyapunov theorem, the selection principles of the control inputs and the parameter identification laws of the networks are determined, and synchronization conditions of the network group are obtained. Some numerical simulations are provided to verify the correctness and effectiveness of the synchronization technique. We find that the network number, the number of network nodes and network connections indeed will not affect the stability of synchronization of network group.

  19. Network analysis of microRNAs, transcription factors, target genes and host genes in nasopharyngeal carcinoma

    PubMed Central

    WANG, HAO; XU, ZHIWEN; MA, MENGYAO; WANG, NING; WANG, KUNHAO

    2016-01-01

    Numerous studies on the morbidity of nasopharyngeal carcinoma (NPC) have identified several genes, microRNAs (miRNAs or miRs) and transcription factors (TFs) that influence the pathogenesis of NPC. However, summarizing all the regulatory networks involved in NPC is challenging. In the present study, the genes, miRNAs and TFs involved in NPC were considered as the nodes of the so-called regulatory network, and the associations between them were investigated. To clearly represent these associations, three regulatory networks were built seperately, namely, the differentially expressed network, the associated network and the global network. The differentially expressed network is the most important one of these three networks, since its nodes are differentially expressed genes whose mutations may lead to the development of NPC. Therefore, by modifying the aberrant expression of those genes that are differentially expressed in this network, their dysregulation may be corrected and the tumorigenesis of NPC may thus be prevented. Analysis of the aforementioned three networks highlighted the importance of certain pathways, such as self-adaptation pathways, in the development of NPC. For example, cyclin D1 (CCND1) was observed to regulate Homo sapiens-miR-20a, which in turn targeted CCND1. The present study conducted a systematic analysis of the pathogenesis of NPC through the three aforementioned regulatory networks, and provided a theoretical model for biologists. Future studies are required to evaluate the influence of the highlighted pathways in NPC. PMID:27313701

  20. Topological origin of global attractors in gene regulatory networks

    NASA Astrophysics Data System (ADS)

    Zhang, YunJun; Ouyang, Qi; Geng, Zhi

    2015-02-01

    Fixed-point attractors with global stability manifest themselves in a number of gene regulatory networks. This property indicates the stability of regulatory networks against small state perturbations and is closely related to other complex dynamics. In this paper, we aim to reveal the core modules in regulatory networks that determine their global attractors and the relationship between these core modules and other motifs. This work has been done via three steps. Firstly, inspired by the signal transmission in the regulation process, we extract the model of chain-like network from regulation networks. We propose a module of "ideal transmission chain (ITC)", which is proved sufficient and necessary (under certain condition) to form a global fixed-point in the context of chain-like network. Secondly, by examining two well-studied regulatory networks (i.e., the cell-cycle regulatory networks of Budding yeast and Fission yeast), we identify the ideal modules in true regulation networks and demonstrate that the modules have a superior contribution to network stability (quantified by the relative size of the biggest attraction basin). Thirdly, in these two regulation networks, we find that the double negative feedback loops, which are the key motifs of forming bistability in regulation, are connected to these core modules with high network stability. These results have shed new light on the connection between the topological feature and the dynamic property of regulatory networks.

  1. Investigating the Effects of Imputation Methods for Modelling Gene Networks Using a Dynamic Bayesian Network from Gene Expression Data

    PubMed Central

    CHAI, Lian En; LAW, Chow Kuan; MOHAMAD, Mohd Saberi; CHONG, Chuii Khim; CHOON, Yee Wen; DERIS, Safaai; ILLIAS, Rosli Md

    2014-01-01

    Background: Gene expression data often contain missing expression values. Therefore, several imputation methods have been applied to solve the missing values, which include k-nearest neighbour (kNN), local least squares (LLS), and Bayesian principal component analysis (BPCA). However, the effects of these imputation methods on the modelling of gene regulatory networks from gene expression data have rarely been investigated and analysed using a dynamic Bayesian network (DBN). Methods: In the present study, we separately imputed datasets of the Escherichia coli S.O.S. DNA repair pathway and the Saccharomyces cerevisiae cell cycle pathway with kNN, LLS, and BPCA, and subsequently used these to generate gene regulatory networks (GRNs) using a discrete DBN. We made comparisons on the basis of previous studies in order to select the gene network with the least error. Results: We found that BPCA and LLS performed better on larger networks (based on the S. cerevisiae dataset), whereas kNN performed better on smaller networks (based on the E. coli dataset). Conclusion: The results suggest that the performance of each imputation method is dependent on the size of the dataset, and this subsequently affects the modelling of the resultant GRNs using a DBN. In addition, on the basis of these results, a DBN has the capacity to discover potential edges, as well as display interactions, between genes. PMID:24876803

  2. [Study on the automatic parameters identification of water pipe network model].

    PubMed

    Jia, Hai-Feng; Zhao, Qi-Feng

    2010-01-01

    Based on the problems analysis on development and application of water pipe network model, the model parameters automatic identification is regarded as a kernel bottleneck of model's application in water supply enterprise. The methodology of water pipe network model parameters automatic identification based on GIS and SCADA database is proposed. Then the kernel algorithm of model parameters automatic identification is studied, RSA (Regionalized Sensitivity Analysis) is used for automatic recognition of sensitive parameters, and MCS (Monte-Carlo Sampling) is used for automatic identification of parameters, the detail technical route based on RSA and MCS is presented. The module of water pipe network model parameters automatic identification is developed. At last, selected a typical water pipe network as a case, the case study on water pipe network model parameters automatic identification is conducted and the satisfied results are achieved. PMID:20329520

  3. A complex network analysis of hypertension-related genes

    NASA Astrophysics Data System (ADS)

    Wang, Huan; Xu, Chuan-Yun; Hu, Jing-Bo; Cao, Ke-Fei

    2014-01-01

    In this paper, a network of hypertension-related genes is constructed by analyzing the correlations of gene expression data among the Dahl salt-sensitive rat and two consomic rat strains. The numerical calculations show that this sparse and assortative network has small-world and scale-free properties. Further, 16 key hub genes (Col4a1, Lcn2, Cdk4, etc.) are determined by introducing an integrated centrality and have been confirmed by biological/medical research to play important roles in hypertension.

  4. Gene network and pathway generation and analysis: Editorial

    SciTech Connect

    Zhao, Zhongming; Sanfilippo, Antonio P.; Huang, Kun

    2011-02-18

    The past decade has witnessed an exponential growth of biological data including genomic sequences, gene annotations, expression and regulation, and protein-protein interactions. A key aim in the post-genome era is to systematically catalogue gene networks and pathways in a dynamic living cell and apply them to study diseases and phenotypes. To promote the research in systems biology and its application to disease studies, we organized a workshop focusing on the reconstruction and analysis of gene networks and pathways in any organisms from high-throughput data collected through techniques such as microarray analysis and RNA-Seq.

  5. Gene regulatory networks modelling using a dynamic evolutionary hybrid

    PubMed Central

    2010-01-01

    Background Inference of gene regulatory networks is a key goal in the quest for understanding fundamental cellular processes and revealing underlying relations among genes. With the availability of gene expression data, computational methods aiming at regulatory networks reconstruction are facing challenges posed by the data's high dimensionality, temporal dynamics or measurement noise. We propose an approach based on a novel multi-layer evolutionary trained neuro-fuzzy recurrent network (ENFRN) that is able to select potential regulators of target genes and describe their regulation type. Results The recurrent, self-organizing structure and evolutionary training of our network yield an optimized pool of regulatory relations, while its fuzzy nature avoids noise-related problems. Furthermore, we are able to assign scores for each regulation, highlighting the confidence in the retrieved relations. The approach was tested by applying it to several benchmark datasets of yeast, managing to acquire biologically validated relations among genes. Conclusions The results demonstrate the effectiveness of the ENFRN in retrieving biologically valid regulatory relations and providing meaningful insights for better understanding the dynamics of gene regulatory networks. The algorithms and methods described in this paper have been implemented in a Matlab toolbox and are available from: http://bioserver-1.bioacademy.gr/DataRepository/Project_ENFRN_GRN/. PMID:20298548

  6. Development of a synthetic gene network to modulate gene expression by mechanical forces

    PubMed Central

    Kis, Zoltán; Rodin, Tania; Zafar, Asma; Lai, Zhangxing; Freke, Grace; Fleck, Oliver; Del Rio Hernandez, Armando; Towhidi, Leila; Pedrigi, Ryan M.; Homma, Takayuki; Krams, Rob

    2016-01-01

    The majority of (mammalian) cells in our body are sensitive to mechanical forces, but little work has been done to develop assays to monitor mechanosensor activity. Furthermore, it is currently impossible to use mechanosensor activity to drive gene expression. To address these needs, we developed the first mammalian mechanosensitive synthetic gene network to monitor endothelial cell shear stress levels and directly modulate expression of an atheroprotective transcription factor by shear stress. The technique is highly modular, easily scalable and allows graded control of gene expression by mechanical stimuli in hard-to-transfect mammalian cells. We call this new approach mechanosyngenetics. To insert the gene network into a high proportion of cells, a hybrid transfection procedure was developed that involves electroporation, plasmids replication in mammalian cells, mammalian antibiotic selection, a second electroporation and gene network activation. This procedure takes 1 week and yielded over 60% of cells with a functional gene network. To test gene network functionality, we developed a flow setup that exposes cells to linearly increasing shear stress along the length of the flow channel floor. Activation of the gene network varied logarithmically as a function of shear stress magnitude. PMID:27404994

  7. Development of a synthetic gene network to modulate gene expression by mechanical forces.

    PubMed

    Kis, Zoltán; Rodin, Tania; Zafar, Asma; Lai, Zhangxing; Freke, Grace; Fleck, Oliver; Del Rio Hernandez, Armando; Towhidi, Leila; Pedrigi, Ryan M; Homma, Takayuki; Krams, Rob

    2016-01-01

    The majority of (mammalian) cells in our body are sensitive to mechanical forces, but little work has been done to develop assays to monitor mechanosensor activity. Furthermore, it is currently impossible to use mechanosensor activity to drive gene expression. To address these needs, we developed the first mammalian mechanosensitive synthetic gene network to monitor endothelial cell shear stress levels and directly modulate expression of an atheroprotective transcription factor by shear stress. The technique is highly modular, easily scalable and allows graded control of gene expression by mechanical stimuli in hard-to-transfect mammalian cells. We call this new approach mechanosyngenetics. To insert the gene network into a high proportion of cells, a hybrid transfection procedure was developed that involves electroporation, plasmids replication in mammalian cells, mammalian antibiotic selection, a second electroporation and gene network activation. This procedure takes 1 week and yielded over 60% of cells with a functional gene network. To test gene network functionality, we developed a flow setup that exposes cells to linearly increasing shear stress along the length of the flow channel floor. Activation of the gene network varied logarithmically as a function of shear stress magnitude. PMID:27404994

  8. Efficient experimental design for uncertainty reduction in gene regulatory networks

    PubMed Central

    2015-01-01

    Background An accurate understanding of interactions among genes plays a major role in developing therapeutic intervention methods. Gene regulatory networks often contain a significant amount of uncertainty. The process of prioritizing biological experiments to reduce the uncertainty of gene regulatory networks is called experimental design. Under such a strategy, the experiments with high priority are suggested to be conducted first. Results The authors have already proposed an optimal experimental design method based upon the objective for modeling gene regulatory networks, such as deriving therapeutic interventions. The experimental design method utilizes the concept of mean objective cost of uncertainty (MOCU). MOCU quantifies the expected increase of cost resulting from uncertainty. The optimal experiment to be conducted first is the one which leads to the minimum expected remaining MOCU subsequent to the experiment. In the process, one must find the optimal intervention for every gene regulatory network compatible with the prior knowledge, which can be prohibitively expensive when the size of the network is large. In this paper, we propose a computationally efficient experimental design method. This method incorporates a network reduction scheme by introducing a novel cost function that takes into account the disruption in the ranking of potential experiments. We then estimate the approximate expected remaining MOCU at a lower computational cost using the reduced networks. Conclusions Simulation results based on synthetic and real gene regulatory networks show that the proposed approximate method has close performance to that of the optimal method but at lower computational cost. The proposed approximate method also outperforms the random selection policy significantly. A MATLAB software implementing the proposed experimental design method is available at http://gsp.tamu.edu/Publications/supplementary/roozbeh15a/. PMID:26423515

  9. Modeling DNA sequence-based cis-regulatory gene networks.

    PubMed

    Bolouri, Hamid; Davidson, Eric H

    2002-06-01

    Gene network analysis requires computationally based models which represent the functional architecture of regulatory interactions, and which provide directly testable predictions. The type of model that is useful is constrained by the particular features of developmentally active cis-regulatory systems. These systems function by processing diverse regulatory inputs, generating novel regulatory outputs. A computational model which explicitly accommodates this basic concept was developed earlier for the cis-regulatory system of the endo16 gene of the sea urchin. This model represents the genetically mandated logic functions that the system executes, but also shows how time-varying kinetic inputs are processed in different circumstances into particular kinetic outputs. The same basic design features can be utilized to construct models that connect the large number of cis-regulatory elements constituting developmental gene networks. The ultimate aim of the network models discussed here is to represent the regulatory relationships among the genomic control systems of the genes in the network, and to state their functional meaning. The target site sequences of the cis-regulatory elements of these genes constitute the physical basis of the network architecture. Useful models for developmental regulatory networks must represent the genetic logic by which the system operates, but must also be capable of explaining the real time dynamics of cis-regulatory response as kinetic input and output data become available. Most importantly, however, such models must display in a direct and transparent manner fundamental network design features such as intra- and intercellular feedback circuitry; the sources of parallel inputs into each cis-regulatory element; gene battery organization; and use of repressive spatial inputs in specification and boundary formation. Successful network models lead to direct tests of key architectural features by targeted cis-regulatory analysis. PMID

  10. Gene switching rate determines response to extrinsic perturbations in the self-activation transcriptional network motif

    PubMed Central

    de Franciscis, Sebastiano; Caravagna, Giulio; Mauri, Giancarlo; d’Onofrio, Alberto

    2016-01-01

    Gene switching dynamics is a major source of randomness in genetic networks, also in the case of large concentrations of the transcription factors. In this work, we consider a common network motif - the positive feedback of a transcription factor on its own synthesis - and assess its response to extrinsic noises perturbing gene deactivation in a variety of settings where the network might operate. These settings are representative of distinct cellular types, abundance of transcription factors and ratio between gene switching and protein synthesis rates. By investigating noise-induced transitions among the different network operative states, our results suggest that gene switching rates are key parameters to shape network response to external perturbations, and that such response depends on the particular biological setting, i.e. the characteristic time scales and protein abundance. These results might have implications on our understanding of irreversible transitions for noise-related phenomena such as cellular differentiation. In addition these evidences suggest to adopt the appropriate mathematical model of the network in order to analyze the system consistently to the reference biological setting. PMID:27256916

  11. Gene switching rate determines response to extrinsic perturbations in the self-activation transcriptional network motif.

    PubMed

    de Franciscis, Sebastiano; Caravagna, Giulio; Mauri, Giancarlo; d'Onofrio, Alberto

    2016-01-01

    Gene switching dynamics is a major source of randomness in genetic networks, also in the case of large concentrations of the transcription factors. In this work, we consider a common network motif - the positive feedback of a transcription factor on its own synthesis - and assess its response to extrinsic noises perturbing gene deactivation in a variety of settings where the network might operate. These settings are representative of distinct cellular types, abundance of transcription factors and ratio between gene switching and protein synthesis rates. By investigating noise-induced transitions among the different network operative states, our results suggest that gene switching rates are key parameters to shape network response to external perturbations, and that such response depends on the particular biological setting, i.e. the characteristic time scales and protein abundance. These results might have implications on our understanding of irreversible transitions for noise-related phenomena such as cellular differentiation. In addition these evidences suggest to adopt the appropriate mathematical model of the network in order to analyze the system consistently to the reference biological setting. PMID:27256916

  12. Physical parameters collection based on wireless senor network

    NASA Astrophysics Data System (ADS)

    Chen, Xin; Wu, Hong; Ji, Lei

    2013-12-01

    With the development of sensor technology, wireless senor network has been applied in the medical, military, entertainment field and our daily life. But the existing available wireless senor networks applied in human monitoring system still have some problems, such as big power consumption, low security and so on. To improve senor network applied in health monitoring system, the paper introduces a star wireless senor networks based on msp430 and DSP. We design a low-cost heart-rate monitor senor node. The communication between senor node and sink node is realized according to the newest protocol proposed by the IEEE 802.15.6 Task Group. This wireless senor network will be more energy-efficient and faster compared to traditional senor networks.

  13. microRNA and gene networks in human pancreatic cancer.

    PubMed

    Zhu, Minghui; Xu, Zhiwen; Wang, Kunhao; Wang, Ning; Li, Yang

    2013-10-01

    To date, scientists have obtained a substantial amount of knowledge with regard to genes and microRNAs (miRNAs) in pancreatic cancer (PC). However, deciphering the regulatory mechanism of these genes and miRNAs remains difficult. In the present study, three regulatory networks consisting of a differentially-expressed network, a related network and a global network, were constructed in order to identify the mechanisms and certain key miRNA and gene pathways in PC. The interactions between transcription factors (TFs) and miRNAs, miRNAs and target genes and an miRNA and its host gene were investigated. The present study compared and analyzed the similarities and differences between the three networks in order to distinguish the key pathways. Certain pathways involving the differentially-expressed genes and miRNAs demonstrated specific features. TP53 and hsa-miR-125b were observed to form a self-adaptation association. A further 16 significant differentially-expressed miRNAs were obtained and it was observed that an miRNA and its host gene exhibit specific features in PC, for example, hsa-miR-196a-1 and its host gene, HOXB7, form a self-adaptation association. The differentially-expressed network partially illuminated the mechanism of PC. The present study provides comprehensive data that is associated with PC and may aid future studies in obtaining pertinent data results with regards to PC. In the future, an improved understanding of PC may be obtained through an increased knowledge of the occurrence, mechanism, improvement, metastasis and treatment of the disease. PMID:24137477

  14. Regulatory network of microRNAs, target genes, transcription factors and host genes in endometrial cancer.

    PubMed

    Xue, Lu-Chen; Xu, Zhi-Wen; Wang, Kun-Hao; Wang, Ning; Zhang, Xiao-Xu; Wang, Shang

    2015-01-01

    Genes and microRNAs (miRNAs) have important roles in human oncology. However, most of the biological factors are reported in disperse form which makes it hard to discover the pathology. In this study, genes and miRNAs involved in human endometrial cancer(EC) were collected and formed into regulatory networks following their interactive relations, including miRNAs targeting genes, transcription factors (TFs) regulating miRNAs and miRNAs included in their host genes. Networks are constructed hierarchically at three levels: differentially expressed, related and global. Among the three, the differentially expressed network is the most important and fundamental network that contains the key genes and miRNAs in EC. The target genes, TFs and miRNAs are differentially expressed in EC so that any mutation in them may impact on EC development. Some key pathways in networks were highlighted to analyze how they interactively influence other factors and carcinogenesis. Upstream and downstream pathways of the differentially expressed genes and miRNAs were compared and analyzed. The purpose of this study was to partially reveal the deep regulatory mechanisms in EC using a new method that combines comprehensive genes and miRNAs together with their relationships. It may contribute to cancer prevention and gene therapy of EC. PMID:25684474

  15. How Gene Networks Can Uncover Novel CVD Players

    PubMed Central

    Parnell, Laurence D; Casas-Agustench, Patricia; Iyer, Lakshmanan K; Ordovas, Jose M

    2014-01-01

    Cardiovascular diseases (CVD) are complex, involving numerous biological entities from genes and small molecules to organ function. Placing these entities in networks where the functional relationships among the constituents are drawn can aid in our understanding of disease onset, progression and prevention. While networks, or interactomes, are often classified by a general term, say lipids or inflammation, it is a more encompassing class of network that is more informative in showing connections among the active entities and allowing better hypotheses of novel CVD players to be formulated. A range of networks will be presented whereby the potential to bring new objects into the CVD milieu will be exemplified. PMID:24683432

  16. How Gene Networks Can Uncover Novel CVD Players.

    PubMed

    Parnell, Laurence D; Casas-Agustench, Patricia; Iyer, Lakshmanan K; Ordovas, Jose M

    2014-01-01

    Cardiovascular diseases (CVD) are complex, involving numerous biological entities from genes and small molecules to organ function. Placing these entities in networks where the functional relationships among the constituents are drawn can aid in our understanding of disease onset, progression and prevention. While networks, or interactomes, are often classified by a general term, say lipids or inflammation, it is a more encompassing class of network that is more informative in showing connections among the active entities and allowing better hypotheses of novel CVD players to be formulated. A range of networks will be presented whereby the potential to bring new objects into the CVD milieu will be exemplified. PMID:24683432

  17. A Synthesis Method of Gene Networks Having Cyclic Expression Pattern Sequences by Network Learning

    NASA Astrophysics Data System (ADS)

    Mori, Yoshihiro; Kuroe, Yasuaki

    Recently, synthesis of gene networks having desired functions has become of interest to many researchers because it is a complementary approach to understanding gene networks, and it could be the first step in controlling living cells. There exist several periodic phenomena in cells, e.g. circadian rhythm. These phenomena are considered to be generated by gene networks. We have already proposed synthesis method of gene networks based on gene expression. The method is applicable to synthesizing gene networks possessing the desired cyclic expression pattern sequences. It ensures that realized expression pattern sequences are periodic, however, it does not ensure that their corresponding solution trajectories are periodic, which might bring that their oscillations are not persistent. In this paper, in order to resolve the problem we propose a synthesis method of gene networks possessing the desired cyclic expression pattern sequences together with their corresponding solution trajectories being periodic. In the proposed method the persistent oscillations of the solution trajectories are realized by specifying passing points of them.

  18. Modularity and evolutionary constraints in a baculovirus gene regulatory network

    PubMed Central

    2013-01-01

    Background The structure of regulatory networks remains an open question in our understanding of complex biological systems. Interactions during complete viral life cycles present unique opportunities to understand how host-parasite network take shape and behave. The Anticarsia gemmatalis multiple nucleopolyhedrovirus (AgMNPV) is a large double-stranded DNA virus, whose genome may encode for 152 open reading frames (ORFs). Here we present the analysis of the ordered cascade of the AgMNPV gene expression. Results We observed an earlier onset of the expression than previously reported for other baculoviruses, especially for genes involved in DNA replication. Most ORFs were expressed at higher levels in a more permissive host cell line. Genes with more than one copy in the genome had distinct expression profiles, which could indicate the acquisition of new functionalities. The transcription gene regulatory network (GRN) for 149 ORFs had a modular topology comprising five communities of highly interconnected nodes that separated key genes that are functionally related on different communities, possibly maximizing redundancy and GRN robustness by compartmentalization of important functions. Core conserved functions showed expression synchronicity, distinct GRN features and significantly less genetic diversity, consistent with evolutionary constraints imposed in key elements of biological systems. This reduced genetic diversity also had a positive correlation with the importance of the gene in our estimated GRN, supporting a relationship between phylogenetic data of baculovirus genes and network features inferred from expression data. We also observed that gene arrangement in overlapping transcripts was conserved among related baculoviruses, suggesting a principle of genome organization. Conclusions Albeit with a reduced number of nodes (149), the AgMNPV GRN had a topology and key characteristics similar to those observed in complex cellular organisms, which indicates

  19. Gene-network inference by message passing

    NASA Astrophysics Data System (ADS)

    Braunstein, A.; Pagnani, A.; Weigt, M.; Zecchina, R.

    2008-01-01

    The inference of gene-regulatory processes from gene-expression data belongs to the major challenges of computational systems biology. Here we address the problem from a statistical-physics perspective and develop a message-passing algorithm which is able to infer sparse, directed and combinatorial regulatory mechanisms. Using the replica technique, the algorithmic performance can be characterized analytically for artificially generated data. The algorithm is applied to genome-wide expression data of baker's yeast under various environmental conditions. We find clear cases of combinatorial control, and enrichment in common functional annotations of regulated genes and their regulators.

  20. Inferring the Gene Network Underlying the Branching of Tomato Inflorescence

    PubMed Central

    Astola, Laura; Stigter, Hans; van Dijk, Aalt D. J.; van Daelen, Raymond; Molenaar, Jaap

    2014-01-01

    The architecture of tomato inflorescence strongly affects flower production and subsequent crop yield. To understand the genetic activities involved, insight into the underlying network of genes that initiate and control the sympodial growth in the tomato is essential. In this paper, we show how the structure of this network can be derived from available data of the expressions of the involved genes. Our approach starts from employing biological expert knowledge to select the most probable gene candidates behind branching behavior. To find how these genes interact, we develop a stepwise procedure for computational inference of the network structure. Our data consists of expression levels from primary shoot meristems, measured at different developmental stages on three different genotypes of tomato. With the network inferred by our algorithm, we can explain the dynamics corresponding to all three genotypes simultaneously, despite their apparent dissimilarities. We also correctly predict the chronological order of expression peaks for the main hubs in the network. Based on the inferred network, using optimal experimental design criteria, we are able to suggest an informative set of experiments for further investigation of the mechanisms underlying branching behavior. PMID:24699171

  1. Synthetic Gene Networks: De novo constructs -- in numero descriptions

    NASA Astrophysics Data System (ADS)

    Hasty, Jeff

    2007-03-01

    Uncovering the structure and function of gene regulatory networks has become one of the central challenges of the post-genomic era. Theoretical models of protein-DNA feedback loops and gene regulatory networks have long been proposed, and recently, certain qualitative features of such models have been experimentally corroborated. This talk will focus on model and experimental results that demonstrate how a naturally occurring gene network can be used as a ``parts list'' for synthetic network design. The model formulation leads to computational and analytical approaches relevant to nonlinear dynamics and statistical physics, and the utility of such a formulation will be demonstrated through the consideration of specific design criteria for several novel genetic devices. Fluctuations originating from small molecule-number effects will be discussed in the context of model predictions, and the experimental validation of these stochastic effects underscores the importance of internal noise in gene expression. The underlying methodology highlights the utility of engineering-based methods in the design of synthetic gene regulatory networks.

  2. Multiscale Embedded Gene Co-expression Network Analysis

    PubMed Central

    Song, Won-Min; Zhang, Bin

    2015-01-01

    Gene co-expression network analysis has been shown effective in identifying functional co-expressed gene modules associated with complex human diseases. However, existing techniques to construct co-expression networks require some critical prior information such as predefined number of clusters, numerical thresholds for defining co-expression/interaction, or do not naturally reproduce the hallmarks of complex systems such as the scale-free degree distribution of small-worldness. Previously, a graph filtering technique called Planar Maximally Filtered Graph (PMFG) has been applied to many real-world data sets such as financial stock prices and gene expression to extract meaningful and relevant interactions. However, PMFG is not suitable for large-scale genomic data due to several drawbacks, such as the high computation complexity O(|V|3), the presence of false-positives due to the maximal planarity constraint, and the inadequacy of the clustering framework. Here, we developed a new co-expression network analysis framework called Multiscale Embedded Gene Co-expression Network Analysis (MEGENA) by: i) introducing quality control of co-expression similarities, ii) parallelizing embedded network construction, and iii) developing a novel clustering technique to identify multi-scale clustering structures in Planar Filtered Networks (PFNs). We applied MEGENA to a series of simulated data and the gene expression data in breast carcinoma and lung adenocarcinoma from The Cancer Genome Atlas (TCGA). MEGENA showed improved performance over well-established clustering methods and co-expression network construction approaches. MEGENA revealed not only meaningful multi-scale organizations of co-expressed gene clusters but also novel targets in breast carcinoma and lung adenocarcinoma. PMID:26618778

  3. BRAIN NETWORKS. Correlated gene expression supports synchronous activity in brain networks.

    PubMed

    Richiardi, Jonas; Altmann, Andre; Milazzo, Anna-Clare; Chang, Catie; Chakravarty, M Mallar; Banaschewski, Tobias; Barker, Gareth J; Bokde, Arun L W; Bromberg, Uli; Büchel, Christian; Conrod, Patricia; Fauth-Bühler, Mira; Flor, Herta; Frouin, Vincent; Gallinat, Jürgen; Garavan, Hugh; Gowland, Penny; Heinz, Andreas; Lemaître, Hervé; Mann, Karl F; Martinot, Jean-Luc; Nees, Frauke; Paus, Tomáš; Pausova, Zdenka; Rietschel, Marcella; Robbins, Trevor W; Smolka, Michael N; Spanagel, Rainer; Ströhle, Andreas; Schumann, Gunter; Hawrylycz, Mike; Poline, Jean-Baptiste; Greicius, Michael D

    2015-06-12

    During rest, brain activity is synchronized between different regions widely distributed throughout the brain, forming functional networks. However, the molecular mechanisms supporting functional connectivity remain undefined. We show that functional brain networks defined with resting-state functional magnetic resonance imaging can be recapitulated by using measures of correlated gene expression in a post mortem brain tissue data set. The set of 136 genes we identify is significantly enriched for ion channels. Polymorphisms in this set of genes significantly affect resting-state functional connectivity in a large sample of healthy adolescents. Expression levels of these genes are also significantly associated with axonal connectivity in the mouse. The results provide convergent, multimodal evidence that resting-state functional networks correlate with the orchestrated activity of dozens of genes linked to ion channel activity and synaptic function. PMID:26068849

  4. Finding pathway-modulating genes from a novel Ontology Fingerprint-derived gene network

    PubMed Central

    Qin, Tingting; Matmati, Nabil; Tsoi, Lam C.; Mohanty, Bidyut K.; Gao, Nan; Tang, Jijun; Lawson, Andrew B.; Hannun, Yusuf A.; Zheng, W. Jim

    2014-01-01

    To enhance our knowledge regarding biological pathway regulation, we took an integrated approach, using the biomedical literature, ontologies, network analyses and experimental investigation to infer novel genes that could modulate biological pathways. We first constructed a novel gene network via a pairwise comparison of all yeast genes’ Ontology Fingerprints—a set of Gene Ontology terms overrepresented in the PubMed abstracts linked to a gene along with those terms’ corresponding enrichment P-values. The network was further refined using a Bayesian hierarchical model to identify novel genes that could potentially influence the pathway activities. We applied this method to the sphingolipid pathway in yeast and found that many top-ranked genes indeed displayed altered sphingolipid pathway functions, initially measured by their sensitivity to myriocin, an inhibitor of de novo sphingolipid biosynthesis. Further experiments confirmed the modulation of the sphingolipid pathway by one of these genes, PFA4, encoding a palmitoyl transferase. Comparative analysis showed that few of these novel genes could be discovered by other existing methods. Our novel gene network provides a unique and comprehensive resource to study pathway modulations and systems biology in general. PMID:25063300

  5. Visualizing Gene - Interactions within the Rice and Maize Network

    NASA Astrophysics Data System (ADS)

    Sampong, A.; Feltus, A.; Smith, M.

    2014-12-01

    The purpose of this research was to design a simpler visualization tool for comparing or viewing gene interaction graphs in systems biology. This visualization tool makes it possible and easier for a researcher to visualize the biological metadata of a plant and interact with the graph on a webpage. Currently available visualization software like Cytoscape and Walrus are difficult to interact with and do not scale effectively for large data sets, limiting the ability to visualize interactions within a biological system. The visualization tool developed is useful for viewing and interpreting the dataset of a gene interaction network. The graph layout drawn by this visualization tool is an improvement from the previous method of comparing lines of genes in two separate data files to, now having the ability to visually see the layout of the gene networks and how the two systems are related. The graph layout presented by the visualization tool draws a graph of the sample rice and maize gene networks, linking the common genes found in both plants and highlighting the functions served by common genes from each plant. The success of this visualization tool will enable Dr. Feltus to continue his investigations and draw conclusions on the biological evolution of the sorghum plant as well. REU Funded by NSF ACI Award 1359223 Vetria L. Byrd, PI

  6. NETGEM: Network Embedded Temporal GEnerative Model for gene expression data

    PubMed Central

    2011-01-01

    Background Temporal analysis of gene expression data has been limited to identifying genes whose expression varies with time and/or correlation between genes that have similar temporal profiles. Often, the methods do not consider the underlying network constraints that connect the genes. It is becoming increasingly evident that interactions change substantially with time. Thus far, there is no systematic method to relate the temporal changes in gene expression to the dynamics of interactions between them. Information on interaction dynamics would open up possibilities for discovering new mechanisms of regulation by providing valuable insight into identifying time-sensitive interactions as well as permit studies on the effect of a genetic perturbation. Results We present NETGEM, a tractable model rooted in Markov dynamics, for analyzing the dynamics of the interactions between proteins based on the dynamics of the expression changes of the genes that encode them. The model treats the interaction strengths as random variables which are modulated by suitable priors. This approach is necessitated by the extremely small sample size of the datasets, relative to the number of interactions. The model is amenable to a linear time algorithm for efficient inference. Using temporal gene expression data, NETGEM was successful in identifying (i) temporal interactions and determining their strength, (ii) functional categories of the actively interacting partners and (iii) dynamics of interactions in perturbed networks. Conclusions NETGEM represents an optimal trade-off between model complexity and data requirement. It was able to deduce actively interacting genes and functional categories from temporal gene expression data. It permits inference by incorporating the information available in perturbed networks. Given that the inputs to NETGEM are only the network and the temporal variation of the nodes, this algorithm promises to have widespread applications, beyond biological

  7. Genetics of gene expression responses to temperature stress in a sea urchin gene network.

    PubMed

    Runcie, Daniel E; Garfield, David A; Babbitt, Courtney C; Wygoda, Jennifer A; Mukherjee, Sayan; Wray, Gregory A

    2012-09-01

    Stress responses play an important role in shaping species distributions and robustness to climate change. We investigated how stress responses alter the contribution of additive genetic variation to gene expression during development of the purple sea urchin, Strongylocentrotus purpuratus, under increased temperatures that model realistic climate change scenarios. We first measured gene expression responses in the embryos by RNA-seq to characterize molecular signatures of mild, chronic temperature stress in an unbiased manner. We found that an increase from 12 to 18 °C caused widespread alterations in gene expression including in genes involved in protein folding, RNA processing and development. To understand the quantitative genetic architecture of this response, we then focused on a well-characterized gene network involved in endomesoderm and ectoderm specification. Using a breeding design with wild-caught individuals, we measured genetic and gene-environment interaction effects on 72 genes within this network. We found genetic or maternal effects in 33 of these genes and that the genetic effects were correlated in the network. Fourteen network genes also responded to higher temperatures, but we found no significant genotype-environment interactions in any of the genes. This absence may be owing to an effective buffering of the temperature perturbations within the network. In support of this hypothesis, perturbations to regulatory genes did not affect the expression of the genes that they regulate. Together, these results provide novel insights into the relationship between environmental change and developmental evolution and suggest that climate change may not expose large amounts of cryptic genetic variation to selection in this species. PMID:22856327

  8. Wisdom of crowds for robust gene network inference

    PubMed Central

    Marbach, Daniel; Costello, James C.; Küffner, Robert; Vega, Nicci; Prill, Robert J.; Camacho, Diogo M.; Allison, Kyle R.; Kellis, Manolis; Collins, James J.; Stolovitzky, Gustavo

    2012-01-01

    Reconstructing gene regulatory networks from high-throughput data is a long-standing problem. Through the DREAM project (Dialogue on Reverse Engineering Assessment and Methods), we performed a comprehensive blind assessment of over thirty network inference methods on Escherichia coli, Staphylococcus aureus, Saccharomyces cerevisiae, and in silico microarray data. We characterize performance, data requirements, and inherent biases of different inference approaches offering guidelines for both algorithm application and development. We observe that no single inference method performs optimally across all datasets. In contrast, integration of predictions from multiple inference methods shows robust and high performance across diverse datasets. Thereby, we construct high-confidence networks for E. coli and S. aureus, each comprising ~1700 transcriptional interactions at an estimated precision of 50%. We experimentally test 53 novel interactions in E. coli, of which 23 were supported (43%). Our results establish community-based methods as a powerful and robust tool for the inference of transcriptional gene regulatory networks. PMID:22796662

  9. Functional Analysis of Prognostic Gene Expression Network Genes in Metastatic Breast Cancer Models

    PubMed Central

    Geiger, Thomas R.; Ha, Ngoc-Han; Faraji, Farhoud; Michael, Helen T.; Rodriguez, Loren; Walker, Renard C.; Green, Jeffery E.; Simpson, R. Mark; Hunter, Kent W.

    2014-01-01

    Identification of conserved co-expression networks is a useful tool for clustering groups of genes enriched for common molecular or cellular functions [1]. The relative importance of genes within networks can frequently be inferred by the degree of connectivity, with those displaying high connectivity being significantly more likely to be associated with specific molecular functions [2]. Previously we utilized cross-species network analysis to identify two network modules that were significantly associated with distant metastasis free survival in breast cancer. Here, we validate one of the highly connected genes as a metastasis associated gene. Tpx2, the most highly connected gene within a proliferation network specifically prognostic for estrogen receptor positive (ER+) breast cancers, enhances metastatic disease, but in a tumor autonomous, proliferation-independent manner. Histologic analysis suggests instead that variation of TPX2 levels within disseminated tumor cells may influence the transition between dormant to actively proliferating cells in the secondary site. These results support the co-expression network approach for identification of new metastasis-associated genes to provide new information regarding the etiology of breast cancer progression and metastatic disease. PMID:25368990

  10. Transcriptional control in the segmentation gene network of Drosophila.

    PubMed

    Schroeder, Mark D; Pearce, Michael; Fak, John; Fan, HongQing; Unnerstall, Ulrich; Emberly, Eldon; Rajewsky, Nikolaus; Siggia, Eric D; Gaul, Ulrike

    2004-09-01

    The segmentation gene network of Drosophila consists of maternal and zygotic factors that generate, by transcriptional (cross-) regulation, expression patterns of increasing complexity along the anterior-posterior axis of the embryo. Using known binding site information for maternal and zygotic gap transcription factors, the computer algorithm Ahab recovers known segmentation control elements (modules) with excellent success and predicts many novel modules within the network and genome-wide. We show that novel module predictions are highly enriched in the network and typically clustered proximal to the promoter, not only upstream, but also in intronic space and downstream. When placed upstream of a reporter gene, they consistently drive patterned blastoderm expression, in most cases faithfully producing one or more pattern elements of the endogenous gene. Moreover, we demonstrate for the entire set of known and newly validated modules that Ahab's prediction of binding sites correlates well with the expression patterns produced by the modules, revealing basic rules governing their composition. Specifically, we show that maternal factors consistently act as activators and that gap factors act as repressors, except for the bimodal factor Hunchback. Our data suggest a simple context-dependent rule for its switch from repressive to activating function. Overall, the composition of modules appears well fitted to the spatiotemporal distribution of their positive and negative input factors. Finally, by comparing Ahab predictions with different categories of transcription factor input, we confirm the global regulatory structure of the segmentation gene network, but find odd skipped behaving like a primary pair-rule gene. The study expands our knowledge of the segmentation gene network by increasing the number of experimentally tested modules by 50%. For the first time, the entire set of validated modules is analyzed for binding site composition under a uniform set of

  11. Transcriptional Control in the Segmentation Gene Network of Drosophila

    PubMed Central

    Fan, HongQing; Unnerstall, Ulrich; Emberly, Eldon; Rajewsky, Nikolaus; Siggia, Eric D

    2004-01-01

    The segmentation gene network of Drosophila consists of maternal and zygotic factors that generate, by transcriptional (cross-) regulation, expression patterns of increasing complexity along the anterior-posterior axis of the embryo. Using known binding site information for maternal and zygotic gap transcription factors, the computer algorithm Ahab recovers known segmentation control elements (modules) with excellent success and predicts many novel modules within the network and genome-wide. We show that novel module predictions are highly enriched in the network and typically clustered proximal to the promoter, not only upstream, but also in intronic space and downstream. When placed upstream of a reporter gene, they consistently drive patterned blastoderm expression, in most cases faithfully producing one or more pattern elements of the endogenous gene. Moreover, we demonstrate for the entire set of known and newly validated modules that Ahab's prediction of binding sites correlates well with the expression patterns produced by the modules, revealing basic rules governing their composition. Specifically, we show that maternal factors consistently act as activators and that gap factors act as repressors, except for the bimodal factor Hunchback. Our data suggest a simple context-dependent rule for its switch from repressive to activating function. Overall, the composition of modules appears well fitted to the spatiotemporal distribution of their positive and negative input factors. Finally, by comparing Ahab predictions with different categories of transcription factor input, we confirm the global regulatory structure of the segmentation gene network, but find odd skipped behaving like a primary pair-rule gene. The study expands our knowledge of the segmentation gene network by increasing the number of experimentally tested modules by 50%. For the first time, the entire set of validated modules is analyzed for binding site composition under a uniform set of

  12. Compartmentalized gene regulatory network of the pathogenic fungus Fusarium graminearum.

    PubMed

    Guo, Li; Zhao, Guoyi; Xu, Jin-Rong; Kistler, H Corby; Gao, Lixin; Ma, Li-Jun

    2016-07-01

    Head blight caused by Fusarium graminearum threatens world-wide wheat production, resulting in both yield loss and mycotoxin contamination. We reconstructed the global F. graminearum gene regulatory network (GRN) from a large collection of transcriptomic data using Bayesian network inference, a machine-learning algorithm. This GRN reveals connectivity between key regulators and their target genes. Focusing on key regulators, this network contains eight distinct but interwoven modules. Enriched for unique functions, such as cell cycle, DNA replication, transcription, translation and stress responses, each module exhibits distinct expression profiles. Evolutionarily, the F. graminearum genome can be divided into core regions shared with closely related species and variable regions harboring genes that are unique to F. graminearum and perform species-specific functions. Interestingly, the inferred top regulators regulate genes that are significantly enriched from the same genomic regions (P < 0.05), revealing a compartmentalized network structure that may reflect network rewiring related to specific adaptation of this plant pathogen. This first-ever reconstructed filamentous fungal GRN primes our understanding of pathogenicity at the systems biology level and provides enticing prospects for novel disease control strategies involving the targeting of master regulators in pathogens. The program can be used to construct GRNs of other plant pathogens. PMID:26990214

  13. Gene Regulatory Networks Activated during Chronic Tuberculosis

    Technology Transfer Automated Retrieval System (TEKTRAN)

    Chronic tuberculosis represents a burden for most of world’s population. Several genes were found to be up-regulated at the late stage of chronic tuberculosis when DNA microarray protocol was used to analyze murine tuberculosis. Rv0348 is a potential transcriptional regulator that is highly expresse...

  14. Network Analysis of Human Genes Influencing Susceptibility to Mycobacterial Infections

    PubMed Central

    Lipner, Ettie M.; Garcia, Benjamin J.; Strong, Michael

    2016-01-01

    Tuberculosis and nontuberculous mycobacterial infections constitute a high burden of pulmonary disease in humans, resulting in over 1.5 million deaths per year. Building on the premise that genetic factors influence the instance, progression, and defense of infectious disease, we undertook a systems biology approach to investigate relationships among genetic factors that may play a role in increased susceptibility or control of mycobacterial infections. We combined literature and database mining with network analysis and pathway enrichment analysis to examine genes, pathways, and networks, involved in the human response to Mycobacterium tuberculosis and nontuberculous mycobacterial infections. This approach allowed us to examine functional relationships among reported genes, and to identify novel genes and enriched pathways that may play a role in mycobacterial susceptibility or control. Our findings suggest that the primary pathways and genes influencing mycobacterial infection control involve an interplay between innate and adaptive immune proteins and pathways. Signaling pathways involved in autoimmune disease were significantly enriched as revealed in our networks. Mycobacterial disease susceptibility networks were also examined within the context of gene-chemical relationships, in order to identify putative drugs and nutrients with potential beneficial immunomodulatory or anti-mycobacterial effects. PMID:26751573

  15. Beyond antioxidant genes in the ancient NRF2 regulatory network

    PubMed Central

    Lacher, Sarah E.; Lee, Joslynn S.; Wang, Xuting; Campbell, Michelle R.; Bell, Douglas A.; Slattery, Matthew

    2016-01-01

    NRF2, a basic leucine zipper transcription factor encoded by the gene NFE2L2, is a master regulator of the transcriptional response to oxidative stress. NRF2 is structurally and functionally conserved from insects to humans, and it heterodimerizes with the small MAF transcription factors to bind a consensus DNA sequence (the antioxidant response element, or ARE) and regulate gene expression. We have used genome-wide chromatin immunoprecipitation (ChIP-seq) and gene expression data to identify direct NRF2 target genes in Drosophila and humans. These data have allowed us to construct the deeply conserved ancient NRF2 regulatory network – target genes that are conserved from Drosophila to human. The ancient network consists of canonical antioxidant genes, as well as genes related to proteasomal pathways, metabolism, and a number of less expected genes. We have also used enhancer reporter assays and electrophoretic mobility shift assays to confirm NRF2-mediated regulation of ARE (antioxidant response element) activity at a number of these novel target genes. Interestingly, the ancient network also highlights a prominent negative feedback loop; this, combined with the finding that and NRF2-mediated regulatory output is tightly linked to the quality of the ARE it is targeting, suggests that precise regulation of nuclear NRF2 concentration is necessary to achieve proper quantitative regulation of distinct gene sets. Together, these findings highlight the importance of balance in the NRF2-ARE pathway, and indicate that NRF2-mediated regulation of xenobiotic metabolism, glucose metabolism, and proteostasis have been central to this pathway since its inception. PMID:26163000

  16. Multicolor labeling in developmental gene regulatory network analysis.

    PubMed

    Sethi, Aditya J; Angerer, Robert C; Angerer, Lynne M

    2014-01-01

    The sea urchin embryo is an important model system for developmental gene regulatory network (GRN) analysis. This chapter describes the use of multicolor fluorescent in situ hybridization (FISH) as well as a combination of FISH and immunohistochemistry in sea urchin embryonic GRN studies. The methods presented here can be applied to a variety of experimental settings where accurate spatial resolution of multiple gene products is required for constructing a developmental GRN. PMID:24567220

  17. Inferring Gene Regulatory Networks Using Conditional Regulation Pattern to Guide Candidate Genes

    PubMed Central

    Xiao, Fei; Gao, Lin; Ye, Yusen; Hu, Yuxuan; He, Ruijie

    2016-01-01

    Combining path consistency (PC) algorithms with conditional mutual information (CMI) are widely used in reconstruction of gene regulatory networks. CMI has many advantages over Pearson correlation coefficient in measuring non-linear dependence to infer gene regulatory networks. It can also discriminate the direct regulations from indirect ones. However, it is still a challenge to select the conditional genes in an optimal way, which affects the performance and computation complexity of the PC algorithm. In this study, we develop a novel conditional mutual information-based algorithm, namely RPNI (Regulation Pattern based Network Inference), to infer gene regulatory networks. For conditional gene selection, we define the co-regulation pattern, indirect-regulation pattern and mixture-regulation pattern as three candidate patterns to guide the selection of candidate genes. To demonstrate the potential of our algorithm, we apply it to gene expression data from DREAM challenge. Experimental results show that RPNI outperforms existing conditional mutual information-based methods in both accuracy and time complexity for different sizes of gene samples. Furthermore, the robustness of our algorithm is demonstrated by noisy interference analysis using different types of noise. PMID:27171286

  18. Identification of parameters of the Jiles-Atherton model by neural networks

    NASA Astrophysics Data System (ADS)

    Trapanese, Marco

    2011-04-01

    In this paper a procedure for the identification of the parameters of the Jiles-Atherton (JA) model is presented. The parameters of the JA model of a material are found by using a neural network trained by a collection of hysteresis curves, whose parameters are known. After a presentation of the Jiles-Atherton model, the neural network and the training procedure are described and the method is validated by using some numerical, as well as experimental, data.

  19. Epidermal differentiation gene regulatory networks controlled by MAF and MAFB.

    PubMed

    Labott, Andrew T; Lopez-Pajares, Vanessa

    2016-06-01

    Numerous regulatory factors in epidermal differentiation and their role in regulating different cell states have been identified in recent years. However, the genetic interactions between these regulators over the dynamic course of differentiation have not been studied. In this Extra-View article, we review recent work by Lopez-Pajares et al. that explores a new regulatory network in epidermal differentiation. They analyze the changing transcriptome throughout epidermal regeneration to identify 3 separate gene sets enriched in the progenitor, early and late differentiation states. Using expression module mapping, MAF along with MAFB, are identified as transcription factors essential for epidermal differentiation. Through double knock-down of MAF:MAFB using siRNA and CRISPR/Cas9-mediated knockout, epidermal differentiation was shown to be impaired both in-vitro and in-vivo, confirming MAF:MAFB's role to activate genes that drive differentiation. Lopez-Pajares and collaborators integrated 42 published regulator gene sets and the MAF:MAFB gene set into the dynamic differentiation gene expression landscape and found that lncRNAs TINCR and ANCR act as upstream regulators of MAF:MAFB. Furthermore, ChIP-seq analysis of MAF:MAFB identified key transcription factor genes linked to epidermal differentiation as downstream effectors. Combined, these findings illustrate a dynamically regulated network with MAF:MAFB as a crucial link for progenitor gene repression and differentiation gene activation. PMID:27097296

  20. miRTargetLink—miRNAs, Genes and Interaction Networks

    PubMed Central

    Hamberg, Maarten; Backes, Christina; Fehlmann, Tobias; Hart, Martin; Meder, Benjamin; Meese, Eckart; Keller, Andreas

    2016-01-01

    Information on miRNA targeting genes is growing rapidly. For high-throughput experiments, but also for targeted analyses of few genes or miRNAs, easy analysis with concise representation of results facilitates the work of life scientists. We developed miRTargetLink, a tool for automating respective analysis procedures that are frequently applied. Input of the web-based solution is either a single gene or single miRNA, but also sets of genes or miRNAs, can be entered. Validated and predicted targets are extracted from databases and an interaction network is presented. Users can select whether predicted targets, experimentally validated targets with strong or weak evidence, or combinations of those are considered. Central genes or miRNAs are highlighted and users can navigate through the network interactively. To discover the most relevant biochemical processes influenced by the target network, gene set analysis and miRNA set analysis are integrated. As a showcase for miRTargetLink, we analyze targets of five cardiac miRNAs. miRTargetLink is freely available without restrictions at www.ccb.uni-saarland.de/mirtargetlink. PMID:27089332

  1. Random matrix analysis of localization properties of gene coexpression network

    NASA Astrophysics Data System (ADS)

    Jalan, Sarika; Solymosi, Norbert; Vattay, Gábor; Li, Baowen

    2010-04-01

    We analyze gene coexpression network under the random matrix theory framework. The nearest-neighbor spacing distribution of the adjacency matrix of this network follows Gaussian orthogonal statistics of random matrix theory (RMT). Spectral rigidity test follows random matrix prediction for a certain range and deviates afterwards. Eigenvector analysis of the network using inverse participation ratio suggests that the statistics of bulk of the eigenvalues of network is consistent with those of the real symmetric random matrix, whereas few eigenvalues are localized. Based on these IPR calculations, we can divide eigenvalues in three sets: (a) The nondegenerate part that follows RMT. (b) The nondegenerate part, at both ends and at intermediate eigenvalues, which deviates from RMT and expected to contain information about important nodes in the network. (c) The degenerate part with zero eigenvalue, which fluctuates around RMT-predicted value. We identify nodes corresponding to the dominant modes of the corresponding eigenvectors and analyze their structural properties.

  2. Analyzing and constraining signaling networks: parameter estimation for the user.

    PubMed

    Geier, Florian; Fengos, Georgios; Felizzi, Federico; Iber, Dagmar

    2012-01-01

    The behavior of most dynamical models not only depends on the wiring but also on the kind and strength of interactions which are reflected in the parameter values of the model. The predictive value of mathematical models therefore critically hinges on the quality of the parameter estimates. Constraining a dynamical model by an appropriate parameterization follows a 3-step process. In an initial step, it is important to evaluate the sensitivity of the parameters of the model with respect to the model output of interest. This analysis points at the identifiability of model parameters and can guide the design of experiments. In the second step, the actual fitting needs to be carried out. This step requires special care as, on the one hand, noisy as well as partial observations can corrupt the identification of system parameters. On the other hand, the solution of the dynamical system usually depends in a highly nonlinear fashion on its parameters and, as a consequence, parameter estimation procedures get easily trapped in local optima. Therefore any useful parameter estimation procedure has to be robust and efficient with respect to both challenges. In the final step, it is important to access the validity of the optimized model. A number of reviews have been published on the subject. A good, nontechnical overview is provided by Jaqaman and Danuser (Nat Rev Mol Cell Biol 7(11):813-819, 2006) and a classical introduction, focussing on the algorithmic side, is given in Press (Numerical recipes: The art of scientific computing, Cambridge University Press, 3rd edn., 2007, Chapters 10 and 15). We will focus on the practical issues related to parameter estimation and use a model of the TGFβ-signaling pathway as an educative example. Corresponding parameter estimation software and models based on MATLAB code can be downloaded from the authors's web page ( http://www.bsse.ethz.ch/cobi ). PMID:23361979

  3. Local and global responses in complex gene regulation networks

    NASA Astrophysics Data System (ADS)

    Tsuchiya, Masa; Selvarajoo, Kumar; Piras, Vincent; Tomita, Masaru; Giuliani, Alessandro

    2009-04-01

    An exacerbated sensitivity to apparently minor stimuli and a general resilience of the entire system stay together side-by-side in biological systems. This apparent paradox can be explained by the consideration of biological systems as very strongly interconnected network systems. Some nodes of these networks, thanks to their peculiar location in the network architecture, are responsible for the sensitivity aspects, while the large degree of interconnection is at the basis of the resilience properties of the system. One relevant feature of the high degree of connectivity of gene regulation networks is the emergence of collective ordered phenomena influencing the entire genome and not only a specific portion of transcripts. The great majority of existing gene regulation models give the impression of purely local ‘hard-wired’ mechanisms disregarding the emergence of global ordered behavior encompassing thousands of genes while the general, genome wide, aspects are less known. Here we address, on a data analysis perspective, the discrimination between local and global scale regulations, this goal was achieved by means of the examination of two biological systems: innate immune response in macrophages and oscillating growth dynamics in yeast. Our aim was to reconcile the ‘hard-wired’ local view of gene regulation with a global continuous and scalable one borrowed from statistical physics. This reconciliation is based on the network paradigm in which the local ‘hard-wired’ activities correspond to the activation of specific crucial nodes in the regulation network, while the scalable continuous responses can be equated to the collective oscillations of the network after a perturbation.

  4. Lists2Networks: Integrated analysis of gene/protein lists

    PubMed Central

    2010-01-01

    Background Systems biologists are faced with the difficultly of analyzing results from large-scale studies that profile the activity of many genes, RNAs and proteins, applied in different experiments, under different conditions, and reported in different publications. To address this challenge it is desirable to compare the results from different related studies such as mRNA expression microarrays, genome-wide ChIP-X, RNAi screens, proteomics and phosphoproteomics experiments in a coherent global framework. In addition, linking high-content multilayered experimental results with prior biological knowledge can be useful for identifying functional themes and form novel hypotheses. Results We present Lists2Networks, a web-based system that allows users to upload lists of mammalian genes/proteins onto a server-based program for integrated analysis. The system includes web-based tools to manipulate lists with different set operations, to expand lists using existing mammalian networks of protein-protein interactions, co-expression correlation, or background knowledge co-annotation correlation, as well as to apply gene-list enrichment analyses against many gene-list libraries of prior biological knowledge such as pathways, gene ontology terms, kinase-substrate, microRNA-mRAN, and protein-protein interactions, metabolites, and protein domains. Such analyses can be applied to several lists at once against many prior knowledge libraries of gene-lists associated with specific annotations. The system also contains features that allow users to export networks and share lists with other users of the system. Conclusions Lists2Networks is a user friendly web-based software system expected to significantly ease the computational analysis process for experimental systems biologists employing high-throughput experiments at multiple layers of regulation. The system is freely available at http://www.lists2networks.org. PMID:20152038

  5. An algebra-based method for inferring gene regulatory networks

    PubMed Central

    2014-01-01

    Background The inference of gene regulatory networks (GRNs) from experimental observations is at the heart of systems biology. This includes the inference of both the network topology and its dynamics. While there are many algorithms available to infer the network topology from experimental data, less emphasis has been placed on methods that infer network dynamics. Furthermore, since the network inference problem is typically underdetermined, it is essential to have the option of incorporating into the inference process, prior knowledge about the network, along with an effective description of the search space of dynamic models. Finally, it is also important to have an understanding of how a given inference method is affected by experimental and other noise in the data used. Results This paper contains a novel inference algorithm using the algebraic framework of Boolean polynomial dynamical systems (BPDS), meeting all these requirements. The algorithm takes as input time series data, including those from network perturbations, such as knock-out mutant strains and RNAi experiments. It allows for the incorporation of prior biological knowledge while being robust to significant levels of noise in the data used for inference. It uses an evolutionary algorithm for local optimization with an encoding of the mathematical models as BPDS. The BPDS framework allows an effective representation of the search space for algebraic dynamic models that improves computational performance. The algorithm is validated with both simulated and experimental microarray expression profile data. Robustness to noise is tested using a published mathematical model of the segment polarity gene network in Drosophila melanogaster. Benchmarking of the algorithm is done by comparison with a spectrum of state-of-the-art network inference methods on data from the synthetic IRMA network to demonstrate that our method has good precision and recall for the network reconstruction task, while also

  6. Noise-tolerant model selection and parameter estimation for complex networks

    NASA Astrophysics Data System (ADS)

    Aliakbary, Sadegh; Motallebi, Sadegh; Rashidian, Sina; Habibi, Jafar; Movaghar, Ali

    2015-06-01

    Real networks often exhibit nontrivial topological features that do not occur in random graphs. The need for synthesizing realistic networks has resulted in development of various network models. In this paper, we address the problem of selecting and calibrating the model that best fits a given target network. The existing model fitting approaches mostly suffer from sensitivity to network perturbations, lack of the parameter estimation component, dependency on the size of the networks, and low accuracy. To overcome these limitations, we considered a broad range of network features and employed machine learning techniques such as genetic algorithms, distance metric learning, nearest neighbor classification, and artificial neural networks. Our proposed method, which is named ModelFit, outperforms the state-of-the-art baselines with respect to accuracy and noise tolerance in different network datasets.

  7. Integrating gene expression and protein-protein interaction network to prioritize cancer-associated genes

    PubMed Central

    2012-01-01

    Background To understand the roles they play in complex diseases, genes need to be investigated in the networks they are involved in. Integration of gene expression and network data is a promising approach to prioritize disease-associated genes. Some methods have been developed in this field, but the problem is still far from being solved. Results In this paper, we developed a method, Networked Gene Prioritizer (NGP), to prioritize cancer-associated genes. Applications on several breast cancer and lung cancer datasets demonstrated that NGP performs better than the existing methods. It provides stable top ranking genes between independent datasets. The top-ranked genes by NGP are enriched in the cancer-associated pathways. The top-ranked genes by NGP-PLK1, MCM2, MCM3, MCM7, MCM10 and SKP2 might coordinate to promote cell cycle related processes in cancer but not normal cells. Conclusions In this paper, we have developed a method named NGP, to prioritize cancer-associated genes. Our results demonstrated that NGP performs better than the existing methods. PMID:22838965

  8. Inference of nonlinear gene regulatory networks through optimized ensemble of support vector regression and dynamic Bayesian networks.

    PubMed

    Akutekwe, Arinze; Seker, Huseyin

    2015-08-01

    Comprehensive understanding of gene regulatory networks (GRNs) is a major challenge in systems biology. Most methods for modeling and inferring the dynamics of GRNs, such as those based on state space models, vector autoregressive models and G1DBN algorithm, assume linear dependencies among genes. However, this strong assumption does not make for true representation of time-course relationships across the genes, which are inherently nonlinear. Nonlinear modeling methods such as the S-systems and causal structure identification (CSI) have been proposed, but are known to be statistically inefficient and analytically intractable in high dimensions. To overcome these limitations, we propose an optimized ensemble approach based on support vector regression (SVR) and dynamic Bayesian networks (DBNs). The method called SVR-DBN, uses nonlinear kernels of the SVR to infer the temporal relationships among genes within the DBN framework. The two-stage ensemble is further improved by SVR parameter optimization using Particle Swarm Optimization. Results on eight insilico-generated datasets, and two real world datasets of Drosophila Melanogaster and Escherichia Coli, show that our method outperformed the G1DBN algorithm by a total average accuracy of 12%. We further applied our method to model the time-course relationships of ovarian carcinoma. From our results, four hub genes were discovered. Stratified analysis further showed that the expression levels Prostrate differentiation factor and BTG family member 2 genes, were significantly increased by the cisplatin and oxaliplatin platinum drugs; while expression levels of Polo-like kinase and Cyclin B1 genes, were both decreased by the platinum drugs. These hub genes might be potential biomarkers for ovarian carcinoma. PMID:26738192

  9. Stability-driven nonnegative matrix factorization to interpret spatial gene expression and build local gene networks.

    PubMed

    Wu, Siqi; Joseph, Antony; Hammonds, Ann S; Celniker, Susan E; Yu, Bin; Frise, Erwin

    2016-04-19

    Spatial gene expression patterns enable the detection of local covariability and are extremely useful for identifying local gene interactions during normal development. The abundance of spatial expression data in recent years has led to the modeling and analysis of regulatory networks. The inherent complexity of such data makes it a challenge to extract biological information. We developed staNMF, a method that combines a scalable implementation of nonnegative matrix factorization (NMF) with a new stability-driven model selection criterion. When applied to a set ofDrosophilaearly embryonic spatial gene expression images, one of the largest datasets of its kind, staNMF identified 21 principal patterns (PP). Providing a compact yet biologically interpretable representation ofDrosophilaexpression patterns, PP are comparable to a fate map generated experimentally by laser ablation and show exceptional promise as a data-driven alternative to manual annotations. Our analysis mapped genes to cell-fate programs and assigned putative biological roles to uncharacterized genes. Finally, we used the PP to generate local transcription factor regulatory networks. Spatially local correlation networks were constructed for six PP that span along the embryonic anterior-posterior axis. Using a two-tail 5% cutoff on correlation, we reproduced 10 of the 11 links in the well-studied gap gene network. The performance of PP with theDrosophiladata suggests that staNMF provides informative decompositions and constitutes a useful computational lens through which to extract biological insight from complex and often noisy gene expression data. PMID:27071099

  10. Network analysis of genes and their association with diseases.

    PubMed

    Kontou, Panagiota I; Pavlopoulou, Athanasia; Dimou, Niki L; Pavlopoulos, Georgios A; Bagos, Pantelis G

    2016-09-15

    A plethora of network-based approaches within the Systems Biology universe have been applied, to date, to investigate the underlying molecular mechanisms of various human diseases. In the present study, we perform a bipartite, topological and clustering graph analysis in order to gain a better understanding of the relationships between human genetic diseases and the relationships between the genes that are implicated in them. For this purpose, disease-disease and gene-gene networks were constructed from combined gene-disease association networks. The latter, were created by collecting and integrating data from three diverse resources, each one with different content covering from rare monogenic disorders to common complex diseases. This data pluralism enabled us to uncover important associations between diseases with unrelated phenotypic manifestations but with common genetic origin. For our analysis, the topological attributes and the functional implications of the individual networks were taken into account and are shortly discussed. We believe that some observations of this study could advance our understanding regarding the etiology of a disease with distinct pathological manifestations, and simultaneously provide the springboard for the development of preventive and therapeutic strategies and its underlying genetic mechanisms. PMID:27265032

  11. A gene network engineering platform for lactic acid bacteria

    PubMed Central

    Kong, Wentao; Kapuganti, Venkata S.; Lu, Ting

    2016-01-01

    Recent developments in synthetic biology have positioned lactic acid bacteria (LAB) as a major class of cellular chassis for applications. To achieve the full potential of LAB, one fundamental prerequisite is the capacity for rapid engineering of complex gene networks, such as natural biosynthetic pathways and multicomponent synthetic circuits, into which cellular functions are encoded. Here, we present a synthetic biology platform for rapid construction and optimization of large-scale gene networks in LAB. The platform involves a copy-controlled shuttle for hosting target networks and two associated strategies that enable efficient genetic editing and phenotypic validation. By using a nisin biosynthesis pathway and its variants as examples, we demonstrated multiplex, continuous editing of small DNA parts, such as ribosome-binding sites, as well as efficient manipulation of large building blocks such as genes and operons. To showcase the platform, we applied it to expand the phenotypic diversity of the nisin pathway by quickly generating a library of 63 pathway variants. We further demonstrated its utility by altering the regulatory topology of the nisin pathway for constitutive bacteriocin biosynthesis. This work demonstrates the feasibility of rapid and advanced engineering of gene networks in LAB, fostering their applications in biomedicine and other areas. PMID:26503255

  12. Using SPEEDES to simulate the blue gene interconnect network

    NASA Technical Reports Server (NTRS)

    Springer, P.; Upchurch, E.

    2003-01-01

    JPL and the Center for Advanced Computer Architecture (CACR) is conducting application and simulation analyses of BG/L in order to establish a range of effectiveness for the Blue Gene/L MPP architecture in performing important classes of computations and to determine the design sensitivity of the global interconnect network in support of real world ASCI application execution.

  13. Compartmentalized gene regulatory network of the pathogenic fungus Fusarium graminearum

    Technology Transfer Automated Retrieval System (TEKTRAN)

    Head blight caused by Fusarium graminearum (Fg) is a major limiting factor of wheat production with both yield loss and mycotoxin contamination. Here we report a model for global Fg gene regulatory networks (GRNs) inferred from a large collection of transcriptomic data using a machine-learning appro...

  14. A gene network engineering platform for lactic acid bacteria.

    PubMed

    Kong, Wentao; Kapuganti, Venkata S; Lu, Ting

    2016-02-29

    Recent developments in synthetic biology have positioned lactic acid bacteria (LAB) as a major class of cellular chassis for applications. To achieve the full potential of LAB, one fundamental prerequisite is the capacity for rapid engineering of complex gene networks, such as natural biosynthetic pathways and multicomponent synthetic circuits, into which cellular functions are encoded. Here, we present a synthetic biology platform for rapid construction and optimization of large-scale gene networks in LAB. The platform involves a copy-controlled shuttle for hosting target networks and two associated strategies that enable efficient genetic editing and phenotypic validation. By using a nisin biosynthesis pathway and its variants as examples, we demonstrated multiplex, continuous editing of small DNA parts, such as ribosome-binding sites, as well as efficient manipulation of large building blocks such as genes and operons. To showcase the platform, we applied it to expand the phenotypic diversity of the nisin pathway by quickly generating a library of 63 pathway variants. We further demonstrated its utility by altering the regulatory topology of the nisin pathway for constitutive bacteriocin biosynthesis. This work demonstrates the feasibility of rapid and advanced engineering of gene networks in LAB, fostering their applications in biomedicine and other areas. PMID:26503255

  15. Oncogenes and tumor suppressor genes: comparative genomics and network perspectives

    PubMed Central

    2015-01-01

    Background Defective tumor suppressor genes (TSGs) and hyperactive oncogenes (OCGs) heavily contribute to cell proliferation and apoptosis during cancer development through genetic variations such as somatic mutations and deletions. Moreover, they usually do not perform their cellular functions individually but rather execute jointly. Therefore, a comprehensive comparison of their mutation patterns and network properties may provide a deeper understanding of their roles in the cancer development and provide some clues for identification of novel targets. Results In this study, we performed a comprehensive survey of TSGs and OCGs from the perspectives of somatic mutations and network properties. For comparative purposes, we choose five gene sets: TSGs, OCGs, cancer drug target genes, essential genes, and other genes. Based on the data from Pan-Cancer project, we found that TSGs had the highest mutation frequency in most tumor types and the OCGs second. The essential genes had the lowest mutation frequency in all tumor types. For the network properties in the human protein-protein interaction (PPI) network, we found that, relative to target proteins, essential proteins, and other proteins, the TSG proteins and OCG proteins both tended to have higher degrees, higher betweenness, lower clustering coefficients, and shorter shortest-path distances. Moreover, the TSG proteins and OCG proteins tended to have direct interactions with cancer drug target proteins. To further explore their relationship, we generated a TSG-OCG network and found that TSGs and OCGs connected strongly with each other. The integration of the mutation frequency with the TSG-OCG network offered a network view of TSGs, OCGs, and their interactions, which may provide new insights into how the TSGs and OCGs jointly contribute to the cancer development. Conclusions Our study first discovered that the OCGs and TSGs had different mutation patterns, but had similar and stronger protein

  16. Obtain osteoarthritis related molecular signature genes through regulation network.

    PubMed

    Li, Yawei; Wang, Bing; Lv, Guohua; Xiong, Guangzhong; Liu, Wei Dong; Li, Lei

    2012-01-01

    Osteoarthritis (OA), also known as degenerative joint disease or osteoarthrosis, is the most common form of arthritis. OA occurs when cartilage in the joints wears down over time. We used the GSE1919 series to identify potential genes that correlated to OA. The aim of our study was to obtain a molecular signature of OA through the regulation network based on differentially expressed genes. From the result of regulation network construction in OA, a number of transcription factors (TFs) and pathways closely related to OA were linked by our method. Peroxisome proliferator-activated receptor γ also arises as hub nodes in our transcriptome network and certain TFs containing CEBPD, EGR2 and ETS2 were shown to be related to OA by a previous study. PMID:21946934

  17. Gap Gene Regulatory Dynamics Evolve along a Genotype Network

    PubMed Central

    Crombach, Anton; Wotton, Karl R.; Jiménez-Guri, Eva; Jaeger, Johannes

    2016-01-01

    Developmental gene networks implement the dynamic regulatory mechanisms that pattern and shape the organism. Over evolutionary time, the wiring of these networks changes, yet the patterning outcome is often preserved, a phenomenon known as “system drift.” System drift is illustrated by the gap gene network—involved in segmental patterning—in dipteran insects. In the classic model organism Drosophila melanogaster and the nonmodel scuttle fly Megaselia abdita, early activation and placement of gap gene expression domains show significant quantitative differences, yet the final patterning output of the system is essentially identical in both species. In this detailed modeling analysis of system drift, we use gene circuits which are fit to quantitative gap gene expression data in M. abdita and compare them with an equivalent set of models from D. melanogaster. The results of this comparative analysis show precisely how compensatory regulatory mechanisms achieve equivalent final patterns in both species. We discuss the larger implications of the work in terms of “genotype networks” and the ways in which the structure of regulatory networks can influence patterns of evolutionary change (evolvability). PMID:26796549

  18. Ensemble Inference and Inferability of Gene Regulatory Networks

    PubMed Central

    Ud-Dean, S. M. Minhaz; Gunawan, Rudiyanto

    2014-01-01

    The inference of gene regulatory network (GRN) from gene expression data is an unsolved problem of great importance. This inference has been stated, though not proven, to be underdetermined implying that there could be many equivalent (indistinguishable) solutions. Motivated by this fundamental limitation, we have developed new framework and algorithm, called TRaCE, for the ensemble inference of GRNs. The ensemble corresponds to the inherent uncertainty associated with discriminating direct and indirect gene regulations from steady-state data of gene knock-out (KO) experiments. We applied TRaCE to analyze the inferability of random GRNs and the GRNs of E. coli and yeast from single- and double-gene KO experiments. The results showed that, with the exception of networks with very few edges, GRNs are typically not inferable even when the data are ideal (unbiased and noise-free). Finally, we compared the performance of TRaCE with top performing methods of DREAM4 in silico network inference challenge. PMID:25093509

  19. Robustness and Accuracy in Sea Urchin Developmental Gene Regulatory Networks

    PubMed Central

    Ben-Tabou de-Leon, Smadar

    2016-01-01

    Developmental gene regulatory networks robustly control the timely activation of regulatory and differentiation genes. The structure of these networks underlies their capacity to buffer intrinsic and extrinsic noise and maintain embryonic morphology. Here I illustrate how the use of specific architectures by the sea urchin developmental regulatory networks enables the robust control of cell fate decisions. The Wnt-βcatenin signaling pathway patterns the primary embryonic axis while the BMP signaling pathway patterns the secondary embryonic axis in the sea urchin embryo and across bilateria. Interestingly, in the sea urchin in both cases, the signaling pathway that defines the axis controls directly the expression of a set of downstream regulatory genes. I propose that this direct activation of a set of regulatory genes enables a uniform regulatory response and a clear cut cell fate decision in the endoderm and in the dorsal ectoderm. The specification of the mesodermal pigment cell lineage is activated by Delta signaling that initiates a triple positive feedback loop that locks down the pigment specification state. I propose that the use of compound positive feedback circuitry provides the endodermal cells enough time to turn off mesodermal genes and ensures correct mesoderm vs. endoderm fate decision. Thus, I argue that understanding the control properties of repeatedly used regulatory architectures illuminates their role in embryogenesis and provides possible explanations to their resistance to evolutionary change. PMID:26913048

  20. Propagation of genetic variation in gene regulatory networks

    NASA Astrophysics Data System (ADS)

    Plahte, Erik; Gjuvsland, Arne B.; Omholt, Stig W.

    2013-08-01

    A future quantitative genetics theory should link genetic variation to phenotypic variation in a causally cohesive way based on how genes actually work and interact. We provide a theoretical framework for predicting and understanding the manifestation of genetic variation in haploid and diploid regulatory networks with arbitrary feedback structures and intra-locus and inter-locus functional dependencies. Using results from network and graph theory, we define propagation functions describing how genetic variation in a locus is propagated through the network, and show how their derivatives are related to the network’s feedback structure. Similarly, feedback functions describe the effect of genotypic variation of a locus on itself, either directly or mediated by the network. A simple sign rule relates the sign of the derivative of the feedback function of any locus to the feedback loops involving that particular locus. We show that the sign of the phenotypically manifested interaction between alleles at a diploid locus is equal to the sign of the dominant feedback loop involving that particular locus, in accordance with recent results for a single locus system. Our results provide tools by which one can use observable equilibrium concentrations of gene products to disclose structural properties of the network architecture. Our work is a step towards a theory capable of explaining the pleiotropy and epistasis features of genetic variation in complex regulatory networks as functions of regulatory anatomy and functional location of the genetic variation.

  1. Mapping functional transcription factor networks from gene expression data

    PubMed Central

    Haynes, Brian C.; Maier, Ezekiel J.; Kramer, Michael H.; Wang, Patricia I.; Brown, Holly; Brent, Michael R.

    2013-01-01

    A critical step in understanding how a genome functions is determining which transcription factors (TFs) regulate each gene. Accordingly, extensive effort has been devoted to mapping TF networks. In Saccharomyces cerevisiae, protein–DNA interactions have been identified for most TFs by ChIP-chip, and expression profiling has been done on strains deleted for most TFs. These studies revealed that there is little overlap between the genes whose promoters are bound by a TF and those whose expression changes when the TF is deleted, leaving us without a definitive TF network for any eukaryote and without an efficient method for mapping functional TF networks. This paper describes NetProphet, a novel algorithm that improves the efficiency of network mapping from gene expression data. NetProphet exploits a fundamental observation about the nature of TF networks: The response to disrupting or overexpressing a TF is strongest on its direct targets and dissipates rapidly as it propagates through the network. Using S. cerevisiae data, we show that NetProphet can predict thousands of direct, functional regulatory interactions, using only gene expression data. The targets that NetProphet predicts for a TF are at least as likely to have sites matching the TF's binding specificity as the targets implicated by ChIP. Unlike most ChIP targets, the NetProphet targets also show evidence of functional regulation. This suggests a surprising conclusion: The best way to begin mapping direct, functional TF-promoter interactions may not be by measuring binding. We also show that NetProphet yields new insights into the functions of several yeast TFs, including a well-studied TF, Cbf1, and a completely unstudied TF, Eds1. PMID:23636944

  2. Floral morphogenesis: stochastic explorations of a gene network epigenetic landscape.

    PubMed

    Alvarez-Buylla, Elena R; Chaos, Alvaro; Aldana, Maximino; Benítez, Mariana; Cortes-Poza, Yuriria; Espinosa-Soto, Carlos; Hartasánchez, Diego A; Lotto, R Beau; Malkin, David; Escalera Santos, Gerardo J; Padilla-Longoria, Pablo

    2008-01-01

    In contrast to the classical view of development as a preprogrammed and deterministic process, recent studies have demonstrated that stochastic perturbations of highly non-linear systems may underlie the emergence and stability of biological patterns. Herein, we address the question of whether noise contributes to the generation of the stereotypical temporal pattern in gene expression during flower development. We modeled the regulatory network of organ identity genes in the Arabidopsis thaliana flower as a stochastic system. This network has previously been shown to converge to ten fixed-point attractors, each with gene expression arrays that characterize inflorescence cells and primordial cells of sepals, petals, stamens, and carpels. The network used is binary, and the logical rules that govern its dynamics are grounded in experimental evidence. We introduced different levels of uncertainty in the updating rules of the network. Interestingly, for a level of noise of around 0.5-10%, the system exhibited a sequence of transitions among attractors that mimics the sequence of gene activation configurations observed in real flowers. We also implemented the gene regulatory network as a continuous system using the Glass model of differential equations, that can be considered as a first approximation of kinetic-reaction equations, but which are not necessarily equivalent to the Boolean model. Interestingly, the Glass dynamics recover a temporal sequence of attractors, that is qualitatively similar, although not identical, to that obtained using the Boolean model. Thus, time ordering in the emergence of cell-fate patterns is not an artifact of synchronous updating in the Boolean model. Therefore, our model provides a novel explanation for the emergence and robustness of the ubiquitous temporal pattern of floral organ specification. It also constitutes a new approach to understanding morphogenesis, providing predictions on the population dynamics of cells with different

  3. Ensemble-Based Network Aggregation Improves the Accuracy of Gene Network Reconstruction

    PubMed Central

    Xiao, Guanghua; Xie, Yang

    2014-01-01

    Reverse engineering approaches to constructing gene regulatory networks (GRNs) based on genome-wide mRNA expression data have led to significant biological findings, such as the discovery of novel drug targets. However, the reliability of the reconstructed GRNs needs to be improved. Here, we propose an ensemble-based network aggregation approach to improving the accuracy of network topologies constructed from mRNA expression data. To evaluate the performances of different approaches, we created dozens of simulated networks from combinations of gene-set sizes and sample sizes and also tested our methods on three Escherichia coli datasets. We demonstrate that the ensemble-based network aggregation approach can be used to effectively integrate GRNs constructed from different studies – producing more accurate networks. We also apply this approach to building a network from epithelial mesenchymal transition (EMT) signature microarray data and identify hub genes that might be potential drug targets. The R code used to perform all of the analyses is available in an R package entitled “ENA”, accessible on CRAN (http://cran.r-project.org/web/packages/ENA/). PMID:25390635

  4. Systematic prediction of gene function in Arabidopsis thaliana using a probabilistic functional gene network

    PubMed Central

    Hwang, Sohyun; Rhee, Seung Y; Marcotte, Edward M; Lee, Insuk

    2012-01-01

    AraNet is a functional gene network for the reference plant Arabidopsis and has been constructed in order to identify new genes associated with plant traits. It is highly predictive for diverse biological pathways and can be used to prioritize genes for functional screens. Moreover, AraNet provides a web-based tool with which plant biologists can efficiently discover novel functions of Arabidopsis genes (http://www.functionalnet.org/aranet/). This protocol explains how to conduct network-based prediction of gene functions using AraNet and how to interpret the prediction results. Functional discovery in plant biology is facilitated by combining candidate prioritization by AraNet with focused experimental tests. PMID:21886106

  5. Automated Identification of Core Regulatory Genes in Human Gene Regulatory Networks

    PubMed Central

    Singhal, Amit; Kumar, Pavanish; de Libero, Gennaro; Poidinger, Michael; Monterola, Christopher

    2015-01-01

    Human gene regulatory networks (GRN) can be difficult to interpret due to a tangle of edges interconnecting thousands of genes. We constructed a general human GRN from extensive transcription factor and microRNA target data obtained from public databases. In a subnetwork of this GRN that is active during estrogen stimulation of MCF-7 breast cancer cells, we benchmarked automated algorithms for identifying core regulatory genes (transcription factors and microRNAs). Among these algorithms, we identified K-core decomposition, pagerank and betweenness centrality algorithms as the most effective for discovering core regulatory genes in the network evaluated based on previously known roles of these genes in MCF-7 biology as well as in their ability to explain the up or down expression status of up to 70% of the remaining genes. Finally, we validated the use of K-core algorithm for organizing the GRN in an easier to interpret layered hierarchy where more influential regulatory genes percolate towards the inner layers. The integrated human gene and miRNA network and software used in this study are provided as supplementary materials (S1 Data) accompanying this manuscript. PMID:26393364

  6. Characterization of Genes for Beef Marbling Based on Applying Gene Coexpression Network

    PubMed Central

    Lim, Dajeong; Kim, Nam-Kuk; Lee, Seung-Hwan; Park, Hye-Sun; Cho, Yong-Min; Chai, Han-Ha; Kim, Heebal

    2014-01-01

    Marbling is an important trait in characterization beef quality and a major factor for determining the price of beef in the Korean beef market. In particular, marbling is a complex trait and needs a system-level approach for identifying candidate genes related to the trait. To find the candidate gene associated with marbling, we used a weighted gene coexpression network analysis from the expression value of bovine genes. Hub genes were identified; they were topologically centered with large degree and BC values in the global network. We performed gene expression analysis to detect candidate genes in M. longissimus with divergent marbling phenotype (marbling scores 2 to 7) using qRT-PCR. The results demonstrate that transmembrane protein 60 (TMEM60) and dihydropyrimidine dehydrogenase (DPYD) are associated with increasing marbling fat. We suggest that the network-based approach in livestock may be an important method for analyzing the complex effects of candidate genes associated with complex traits like marbling or tenderness. PMID:24624372

  7. Measuring semantic similarities by combining gene ontology annotations and gene co-function networks

    SciTech Connect

    Peng, Jiajie; Uygun, Sahra; Kim, Taehyong; Wang, Yadong; Rhee, Seung Y.; Chen, Jin

    2015-02-14

    Background: Gene Ontology (GO) has been used widely to study functional relationships between genes. The current semantic similarity measures rely only on GO annotations and GO structure. This limits the power of GO-based similarity because of the limited proportion of genes that are annotated to GO in most organisms. Results: We introduce a novel approach called NETSIM (network-based similarity measure) that incorporates information from gene co-function networks in addition to using the GO structure and annotations. Using metabolic reaction maps of yeast, Arabidopsis, and human, we demonstrate that NETSIM can improve the accuracy of GO term similarities. We also demonstrate that NETSIM works well even for genomes with sparser gene annotation data. We applied NETSIM on large Arabidopsis gene families such as cytochrome P450 monooxygenases to group the members functionally and show that this grouping could facilitate functional characterization of genes in these families. Conclusions: Using NETSIM as an example, we demonstrated that the performance of a semantic similarity measure could be significantly improved after incorporating genome-specific information. NETSIM incorporates both GO annotations and gene co-function network data as a priori knowledge in the model. Therefore, functional similarities of GO terms that are not explicitly encoded in GO but are relevant in a taxon-specific manner become measurable when GO annotations are limited.

  8. Measuring semantic similarities by combining gene ontology annotations and gene co-function networks

    DOE PAGESBeta

    Peng, Jiajie; Uygun, Sahra; Kim, Taehyong; Wang, Yadong; Rhee, Seung Y.; Chen, Jin

    2015-02-14

    Background: Gene Ontology (GO) has been used widely to study functional relationships between genes. The current semantic similarity measures rely only on GO annotations and GO structure. This limits the power of GO-based similarity because of the limited proportion of genes that are annotated to GO in most organisms. Results: We introduce a novel approach called NETSIM (network-based similarity measure) that incorporates information from gene co-function networks in addition to using the GO structure and annotations. Using metabolic reaction maps of yeast, Arabidopsis, and human, we demonstrate that NETSIM can improve the accuracy of GO term similarities. We also demonstratemore » that NETSIM works well even for genomes with sparser gene annotation data. We applied NETSIM on large Arabidopsis gene families such as cytochrome P450 monooxygenases to group the members functionally and show that this grouping could facilitate functional characterization of genes in these families. Conclusions: Using NETSIM as an example, we demonstrated that the performance of a semantic similarity measure could be significantly improved after incorporating genome-specific information. NETSIM incorporates both GO annotations and gene co-function network data as a priori knowledge in the model. Therefore, functional similarities of GO terms that are not explicitly encoded in GO but are relevant in a taxon-specific manner become measurable when GO annotations are limited.« less

  9. Walking on multiple disease-gene networks to prioritize candidate genes.

    PubMed

    Jiang, Rui

    2015-06-01

    Uncovering causal genes for human inherited diseases, as the primary step toward understanding the pathogenesis of these diseases, requires a combined analysis of genetic and genomic data. Although bioinformatics methods have been designed to prioritize candidate genes resulting from genetic linkage analysis or association studies, the coverage of both diseases and genes in existing methods is quite limited, thereby preventing the scan of causal genes for a significant proportion of diseases at the whole-genome level. To overcome this limitation, we propose a method named pgWalk to prioritize candidate genes by integrating multiple phenomic and genomic data. We derive three types of phenotype similarities among 7719 diseases and nine types of functional similarities among 20327 genes. Based on a pair of phenotype and gene similarities, we construct a disease-gene network and then simulate the process that a random walker wanders on such a heterogeneous network to quantify the strength of association between a candidate gene and a query disease. A weighted version of the Fisher's method with dependent correction is adopted to integrate 27 scores obtained in this way, and a final q-value is calibrated for prioritizing candidate genes. A series of validation experiments are conducted to demonstrate the superior performance of this approach. We further show the effectiveness of this method in exome sequencing studies of autism and epileptic encephalopathies. An online service and the standalone software of pgWalk can be found at http://bioinfo.au.tsinghua.edu.cn/jianglab/pgwalk. PMID:25681405

  10. A gene regulatory network armature for T-lymphocyte specification

    SciTech Connect

    Fung, Elizabeth-sharon

    2008-01-01

    Choice of a T-lymphoid fate by hematopoietic progenitor cells depends on sustained Notch-Delta signaling combined with tightly-regulated activities of multiple transcription factors. To dissect the regulatory network connections that mediate this process, we have used high-resolution analysis of regulatory gene expression trajectories from the beginning to the end of specification; tests of the short-term Notchdependence of these gene expression changes; and perturbation analyses of the effects of overexpression of two essential transcription factors, namely PU.l and GATA-3. Quantitative expression measurements of >50 transcription factor and marker genes have been used to derive the principal components of regulatory change through which T-cell precursors progress from primitive multipotency to T-lineage commitment. Distinct parts of the path reveal separate contributions of Notch signaling, GATA-3 activity, and downregulation of PU.l. Using BioTapestry, the results have been assembled into a draft gene regulatory network for the specification of T-cell precursors and the choice of T as opposed to myeloid dendritic or mast-cell fates. This network also accommodates effects of E proteins and mutual repression circuits of Gfil against Egr-2 and of TCF-l against PU.l as proposed elsewhere, but requires additional functions that remain unidentified. Distinctive features of this network structure include the intense dose-dependence of GATA-3 effects; the gene-specific modulation of PU.l activity based on Notch activity; the lack of direct opposition between PU.l and GATA-3; and the need for a distinct, late-acting repressive function or functions to extinguish stem and progenitor-derived regulatory gene expression.

  11. A Network Approach to Analyzing Highly Recombinant Malaria Parasite Genes

    PubMed Central

    Larremore, Daniel B.; Clauset, Aaron; Buckee, Caroline O.

    2013-01-01

    The var genes of the human malaria parasite Plasmodium falciparum present a challenge to population geneticists due to their extreme diversity, which is generated by high rates of recombination. These genes encode a primary antigen protein called PfEMP1, which is expressed on the surface of infected red blood cells and elicits protective immune responses. Var gene sequences are characterized by pronounced mosaicism, precluding the use of traditional phylogenetic tools that require bifurcating tree-like evolutionary relationships. We present a new method that identifies highly variable regions (HVRs), and then maps each HVR to a complex network in which each sequence is a node and two nodes are linked if they share an exact match of significant length. Here, networks of var genes that recombine freely are expected to have a uniformly random structure, but constraints on recombination will produce network communities that we identify using a stochastic block model. We validate this method on synthetic data, showing that it correctly recovers populations of constrained recombination, before applying it to the Duffy Binding Like-α (DBLα) domain of var genes. We find nine HVRs whose network communities map in distinctive ways to known DBLα classifications and clinical phenotypes. We show that the recombinational constraints of some HVRs are correlated, while others are independent. These findings suggest that this micromodular structuring facilitates independent evolutionary trajectories of neighboring mosaic regions, allowing the parasite to retain protein function while generating enormous sequence diversity. Our approach therefore offers a rigorous method for analyzing evolutionary constraints in var genes, and is also flexible enough to be easily applied more generally to any highly recombinant sequences. PMID:24130474

  12. Prioritization of Susceptibility Genes for Ectopic Pregnancy by Gene Network Analysis

    PubMed Central

    Liu, Ji-Long; Zhao, Miao

    2016-01-01

    Ectopic pregnancy is a very dangerous complication of pregnancy, affecting 1%–2% of all reported pregnancies. Due to ethical constraints on human biopsies and the lack of suitable animal models, there has been little success in identifying functionally important genes in the pathogenesis of ectopic pregnancy. In the present study, we developed a random walk–based computational method named TM-rank to prioritize ectopic pregnancy–related genes based on text mining data and gene network information. Using a defined threshold value, we identified five top-ranked genes: VEGFA (vascular endothelial growth factor A), IL8 (interleukin 8), IL6 (interleukin 6), ESR1 (estrogen receptor 1) and EGFR (epidermal growth factor receptor). These genes are promising candidate genes that can serve as useful diagnostic biomarkers and therapeutic targets. Our approach represents a novel strategy for prioritizing disease susceptibility genes. PMID:26840308

  13. Prioritization of Susceptibility Genes for Ectopic Pregnancy by Gene Network Analysis.

    PubMed

    Liu, Ji-Long; Zhao, Miao

    2016-01-01

    Ectopic pregnancy is a very dangerous complication of pregnancy, affecting 1%-2% of all reported pregnancies. Due to ethical constraints on human biopsies and the lack of suitable animal models, there has been little success in identifying functionally important genes in the pathogenesis of ectopic pregnancy. In the present study, we developed a random walk-based computational method named TM-rank to prioritize ectopic pregnancy-related genes based on text mining data and gene network information. Using a defined threshold value, we identified five top-ranked genes: VEGFA (vascular endothelial growth factor A), IL8 (interleukin 8), IL6 (interleukin 6), ESR1 (estrogen receptor 1) and EGFR (epidermal growth factor receptor). These genes are promising candidate genes that can serve as useful diagnostic biomarkers and therapeutic targets. Our approach represents a novel strategy for prioritizing disease susceptibility genes. PMID:26840308

  14. Discovering the hidden sub-network component in a ranked list of genes or proteins derived from genomic experiments.

    PubMed

    García-Alonso, Luz; Alonso, Roberto; Vidal, Enrique; Amadoz, Alicia; de María, Alejandro; Minguez, Pablo; Medina, Ignacio; Dopazo, Joaquín

    2012-11-01

    Genomic experiments (e.g. differential gene expression, single-nucleotide polymorphism association) typically produce ranked list of genes. We present a simple but powerful approach which uses protein-protein interaction data to detect sub-networks within such ranked lists of genes or proteins. We performed an exhaustive study of network parameters that allowed us concluding that the average number of components and the average number of nodes per component are the parameters that best discriminate between real and random networks. A novel aspect that increases the efficiency of this strategy in finding sub-networks is that, in addition to direct connections, also connections mediated by intermediate nodes are considered to build up the sub-networks. The possibility of using of such intermediate nodes makes this approach more robust to noise. It also overcomes some limitations intrinsic to experimental designs based on differential expression, in which some nodes are invariant across conditions. The proposed approach can also be used for candidate disease-gene prioritization. Here, we demonstrate the usefulness of the approach by means of several case examples that include a differential expression analysis in Fanconi Anemia, a genome-wide association study of bipolar disorder and a genome-scale study of essentiality in cancer genes. An efficient and easy-to-use web interface (available at http://www.babelomics.org) based on HTML5 technologies is also provided to run the algorithm and represent the network. PMID:22844098

  15. Toxic Diatom Aldehydes Affect Defence Gene Networks in Sea Urchins.

    PubMed

    Varrella, Stefano; Romano, Giovanna; Costantini, Susan; Ruocco, Nadia; Ianora, Adrianna; Bentley, Matt G; Costantini, Maria

    2016-01-01

    Marine organisms possess a series of cellular strategies to counteract the negative effects of toxic compounds, including the massive reorganization of gene expression networks. Here we report the modulated dose-dependent response of activated genes by diatom polyunsaturated aldehydes (PUAs) in the sea urchin Paracentrotus lividus. PUAs are secondary metabolites deriving from the oxidation of fatty acids, inducing deleterious effects on the reproduction and development of planktonic and benthic organisms that feed on these unicellular algae and with anti-cancer activity. Our previous results showed that PUAs target several genes, implicated in different functional processes in this sea urchin. Using interactomic Ingenuity Pathway Analysis we now show that the genes targeted by PUAs are correlated with four HUB genes, NF-κB, p53, δ-2-catenin and HIF1A, which have not been previously reported for P. lividus. We propose a working model describing hypothetical pathways potentially involved in toxic aldehyde stress response in sea urchins. This represents the first report on gene networks affected by PUAs, opening new perspectives in understanding the cellular mechanisms underlying the response of benthic organisms to diatom exposure. PMID:26914213

  16. Toxic Diatom Aldehydes Affect Defence Gene Networks in Sea Urchins

    PubMed Central

    Varrella, Stefano; Ruocco, Nadia; Ianora, Adrianna; Bentley, Matt G.; Costantini, Maria

    2016-01-01

    Marine organisms possess a series of cellular strategies to counteract the negative effects of toxic compounds, including the massive reorganization of gene expression networks. Here we report the modulated dose-dependent response of activated genes by diatom polyunsaturated aldehydes (PUAs) in the sea urchin Paracentrotus lividus. PUAs are secondary metabolites deriving from the oxidation of fatty acids, inducing deleterious effects on the reproduction and development of planktonic and benthic organisms that feed on these unicellular algae and with anti-cancer activity. Our previous results showed that PUAs target several genes, implicated in different functional processes in this sea urchin. Using interactomic Ingenuity Pathway Analysis we now show that the genes targeted by PUAs are correlated with four HUB genes, NF-κB, p53, δ-2-catenin and HIF1A, which have not been previously reported for P. lividus. We propose a working model describing hypothetical pathways potentially involved in toxic aldehyde stress response in sea urchins. This represents the first report on gene networks affected by PUAs, opening new perspectives in understanding the cellular mechanisms underlying the response of benthic organisms to diatom exposure. PMID:26914213

  17. How difficult is inference of mammalian causal gene regulatory networks?

    PubMed

    Djordjevic, Djordje; Yang, Andrian; Zadoorian, Armella; Rungrugeecharoen, Kevin; Ho, Joshua W K

    2014-01-01

    Gene regulatory networks (GRNs) play a central role in systems biology, especially in the study of mammalian organ development. One key question remains largely unanswered: Is it possible to infer mammalian causal GRNs using observable gene co-expression patterns alone? We assembled two mouse GRN datasets (embryonic tooth and heart) and matching microarray gene expression profiles to systematically investigate the difficulties of mammalian causal GRN inference. The GRNs were assembled based on > 2,000 pieces of experimental genetic perturbation evidence from manually reading > 150 primary research articles. Each piece of perturbation evidence records the qualitative change of the expression of one gene following knock-down or over-expression of another gene. Our data have thorough annotation of tissue types and embryonic stages, as well as the type of regulation (activation, inhibition and no effect), which uniquely allows us to estimate both sensitivity and specificity of the inference of tissue specific causal GRN edges. Using these unprecedented datasets, we found that gene co-expression does not reliably distinguish true positive from false positive interactions, making inference of GRN in mammalian development very difficult. Nonetheless, if we have expression profiling data from genetic or molecular perturbation experiments, such as gene knock-out or signalling stimulation, it is possible to use the set of differentially expressed genes to recover causal regulatory relationships with good sensitivity and specificity. Our result supports the importance of using perturbation experimental data in causal network reconstruction. Furthermore, we showed that causal gene regulatory relationship can be highly cell type or developmental stage specific, suggesting the importance of employing expression profiles from homogeneous cell populations. This study provides essential datasets and empirical evidence to guide the development of new GRN inference methods for

  18. Using a hybrid approach to optimize experimental network design for aquifer parameter identification.

    PubMed

    Chang, Liang-Cheng; Chu, Hone-Jay; Lin, Yu-Pin; Chen, Yu-Wen

    2010-10-01

    This research develops an optimum design model of groundwater network using genetic algorithm (GA) and modified Newton approach, based on the experimental design conception. The goal of experiment design is to minimize parameter uncertainty, represented by the covariance matrix determinant of estimated parameters. The design problem is constrained by a specified cost and solved by GA and a parameter identification model. The latter estimates optimum parameter value and its associated sensitivity matrices. The general problem is simplified into two classes of network design problems: an observation network design problem and a pumping network design problem. Results explore the relationship between the experimental design and the physical processes. The proposed model provides an alternative to solve optimization problems for groundwater experimental design. PMID:19757116

  19. Translational cross talk in gene networks.

    PubMed

    Mather, William H; Hasty, Jeff; Tsimring, Lev S; Williams, Ruth J

    2013-06-01

    It has been shown experimentally that competition for limited translational resources by upstream mRNAs can lead to an anticorrelation between protein counts. Here, we investigate a stochastic model for this phenomenon, in which gene transcripts of different types compete for a finite pool of ribosomes. Throughout, we utilize concepts from the theory of multiclass queues to describe a qualitative shift in protein count statistics as the system transitions from being underloaded (ribosomes exceed transcripts in number) to being overloaded (transcripts exceed ribosomes in number). The exact analytical solution of a simplified stochastic model, in which the numbers of competing mRNAs and ribosomes are fixed, exhibits weak positive correlations between steady-state protein counts when total transcript count slightly exceeds ribosome count, whereas the solution can exhibit strong negative correlations when total transcript count significantly exceeds ribosome count. Extending this analysis, we find approximate but reasonably accurate solutions for a more realistic model, in which abundances of mRNAs and ribosomes are allowed to fluctuate randomly. Here, ribosomal fluctuations contribute positively and mRNA fluctuations contribute negatively to correlations, and when mRNA fluctuations dominate ribosomal fluctuations, a strong anticorrelation extremum reliably occurs near the transition from the underloaded to the overloaded regime. PMID:23746529

  20. Motif for controllable toggle switch in gene regulatory networks

    NASA Astrophysics Data System (ADS)

    Zhao, Chen; Bin, Ao; Ye, Weiming; Fan, Ying; Di, Zengru

    2015-02-01

    Toggle switch as a common phenomenon in gene regulatory networks has been recognized important for biological functions. Despite much effort dedicated to understanding the toggle switch and designing synthetic biology circuit to achieve the biological function, we still lack a comprehensive understanding of the intrinsic dynamics behind such phenomenon and the minimum structure that is imperative for producing toggle switch. In this paper, we discover a minimum structure, a motif that enables a controllable toggle switch. In particular, the motif consists of a transformative double negative feedback loop (DNFL) that is regulated by an additional driver node. By enumerating all possible regulatory configurations from the driver node, we identify two types of motifs associated with the toggle switch that is captured by the existence of bistable states. The toggle switch is controllable in the sense that the gap between the bistable states is adjustable as determined by the regulatory strength from the driver nodes. We test the effect of the motifs in self-oscillating gene regulatory network (SON) with respect to the interplay between the motifs and the other genes, and find that the switching dynamics of the whole network can be successfully controlled insofar as the network contains a single motif. Our findings are important to uncover the underlying nonlinear dynamics of controllable toggle switch and can have implications in devising biology circuit in the field of synthetic biology.

  1. Vitamin D and gene networks in human osteoblasts

    PubMed Central

    van de Peppel, Jeroen; van Leeuwen, Johannes P. T. M.

    2014-01-01

    Bone formation is indirectly influenced by 1,25-dihydroxyvitamin D3 (1,25D3) through the stimulation of calcium uptake in the intestine and re-absorption in the kidneys. Direct effects on osteoblasts and bone formation have also been established. The vitamin D receptor (VDR) is expressed in osteoblasts and 1,25D3 modifies gene expression of various osteoblast differentiation and mineralization-related genes, such as alkaline phosphatase (ALPL), osteocalcin (BGLAP), and osteopontin (SPP1). 1,25D3 is known to stimulate mineralization of human osteoblasts in vitro, and recently it was shown that 1,25D3 induces mineralization via effects in the period preceding mineralization during the pre-mineralization period. For a full understanding of the action of 1,25D3 in osteoblasts it is important to get an integrated network view of the 1,25D3-regulated genes during osteoblast differentiation and mineralization. The current data will be presented and discussed alluding to future studies to fully delineate the 1,25D3 action in osteoblast. Describing and understanding the vitamin D regulatory networks and identifying the dominant players in these networks may help develop novel (personalized) vitamin D-based treatments. The following topics will be discussed in this overview: (1) Bone metabolism and osteoblasts, (2) Vitamin D, bone metabolism and osteoblast function, (3) Vitamin D induced transcriptional networks in the context of osteoblast differentiation and bone formation. PMID:24782782

  2. Establishing the Architecture of Plant Gene Regulatory Networks.

    PubMed

    Yang, F; Ouma, W Z; Li, W; Doseff, A I; Grotewold, E

    2016-01-01

    Gene regulatory grids (GRGs) encompass the space of all the possible transcription factor (TF)-target gene interactions that regulate gene expression, with gene regulatory networks (GRNs) representing a temporal and spatial manifestation of a portion of the GRG, essential for the specification of gene expression. Thus, understanding GRG architecture provides a valuable tool to explain how genes are expressed in an organism, an important aspect of synthetic biology and essential toward the development of the "in silico" cell. Progress has been made in some unicellular model systems (eg, yeast), but significant challenges remain in more complex multicellular organisms such as plants. Key to understanding the organization of GRGs is therefore identifying the genes that TFs bind to, and control. The application of sensitive and high-throughput methods to investigate genome-wide TF-target gene interactions is providing a wealth of information that can be linked to important agronomic traits. We describe here the methods and resources that have been developed to investigate the architecture of plant GRGs and GRNs. We also provide information regarding where to obtain clones or other resources necessary for synthetic biology or metabolic engineering. PMID:27480690

  3. Learning a Markov Logic network for supervised gene regulatory network inference

    PubMed Central

    2013-01-01

    Background Gene regulatory network inference remains a challenging problem in systems biology despite the numerous approaches that have been proposed. When substantial knowledge on a gene regulatory network is already available, supervised network inference is appropriate. Such a method builds a binary classifier able to assign a class (Regulation/No regulation) to an ordered pair of genes. Once learnt, the pairwise classifier can be used to predict new regulations. In this work, we explore the framework of Markov Logic Networks (MLN) that combine features of probabilistic graphical models with the expressivity of first-order logic rules. Results We propose to learn a Markov Logic network, e.g. a set of weighted rules that conclude on the predicate “regulates”, starting from a known gene regulatory network involved in the switch proliferation/differentiation of keratinocyte cells, a set of experimental transcriptomic data and various descriptions of genes all encoded into first-order logic. As training data are unbalanced, we use asymmetric bagging to learn a set of MLNs. The prediction of a new regulation can then be obtained by averaging predictions of individual MLNs. As a side contribution, we propose three in silico tests to assess the performance of any pairwise classifier in various network inference tasks on real datasets. A first test consists of measuring the average performance on balanced edge prediction problem; a second one deals with the ability of the classifier, once enhanced by asymmetric bagging, to update a given network. Finally our main result concerns a third test that measures the ability of the method to predict regulations with a new set of genes. As expected, MLN, when provided with only numerical discretized gene expression data, does not perform as well as a pairwise SVM in terms of AUPR. However, when a more complete description of gene properties is provided by heterogeneous sources, MLN achieves the same performance as a black

  4. The values of the parameters of some multilayer distributed RC null networks

    NASA Technical Reports Server (NTRS)

    Huelsman, L. P.; Raghunath, S.

    1974-01-01

    In this correspondence, the values of the parameters of some multilayer distributed RC notch networks are determined, and the usually accepted values are shown to be in error. The magnitude of the error is illustrated by graphs of the frequency response of the networks.

  5. Evolutionary Signatures amongst Disease Genes Permit Novel Methods for Gene Prioritization and Construction of Informative Gene-Based Networks

    PubMed Central

    Priedigkeit, Nolan; Wolfe, Nicholas; Clark, Nathan L.

    2015-01-01

    Genes involved in the same function tend to have similar evolutionary histories, in that their rates of evolution covary over time. This coevolutionary signature, termed Evolutionary Rate Covariation (ERC), is calculated using only gene sequences from a set of closely related species and has demonstrated potential as a computational tool for inferring functional relationships between genes. To further define applications of ERC, we first established that roughly 55% of genetic diseases posses an ERC signature between their contributing genes. At a false discovery rate of 5% we report 40 such diseases including cancers, developmental disorders and mitochondrial diseases. Given these coevolutionary signatures between disease genes, we then assessed ERC's ability to prioritize known disease genes out of a list of unrelated candidates. We found that in the presence of an ERC signature, the true disease gene is effectively prioritized to the top 6% of candidates on average. We then apply this strategy to a melanoma-associated region on chromosome 1 and identify MCL1 as a potential causative gene. Furthermore, to gain global insight into disease mechanisms, we used ERC to predict molecular connections between 310 nominally distinct diseases. The resulting “disease map” network associates several diseases with related pathogenic mechanisms and unveils many novel relationships between clinically distinct diseases, such as between Hirschsprung's disease and melanoma. Taken together, these results demonstrate the utility of molecular evolution as a gene discovery platform and show that evolutionary signatures can be used to build informative gene-based networks. PMID:25679399

  6. A Unifying Mathematical Framework for Genetic Robustness, Environmental Robustness, Network Robustness and their Trade-offs on Phenotype Robustness in Biological Networks. Part III: Synthetic Gene Networks in Synthetic Biology.

    PubMed

    Chen, Bor-Sen; Lin, Ying-Po

    2013-01-01

    Robust stabilization and environmental disturbance attenuation are ubiquitous systematic properties that are observed in biological systems at many different levels. The underlying principles for robust stabilization and environmental disturbance attenuation are universal to both complex biological systems and sophisticated engineering systems. In many biological networks, network robustness should be large enough to confer: intrinsic robustness for tolerating intrinsic parameter fluctuations; genetic robustness for buffering genetic variations; and environmental robustness for resisting environmental disturbances. Network robustness is needed so phenotype stability of biological network can be maintained, guaranteeing phenotype robustness. Synthetic biology is foreseen to have important applications in biotechnology and medicine; it is expected to contribute significantly to a better understanding of functioning of complex biological systems. This paper presents a unifying mathematical framework for investigating the principles of both robust stabilization and environmental disturbance attenuation for synthetic gene networks in synthetic biology. Further, from the unifying mathematical framework, we found that the phenotype robustness criterion for synthetic gene networks is the following: if intrinsic robustness + genetic robustness + environmental robustness ≦ network robustness, then the phenotype robustness can be maintained in spite of intrinsic parameter fluctuations, genetic variations, and environmental disturbances. Therefore, the trade-offs between intrinsic robustness, genetic robustness, environmental robustness, and network robustness in synthetic biology can also be investigated through corresponding phenotype robustness criteria from the systematic point of view. Finally, a robust synthetic design that involves network evolution algorithms with desired behavior under intrinsic parameter fluctuations, genetic variations, and environmental

  7. A Unifying Mathematical Framework for Genetic Robustness, Environmental Robustness, Network Robustness and their Trade-offs on Phenotype Robustness in Biological Networks. Part III: Synthetic Gene Networks in Synthetic Biology

    PubMed Central

    Chen, Bor-Sen; Lin, Ying-Po

    2013-01-01

    Robust stabilization and environmental disturbance attenuation are ubiquitous systematic properties that are observed in biological systems at many different levels. The underlying principles for robust stabilization and environmental disturbance attenuation are universal to both complex biological systems and sophisticated engineering systems. In many biological networks, network robustness should be large enough to confer: intrinsic robustness for tolerating intrinsic parameter fluctuations; genetic robustness for buffering genetic variations; and environmental robustness for resisting environmental disturbances. Network robustness is needed so phenotype stability of biological network can be maintained, guaranteeing phenotype robustness. Synthetic biology is foreseen to have important applications in biotechnology and medicine; it is expected to contribute significantly to a better understanding of functioning of complex biological systems. This paper presents a unifying mathematical framework for investigating the principles of both robust stabilization and environmental disturbance attenuation for synthetic gene networks in synthetic biology. Further, from the unifying mathematical framework, we found that the phenotype robustness criterion for synthetic gene networks is the following: if intrinsic robustness + genetic robustness + environmental robustness ≦ network robustness, then the phenotype robustness can be maintained in spite of intrinsic parameter fluctuations, genetic variations, and environmental disturbances. Therefore, the trade-offs between intrinsic robustness, genetic robustness, environmental robustness, and network robustness in synthetic biology can also be investigated through corresponding phenotype robustness criteria from the systematic point of view. Finally, a robust synthetic design that involves network evolution algorithms with desired behavior under intrinsic parameter fluctuations, genetic variations, and environmental

  8. An Arabidopsis Gene Regulatory Network for Secondary Cell Wall Synthesis

    PubMed Central

    Taylor-Teeples, M; Lin, L; de Lucas, M; Turco, G; Toal, TW; Gaudinier, A; Young, NF; Trabucco, GM; Veling, MT; Lamothe, R; Handakumbura, PP; Xiong, G; Wang, C; Corwin, J; Tsoukalas, A; Zhang, L; Ware, D; Pauly, M; Kliebenstein, DJ; Dehesh, K; Tagkopoulos, I; Breton, G; Pruneda-Paz, JL; Ahnert, SE; Kay, SA; Hazen, SP; Brady, SM

    2014-01-01

    Summary The plant cell wall is an important factor for determining cell shape, function and response to the environment. Secondary cell walls, such as those found in xylem, are composed of cellulose, hemicelluloses and lignin and account for the bulk of plant biomass. The coordination between transcriptional regulation of synthesis for each polymer is complex and vital to cell function. A regulatory hierarchy of developmental switches has been proposed, although the full complement of regulators remains unknown. Here, we present a protein-DNA network between Arabidopsis transcription factors and secondary cell wall metabolic genes with gene expression regulated by a series of feed-forward loops. This model allowed us to develop and validate new hypotheses about secondary wall gene regulation under abiotic stress. Distinct stresses are able to perturb targeted genes to potentially promote functional adaptation. These interactions will serve as a foundation for understanding the regulation of a complex, integral plant component. PMID:25533953

  9. Modifier Genes and the Plasticity of Genetic Networks in Mice

    PubMed Central

    Hamilton, Bruce A.; Yu, Benjamin D.

    2012-01-01

    Modifier genes are an integral part of the genetic landscape in both humans and experimental organisms, but have been less well explored in mammals than other systems. A growing number of modifier genes in mouse models of disease nonetheless illustrate the potential for novel findings, while new technical advances promise many more to come. Modifier genes in mouse models include induced mutations and spontaneous or wild-derived variations captured in inbred strains. Identification of modifiers among wild-derived variants in particular should detect disease modifiers that have been shaped by selection and might therefore be compatible with high fitness and function. Here we review selected examples and argue that modifier genes derived from natural variation may provide a bias for nodes in genetic networks that have greater intrinsic plasticity and whose therapeutic manipulation may therefore be more resilient to side effects than conventional targets. PMID:22511884

  10. Systems biology and gene networks in neurodevelopmental and neurodegenerative disorders

    PubMed Central

    Parikshak, Neelroop N.; Gandal, Michael J.; Geschwind, Daniel H.

    2015-01-01

    Genetic and genomic approaches have implicated hundreds of genetic loci in neurodevelopmental disorders and neurodegeneration, but mechanistic understanding continues to lag behind the pace of gene discovery. Understanding the role of specific genetic variants in the brain involves dissecting a functional hierarchy that encompasses molecular pathways, diverse cell types, neural circuits and, ultimately, cognition and behaviour. With a focus on transcriptomics, this Review discusses how high-throughput molecular, integrative and network approaches inform disease biology by placing human genetics in a molecular systems and neurobiological context. We provide a framework for interpreting network biology studies and leveraging big genomics data sets in neurobiology. PMID:26149713