22,430 research outputs found
Nonparametric Bayesian inference for perturbed and orthologous gene regulatory networks
Motivation: The generation of time series transcriptomic datasets collected under multiple experimental conditions has proven to be a powerful approach for disentangling complex biological processes, allowing for the reverse engineering of gene regulatory networks (GRNs). Most methods for reverse engineering GRNs from multiple datasets assume that each of the time series were generated from networks with identical topology. In this study, we outline a hierarchical, non-parametric Bayesian approach for reverse engineering GRNs using multiple time series that can be applied in a number of novel situations including: (i) where different, but overlapping sets of transcription factors are expected to bind in the different experimental conditions; that is, where switching events could potentially arise under the different treatments and (ii) for inference in evolutionary related species in which orthologous GRNs exist. More generally, the method can be used to identify context-specific regulation by leveraging time series gene expression data alongside methods that can identify putative lists of transcription factors or transcription factor targets.
Results: The hierarchical inference outperforms related (but non-hierarchical) approaches when the networks used to generate the data were identical, and performs comparably even when the networks used to generate data were independent. The method was subsequently used alongside yeast one hybrid and microarray time series data to infer potential transcriptional switches in Arabidopsis thaliana response to stress. The results confirm previous biological studies and allow for additional insights into gene regulation under various abiotic stresses.
Availability: The methods outlined in this article have been implemented in Matlab and are available on request
Reverse engineering of genetic networks with time delayed recurrent neural networks and clustering techniques
In the iterative process of experimentally probing biological networks and computationally inferring models for the networks, fast, accurate and flexible computational frameworks are needed for modeling and reverse engineering biological networks. In this dissertation, I propose a novel model to simulate gene regulatory networks using a specific type of time delayed recurrent neural networks. Also, I introduce a parameter clustering method to select groups of parameter sets from the simulations representing biologically reasonable networks. Additionally, a general purpose adaptive function is used here to decrease and study the connectivity of small gene regulatory networks modules. In this dissertation, the performance of this novel model is shown to simulate the dynamics and to infer the topology of gene regulatory networks derived from synthetic and experimental time series gene expression data. Here, I assess the quality of the inferred networks by the use of graph edit distance measurements in comparison to the synthetic and experimental benchmarks. Additionally, I compare between edition costs of the inferred networks obtained with the time delay recurrent networks and other previously described reverse engineering methods based on continuous time recurrent neural and dynamic Bayesian networks. Furthermore, I address questions of network connectivity and correlation between data fitting and inference power by simulating common experimental limitations of the reverse engineering process as incomplete and highly noisy data. The novel specific type of time delay recurrent neural networks model in combination with parameter clustering substantially improves the inference power of reverse engineered networks. Additionally, some suggestions for future improvements are discussed, particularly under the data driven perspective as the solution for modeling complex biological systems
Efficient reverse-engineering of a developmental gene regulatory network
This is the final version of the article. Available from the publisher via the DOI in this record.Understanding the complex regulatory networks underlying development and evolution of multi-cellular organisms is a major problem in biology. Computational models can be used as tools to extract the regulatory structure and dynamics of such networks from gene expression data. This approach is called reverse engineering. It has been successfully applied to many gene networks in various biological systems. However, to reconstitute the structure and non-linear dynamics of a developmental gene network in its spatial context remains a considerable challenge. Here, we address this challenge using a case study: the gap gene network involved in segment determination during early development of Drosophila melanogaster. A major problem for reverse-engineering pattern-forming networks is the significant amount of time and effort required to acquire and quantify spatial gene expression data. We have developed a simplified data processing pipeline that considerably increases the throughput of the method, but results in data of reduced accuracy compared to those previously used for gap gene network inference. We demonstrate that we can infer the correct network structure using our reduced data set, and investigate minimal data requirements for successful reverse engineering. Our results show that timing and position of expression domain boundaries are the crucial features for determining regulatory network structure from data, while it is less important to precisely measure expression levels. Based on this, we define minimal data requirements for gap gene network inference. Our results demonstrate the feasibility of reverse-engineering with much reduced experimental effort. This enables more widespread use of the method in different developmental contexts and organisms. Such systematic application of data-driven models to real-world networks has enormous potential. Only the quantitative investigation of a large number of developmental gene regulatory networks will allow us to discover whether there are rules or regularities governing development and evolution of complex multi-cellular organisms.Funding: The laboratory of Johannes Jaeger and this study in particular was funded by the MEC-EMBL agreement for the EMBL/CRG Research Unit in Systems
Biology, by Grant 153 (MOPDEV) of the ERANet: ComplexityNET program, by SGR Grant 406 from the Catalan funding agency AGAUR, by grant BFU2009-10184
from the Spanish Ministry of Science, and by European Commission grant FP7-KBBE-2011-5/289434 (BioPreDyn). The funders had no role in study design, data
collection and analysis, decision to publish, or preparation of the manuscript
Reconstruction of gene regulatory network of colon cancer using information theoretic approach
Reconstruction of gene regulatory networks or 'reverse-engineering' is a
process of identifying gene interaction networks from experimental microarray
gene expression profile through computation techniques. In this paper, we tried
to reconstruct cancer-specific gene regulatory network using information
theoretic approach - mutual information. The considered microarray data
consists of large number of genes with 20 samples - 12 samples from colon
cancer patient and 8 from normal cell. The data has been preprocessed and
normalized. A t-test statistics has been applied to filter differentially
expressed genes. The interaction between filtered genes has been computed using
mutual information and ten different networks has been constructed with varying
number of interactions ranging from 30 to 500. We performed the topological
analysis of the reconstructed network, revealing a large number of interactions
in colon cancer. Finally, validation of the inferred results has been done with
available biological databases and literature.Comment: 5 pages, 4 figures, 1 tabl
Generating Realistic In Silico Gene Networks for Performance Assessment of Reverse Engineering Methods
Reverse engineering methods are typically first tested on simulated data from in silico networks, for systematic and efficient performance assessment, before an application to real biological networks. In this paper we present a method for generating biologically plausible in silico networks, which allow realistic performance assessment of network inference algorithms. Instead of using random graph models, which are known to only partly capture the structural properties of biological networks, we generate network structures by extracting modules from known biological interaction networks. Using the yeast transcriptional regulatory network as a test case, we show that extracted modules have a biologically plausible connectivity because they preserve functional and structural properties of the original network. Our method was selected to generate the "gold standard" networks for the gene network reverse engineering challenge of the third DREAM conference (Dialogue on Reverse Engineering Assessment and Methods, Cambridge, MA, 2008)
Gene Regulatory Network Reconstruction Using Bayesian Networks, the Dantzig Selector, the Lasso and Their Meta-Analysis
Modern technologies and especially next generation sequencing facilities are giving a cheaper access to genotype and genomic data measured on the same sample at once. This creates an ideal situation for multifactorial experiments designed to infer gene regulatory networks. The fifth “Dialogue for Reverse Engineering Assessments and Methods” (DREAM5) challenges are aimed at assessing methods and associated algorithms devoted to the inference of biological networks. Challenge 3 on “Systems Genetics” proposed to infer causal gene regulatory networks from different genetical genomics data sets. We investigated a wide panel of methods ranging from Bayesian networks to penalised linear regressions to analyse such data, and proposed a simple yet very powerful meta-analysis, which combines these inference methods. We present results of the Challenge as well as more in-depth analysis of predicted networks in terms of structure and reliability. The developed meta-analysis was ranked first among the teams participating in Challenge 3A. It paves the way for future extensions of our inference method and more accurate gene network estimates in the context of genetical genomics
Comparison of evolutionary algorithms in gene regulatory network model inference
Background: The evolution of high throughput technologies that measure gene expression levels has created a
data base for inferring GRNs (a process also known as reverse engineering of GRNs). However, the nature of
these data has made this process very di±cult. At the moment, several methods of discovering qualitative
causal relationships between genes with high accuracy from microarray data exist, but large scale quantitative
analysis on real biological datasets cannot be performed, to date, as existing approaches are not suitable for real
microarray data which are noisy and insu±cient.
Results: This paper performs an analysis of several existing evolutionary algorithms for quantitative gene
regulatory network modelling. The aim is to present the techniques used and o®er a comprehensive comparison
of approaches, under a common framework. Algorithms are applied to both synthetic and real gene expression
data from DNA microarrays, and ability to reproduce biological behaviour, scalability and robustness to noise are assessed and compared.
Conclusions: Presented is a comparison framework for assessment of evolutionary algorithms, used to infer gene
regulatory networks. Promising methods are identi¯ed and a platform for development of appropriate model
formalisms is established
- …