Structure Of Gene Regulatory Networks Research Articles

Structure of regulatory networks and diversity of gene expression patterns

Complexity of gene regulatory network has been considered to be responsible for diversity of cells. Different types of cells, characterized by the expression patterns of genes, are produced in early development through the dynamics of gene activities based on the regulatory network. However, very little is known about relationship between the structure of regulatory networks and the dynamics of gene activities. In this paper, I introduce new idea of “steady-state compatibility” by which the diversity of possible gene activities can be determined from the topological structure of gene regulatory networks. The basic premise is very simple: the activity of a gene should be a function of the controlling genes. Thus, a gene should always show unique expression activity if the activities of the controlling genes are unique. Based on this, the maximum possible diversity of steady states is determined using only information regarding regulatory linkages without knowing the regulatory functions of genes. By extending this idea, some general properties were derived. For example, multiple loop structures in regulatory networks are necessary for increasing the diversity of gene activity. On the other hand, connected multiple loops sharing the same genes do not increase the diversity. The method was applied to a gene regulatory network responsible for early development in a sea urchin species. A set of important genes responsible for generating diversities of gene activities was derived based on the concept of compatibility of steady states.

Effects of coupling strength and space on the dynamics of coupled toggle switches in stochastic gene networks with multiple-delayed reactions

Genetic toggle switches (TSs) are one of the best studied small gene regulatory networks (GRNs), due to their simplicity and relevant role. They have been interpreted as decision circuits in cell differentiation, a process long hypothesized to be bistable, or as cellular memory units. In these contexts, they must be reliable. Once a "decision" is made, the system must remain stable. One way to gain stability is by duplicating the genes of a TS and coupling the two TSs. Using a recent modeling strategy of GRNs, driven by a delayed stochastic simulation algorithm (delayed SSA) that allows modeling transcription and translation as multidelayed reactions, we analyze the stability of systems of coupled TSs. For this, we introduce the coupling strength (C), a parameter to characterize the GRN structure, against which we compare the GRN stability (S). We first show that time delays in transcription, associated to the promoter region release, ensure bistability of a TS, given no cooperative binding or self-activation reactions. Next, we couple two TSs and measure their toggling frequencies as C varies. Three dynamical regimes are observed: (i) for weak coupling, high frequency synchronized oscillations, (ii) for average coupling, low frequency synchronized oscillations, and (iii) for strong coupling the system becomes stable after a transient, in one of two steady states. The system stability, S, goes through a first order phase transition as C increases, in the average coupling regime. After, we study the effects of spatial separation in two compartments on the dynamics of two coupled TSs, where spatial separation is modeled as normally distributed random time delayed reactions. The phase transition of S, as C increases, occurs for lower values of C than when the two TSs are in the same compartment. Finally, we couple weakly and homogeneously several TSs within a single compartment and observe that as the number of coupled TSs increases, the system goes through the phase transition in S, from oscillatory to stable and for C values lower than in the two previous cases.

AN EFFECTIVE DATA MINING TECHNIQUE FOR RECONSTRUCTING GENE REGULATORY NETWORKS FROM TIME SERIES EXPRESSION DATA

Recent development in DNA microarray technologies has made the reconstruction of gene regulatory networks (GRNs) feasible. To infer the overall structure of a GRN, there is a need to find out how the expression of each gene can be affected by the others. Many existing approaches to reconstructing GRNs are developed to generate hypotheses about the presence or absence of interactions between genes so that laboratory experiments can be performed afterwards for verification. Since, they are not intended to be used to predict if a gene in an unseen sample has any interactions with other genes, statistical verification of the reliability of the discovered interactions can be difficult. Furthermore, since the temporal ordering of the data is not taken into consideration, the directionality of regulation cannot be established using these existing techniques. To tackle these problems, we propose a data mining technique here. This technique makes use of a probabilistic inference approach to uncover interesting dependency relationships in noisy, high-dimensional time series expression data. It is not only able to determine if a gene is dependent on another but also whether or not it is activated or inhibited. In addition, it can predict how a gene would be affected by other genes even in unseen samples. For performance evaluation, the proposed technique has been tested with real expression data. Experimental results show that it can be very effective. The discovered dependency relationships can reveal gene regulatory relationships that could be used to infer the structures of GRNs.

Factor analysis for gene regulatory networks and transcription factor activity profiles.

