Reverse engineering: the architecture of biological networks

We adopt a control theory approach to reverse engineer the complexity of a known system--the bacterial heat shock response. Using a computational dynamic model, we explore the organization of the heat shock system and elucidate its various regulation strategies. We show that these strategies are behind much of the complexity of the network. We propose that complexity is a necessary outcome of robustness and performance requirements that are achieved by the heat shock system's exquisite regulation modules. The techniques we use rely on dynamic computational models and principles from the field of control theory.     

Reverse engineering of metabolic networks, a critical assessment

Inferring metabolic networks from metabolite concentration data is a central topic in systems biology. Mathematical techniques to extract information about the network from data have been proposed in the literature. This paper presents a critical assessment of the feasibility of reverse engineering of metabolic networks, illustrated with a selection of methods. Appropriate data are simulated to study the performance of four representative methods. An overview of sampling and measurement methods currently in use for generating time-resolved metabolomics data is given and contrasted with the needs of the discussed reverse engineering methods. The results of this assessment show that if full inference of a real-world metabolic network is the goal there is a large discrepancy between the requirements of reverse engineering of metabolic networks and contemporary measurement practice. Recommendations for improved time-resolved experimental designs are given.     

Reverse engineering and analysis of large genome-scale gene networks

Reverse engineering the whole-genome networks of complex multicellular organisms continues to remain a challenge. While simpler models easily scale to large number of genes and gene expression datasets, more accurate models are compute intensive limiting their scale of applicability. To enable fast and accurate reconstruction of large networks, we developed Tool for Inferring Network of Genes (TINGe), a parallel mutual information (MI)-based program. The novel features of our approach include: (i) B-spline-based formulation for linear-time computation of MI, (ii) a novel algorithm for direct permutation testing and (iii) development of parallel algorithms to reduce run-time and facilitate construction of large networks. We assess the quality of our method by comparison with ARACNe (Algorithm for the Reconstruction of Accurate Cellular Networks) and GeneNet and demonstrate its unique capability by reverse engineering the whole-genome network of Arabidopsis thaliana from 3137 Affymetrix ATH1 GeneChips in just 9 min on a 1024-core cluster. We further report on the development of a new software Gene Network Analyzer (GeNA) for extracting context-specific subnetworks from a given set of seed genes. Using TINGe and GeNA, we performed analysis of 241 Arabidopsis AraCyc 8.0 pathways, and the results are made available through the web.     

Modular engineering of cellular signaling proteins and networks

Living cells respond to their environment using networks of signaling molecules that act as sensors, information processors, and actuators. These signaling systems are highly modular at both the molecular and network scales, and much evidence suggests that evolution has harnessed this modularity to rewire and generate new physiological behaviors. Conversely, we are now finding that, following nature's example, signaling modules can be recombined to form synthetic tools for monitoring, interrogating, and controlling the behavior of cells. Here we highlight recent progress in the modular design of synthetic receptors, optogenetic switches, and phospho-regulated proteins and circuits, and discuss the expanding role of combinatorial design in the engineering of cellular signaling proteins and networks.     

Reverse engineering large-scale genetic networks: synthetic versus real data

Development of microarray technology has resulted in an exponential rise in gene expression data. Linear computational methods are of great assistance in identifying molecular interactions, and elucidating the functional properties of gene networks. It overcomes the weaknesses of in vivo experiments including high cost, large noise, and unrepeatable process. In this paper, we propose an easily applied system, Stepwise Network Inference (SWNI), which integrates deterministic linear model with statistical analysis, and has been tested effectively on both simulated experiments and real gene expression data sets. The study illustrates that connections of gene networks can be significantly detected via SWNI with high confidence, when single gene perturbation experiments are performed complying with the algorithm requirements. In particular, our algorithm shows efficiency and outperforms the existing ones presented in this paper when dealing with large-scale sparse networks without any prior knowledge.     

Reverse engineering gene regulatory networks from measurement with missing values

Background

Gene expression time series data are usually in the form of high-dimensional arrays. Unfortunately, the data may sometimes contain missing values: for either the expression values of some genes at some time points or the entire expression values of a single time point or some sets of consecutive time points. This significantly affects the performance of many algorithms for gene expression analysis that take as an input, the complete matrix of gene expression measurement. For instance, previous works have shown that gene regulatory interactions can be estimated from the complete matrix of gene expression measurement. Yet, till date, few algorithms have been proposed for the inference of gene regulatory network from gene expression data with missing values.

Results

We describe a nonlinear dynamic stochastic model for the evolution of gene expression. The model captures the structural, dynamical, and the nonlinear natures of the underlying biomolecular systems. We present point-based Gaussian approximation (PBGA) filters for joint state and parameter estimation of the system with one-step or two-step missing measurements. The PBGA filters use Gaussian approximation and various quadrature rules, such as the unscented transform (UT), the third-degree cubature rule and the central difference rule for computing the related posteriors. The proposed algorithm is evaluated with satisfying results for synthetic networks, in silico networks released as a part of the DREAM project, and the real biological network, the in vivo reverse engineering and modeling assessment (IRMA) network of yeast Saccharomyces cerevisiae.

Conclusion

PBGA filters are proposed to elucidate the underlying gene regulatory network (GRN) from time series gene expression data that contain missing values. In our state-space model, we proposed a measurement model that incorporates the effect of the missing data points into the sequential algorithm. This approach produces a better inference of the model parameters and hence, more accurate prediction of the underlying GRN compared to when using the conventional Gaussian approximation (GA) filters ignoring the missing data points.

     

Reverse engineering of gene regulatory networks: a finite state linear model