BackgroundMost existing algorithms for the inference of the structure of gene regulatory networks from gene expression data assume that the activity levels of transcription factors (TFs) are proportional to their mRNA levels. This assumption is invalid for most biological systems. However, one might be able to reconstruct unobserved activity profiles of TFs from the expression profiles of target genes. A simple model is a two-layer network with unobserved TF variables in the first layer and observed gene expression variables in the second layer. TFs are connected to regulated genes by weighted edges. The weights, known as factor loadings, indicate the strength and direction of regulation. Of particular interest are methods that produce sparse networks, networks with few edges, since it is known that most genes are regulated by only a small number of TFs, and most TFs regulate only a small number of genes.ResultsIn this paper, we explore the performance of five factor analysis algorithms, Bayesian as well as classical, on problems with biological context using both simulated and real data. Factor analysis (FA) models are used in order to describe a larger number of observed variables by a smaller number of unobserved variables, the factors, whereby all correlation between observed variables is explained by common factors. Bayesian FA methods allow one to infer sparse networks by enforcing sparsity through priors. In contrast, in the classical FA, matrix rotation methods are used to enforce sparsity and thus to increase the interpretability of the inferred factor loadings matrix. However, we also show that Bayesian FA models that do not impose sparsity through the priors can still be used for the reconstruction of a gene regulatory network if applied in conjunction with matrix rotation methods. Finally, we show the added advantage of merging the information derived from all algorithms in order to obtain a combined result.ConclusionMost of the algorithms tested are successful in reconstructing the connectivity structure as well as the TF profiles. Moreover, we demonstrate that if the underlying network is sparse it is still possible to reconstruct hidden activity profiles of TFs to some degree without prior connectivity information.

Reconstructing gene-regulatory networks from time series, knock-out data, and prior knowledge

BackgroundCellular processes are controlled by gene-regulatory networks. Several computational methods are currently used to learn the structure of gene-regulatory networks from data. This study focusses on time series gene expression and gene knock-out data in order to identify the underlying network structure. We compare the performance of different network reconstruction methods using synthetic data generated from an ensemble of reference networks. Data requirements as well as optimal experiments for the reconstruction of gene-regulatory networks are investigated. Additionally, the impact of prior knowledge on network reconstruction as well as the effect of unobserved cellular processes is studied.ResultsWe identify linear Gaussian dynamic Bayesian networks and variable selection based on F-statistics as suitable methods for the reconstruction of gene-regulatory networks from time series data. Commonly used discrete dynamic Bayesian networks perform inferior and this result can be attributed to the inevitable information loss by discretization of expression data. It is shown that short time series generated under transcription factor knock-out are optimal experiments in order to reveal the structure of gene regulatory networks. Relative to the level of observational noise, we give estimates for the required amount of gene expression data in order to accurately reconstruct gene-regulatory networks. The benefit of using of prior knowledge within a Bayesian learning framework is found to be limited to conditions of small gene expression data size. Unobserved processes, like protein-protein interactions, induce dependencies between gene expression levels similar to direct transcriptional regulation. We show that these dependencies cannot be distinguished from transcription factor mediated gene regulation on the basis of gene expression data alone.ConclusionCurrently available data size and data quality make the reconstruction of gene networks from gene expression data a challenge. In this study, we identify an optimal type of experiment, requirements on the gene expression data quality and size as well as appropriate reconstruction methods in order to reverse engineer gene regulatory networks from time series data.

Designing Gene Regulatory Networks With Specified Functions

To design and construct gene regulatory networks with specified functions, such as gene switches or gene oscillators, a precise mathematical description of the networks and their properties are developed from the viewpoint of integrated systems biology. The theoretical results provide insights into the modular structures of gene regulatory networks and their quantitative functions. Specifically, based on priori knowledge of the structure of functional modules, we use feedback system to create gene regulatory networks performing basic tasks. Two typical biological networks: positive and cyclic feedback networks are used to create functions as bistable switches or oscillators. The hybrid feedback networks are adopted to provide a variety of functional designs, which demonstrate the crucial role of interactions between biological modules

From specific gene regulation to genomic networks: a global analysis of transcriptional regulation in Escherichia coli

Because a large number of molecular mechanisms involved in gene regulation have been described during the last decades, it is now becoming possible to address questions about the global structure of gene regulatory networks, at least in the case of some of the best-characterized organisms. This paper presents a global characterization of the transcriptional regulation in Escherichia coli on the basis of the current data. The connectivity of the corresponding network was evaluated by analyzing the distribution of the number of genes regulated by a given regulatory protein, and the distribution of the number of regulatory genes regulating a given regulated gene. The mean connectivity found (between 2 and 3) shows a rather loosely interconnected structure. Special emphasis is given to circular sequences of interactions ("circuits") because of their critical dynamical properties. Only one-element circuits were found, in which negative autoregulation is the dominant architecture. These global properties are discussed in light of several pertinent theoretical approaches, as well as in terms of physiological and evolutionary considerations.