We propose a new model for describing gene regulatory networks that can capture discrete (Boolean) and continuous (differential) aspects of gene regulation. After giving some illustrations of the model, we study the problem of the reverse engineering of such networks, i.e., how to construct a network from gene expression data. We prove that for our model there exists an algorithm finding a network compatible with the given data. We demonstrate the model by simulating lambda-phage. We also describe some generalizations of the model, discuss their relevance to the real-world gene networks and formulate a number of open problems.     

TimeDelay-ARACNE: Reverse engineering of gene networks from time-course data by an information theoretic approach

Background  

One of main aims of Molecular Biology is the gain of knowledge about how molecular components interact each other and to understand gene function regulations. Using microarray technology, it is possible to extract measurements of thousands of genes into a single analysis step having a picture of the cell gene expression. Several methods have been developed to infer gene networks from steady-state data, much less literature is produced about time-course data, so the development of algorithms to infer gene networks from time-series measurements is a current challenge into bioinformatics research area. In order to detect dependencies between genes at different time delays, we propose an approach to infer gene regulatory networks from time-series measurements starting from a well known algorithm based on information theory.     

Reverse engineering and analysis of genome-wide gene regulatory networks from gene expression profiles using high-performance computing

Regulation of gene expression is a carefully regulated phenomenon in the cell. “Reverse-engineering” algorithms try to reconstruct the regulatory interactions among genes from genome-scale measurements of gene expression profiles (microarrays). Mammalian cells express tens of thousands of genes; hence, hundreds of gene expression profiles are necessary in order to have acceptable statistical evidence of interactions between genes. As the number of profiles to be analyzed increases, so do computational costs and memory requirements. In this work, we designed and developed a parallel computing algorithm to reverse-engineer genome-scale gene regulatory networks from thousands of gene expression profiles. The algorithm is based on computing pairwise Mutual Information between each gene-pair. We successfully tested it to reverse engineer the Mus Musculus (mouse) gene regulatory network in liver from gene expression profiles collected from a public repository. A parallel hierarchical clustering algorithm was implemented to discover “communities” within the gene network. Network communities are enriched for genes involved in the same biological functions. The inferred network was used to identify two mitochondrial proteins.     

Reverse engineering of regulatory networks: simulation studies on a genetic algorithm approach for ranking hypotheses

Reverse engineering algorithms (REAs) aim at using gene expression data to reconstruct interactions in regulatory genetic networks. This may help to understand the basis of gene regulation, the core task of functional genomics. Collecting data for a number of environmental conditions is necessary to reengineer even the smallest regulatory networks with reasonable confidence. We systematically tested the requirements for the experimental design necessary for ranking alternative hypotheses about the structure of a given regulatory network. A genetic algorithm (GA) was used to explore the parameter space of a multistage discrete genetic network model with fixed connectivity and number of states per node. Our results show that it is not necessary to determine all parameters of the genetic network in order to rank hypotheses. The ranking process is easier the more experimental environmental conditions are used for the data set. During the ranking, the number of fixed parameters increases with the number of environmental conditions, while some errors in the hypothetical network structure may pass undetected, due to a maintained dynamical behaviour.     

Reverse engineering the lordosis behavior circuit

Reverse engineering takes the facts we know about a device or a process and reasons backwards to infer the principles underlying the structure-function relations. The goal of this review is to apply this approach to a well-studied hormone-controlled behavior, namely the reproductive stance of female rodents, lordosis. We first provide a brief overview on the considerable amount of progress in the analysis of female reproductive behavior. Then, we propose an analysis of the mechanisms of this behavior from a reverse-engineering perspective with the goal of generating novel hypotheses about the properties of the circuitry elements. In particular, the previously proposed neuronal circuit modules, feedback signals, and genomic mechanisms are considered to make predictions in this manner. The lordosis behavior itself appears to proceed ballistically once initiated, but negative and positive hormonal feedback relations are evident in its endocrine controls. Both rapid membrane-initiated and slow genomic hormone effects contribute to the behavior's control. We propose that the value of the reverse-engineering approach is based on its ability to provide testable, mechanistic hypotheses that do not emerge from either traditional evolutionary or simple reductionistic perspectives, and several are proposed in this review. These novel hypotheses may generalize to brain functions beyond female reproductive behavior. In this way, the reverse-engineering perspective can further develop our conceptual frameworks for behavioral and systems neuroscience.     

Programming and engineering biological networks

Synthetic biology aims to build new functions in living organisms. Recent work has addressed the creation of synthetic epigenetic switches in mammalian cells and synthetic intracellular communication. Fundamentally new, and potentially scaleable, modes of gene regulation have been created that enable expansion of the scope of synthetic circuits. Increasingly sophisticated models of gene regulation that include stochastic effects are beginning to predict the behaviour of small synthetic networks. Overall, these advances suggest that a combination of molecular engineering and systems engineering should allow the creation of living matter capable of performing many useful and novel functions.     

Reverse engineering: A model for T-cell vaccination

A class of minimal models is constructed that can exhibit several salient phenomena associated with T-cell inoculations that prevent and cure autoimmune disease. The models consist of differential equations for the magnitude of two populations, the effectorsE (which cause the disease), and an interacting regulator populationR. In these models, normality, vaccination and disease are identified with stable steady-states of the differential equations. Thereby accommodated by the models are a variety of findings such as the induction of vaccination or disease, depending on the size of the effector inoculant. Features such as spontaneous acquisition of disease and spontaneous cure require that the models be expanded to permit slow variation of their coefficients and hence slow shifts in the number of steady-states. Other extensions of the basic models permit them to be relevant to vaccination by killed cells or by antigen, or to the interaction of a larger number of cell types. The discussion includes an indication of how the highly simplified approach taken here can serve as a first step in a modeling program that takes increasing cognizance of relevant aspects of known immunological physiology. Even at its present stage, the theory leads to several suggestions for experiments.