Identification of genetic networks

In this report, we propose the use of structural equations as a tool for identifying and modeling genetic networks and genetic algorithms for searching the most likely genetic networks that best fit the data. After genetic networks are identified, it is fundamental to identify those networks influencing cell phenotypes. To accomplish this task we extend the concept of differential expression of the genes, widely used in gene expression data analysis, to genetic networks. We propose a definition for the differential expression of a genetic network and use the generalized T2 statistic to measure the ability of genetic networks to distinguish different phenotypes. However, describing the differential expression of genetic networks is not enough for understanding biological systems because differences in the expression of genetic networks do not directly reflect regulatory strength between gene activities. Therefore, in this report we also introduce the concept of differentially regulated genetic networks, which has the potential to assess changes of gene regulation in response to perturbation in the environment and may provide new insights into the mechanism of diseases and biological processes. We propose five novel statistics to measure the differences in regulation of genetic networks. To illustrate the concepts and methods for reconstruction of genetic networks and identification of association of genetic networks with function, we applied the proposed models and algorithms to three data sets.     

Identification of small scale biochemical networks based on general type system perturbations

New technologies enable acquisition of large data-sets containing genomic, proteomic and metabolic information that describe the state of a cell. These data-sets call for systematic methods enabling relevant information about the inner workings of the cell to be extracted. One important issue at hand is the understanding of the functional interactions between genes, proteins and metabolites. We here present a method for identifying the dynamic interactions between biochemical components within the cell, in the vicinity of a steady-state. Key features of the proposed method are that it can deal with data obtained under perturbations of any system parameter, not only concentrations of specific components, and that the direct effect of the perturbations does not need to be known. This is important as concentration perturbations are often difficult to perform in biochemical systems and the specific effects of general type perturbations are usually highly uncertain, or unknown. The basis of the method is a linear least-squares estimation, using time-series measurements of concentrations and expression profiles, in which system states and parameter perturbations are estimated simultaneously. An important side-effect of also employing estimation of the parameter perturbations is that knowledge of the system's steady-state concentrations, or activities, is not required and that deviations from steady-state prior to the perturbation can be dealt with. Time derivatives are computed using a zero-order hold discretization, shown to yield significant improvements over the widely used Euler approximation. We also show how network interactions with dynamics that are too fast to be captured within the available sampling time can be determined and excluded from the network identification. Known and unknown moiety conservation relationships can be processed in the same manner. The method requires that the number of samples equals at least the number of network components and, hence, is at present restricted to relatively small-scale networks. We demonstrate herein the performance of the method on two small-scale in silico genetic networks.     

Reverse engineering of biochemical equations from time-course data by means of genetic programming

Increased research aimed at simulating biological systems requires sophisticated parameter estimation methods. All current approaches, including genetic algorithms, need pre-existing equations to be functional. A generalized approach to predict not only parameters but also biochemical equations from only observable time-course information must be developed and a computational method to generate arbitrary equations without knowledge of biochemical reaction mechanisms must be developed. We present a technique to predict an equation using genetic programming. Our technique can search topology and numerical parameters of mathematical expression simultaneously. To improve the search ability of numeric constants, we added numeric mutation to the conventional procedure. As case studies, we predicted two equations of enzyme-catalyzed reactions regarding adenylate kinase and phosphofructokinase. Our numerical experimental results showed that our approach could obtain correct topology and parameters that were close to the originals. The mean errors between given and simulation-predicted time-courses were 1.6 x 10(-5)% and 2.0 x 10(-3)%, respectively. Our equation prediction approach can be applied to identify metabolic reactions from observable time-courses.     

Adapting genetic regulatory models by genetic programming

In this paper, we focus on the task of adapting genetic regulatory models based on gene expression data from microarrays. Our approach aims at automatic revision of qualitative regulatory models to improve their fit to expression data. We describe a type of regulatory model designed for this purpose, a method for predicting the quality of such models, and a method for adapting the models by means of genetic programming. We also report experimental results highlighting the ability of the methods to infer models on a number of artificial data sets. In closing, we contrast our results with those of alternative methods, after which we give some suggestions for future work.     

Automatic compilation from high-level biologically-oriented programming language to genetic regulatory networks

Background

The field of synthetic biology promises to revolutionize our ability to engineer biological systems, providing important benefits for a variety of applications. Recent advances in DNA synthesis and automated DNA assembly technologies suggest that it is now possible to construct synthetic systems of significant complexity. However, while a variety of novel genetic devices and small engineered gene networks have been successfully demonstrated, the regulatory complexity of synthetic systems that have been reported recently has somewhat plateaued due to a variety of factors, including the complexity of biology itself and the lag in our ability to design and optimize sophisticated biological circuitry.

Methodology/Principal Findings

To address the gap between DNA synthesis and circuit design capabilities, we present a platform that enables synthetic biologists to express desired behavior using a convenient high-level biologically-oriented programming language, Proto. The high level specification is compiled, using a regulatory motif based mechanism, to a gene network, optimized, and then converted to a computational simulation for numerical verification. Through several example programs we illustrate the automated process of biological system design with our platform, and show that our compiler optimizations can yield significant reductions in the number of genes () and latency of the optimized engineered gene networks.

Conclusions/Significance

Our platform provides a convenient and accessible tool for the automated design of sophisticated synthetic biological systems, bridging an important gap between DNA synthesis and circuit design capabilities. Our platform is user-friendly and features biologically relevant compiler optimizations, providing an important foundation for the development of sophisticated biological systems.     

Alignment of molecular networks by integer quadratic programming

MOTIVATION: With more and more data on molecular networks (e.g. protein interaction networks, gene regulatory networks and metabolic networks) available, the discovery of conserved patterns or signaling pathways by comparing various kinds of networks among different species or within a species becomes an increasingly important problem. However, most of the conventional approaches either restrict comparative analysis to special structures, such as pathways, or adopt heuristic algorithms due to computational burden. RESULTS: In this article, to find the conserved substructures, we develop an efficient algorithm for aligning molecular networks based on both molecule similarity and architecture similarity, by using integer quadratic programming (IQP). Such an IQP can be relaxed into the corresponding quadratic programming (QP) which almost always ensures an integer solution, thereby making molecular network alignment tractable without any approximation. The proposed framework is very flexible and can be applied to many kinds of molecular networks including weighted and unweighted, directed and undirected networks with or without loops. AVAILABILITY: Matlab code and data are available from http://zhangroup.aporc.org/bioinfo/MNAligner or http://intelligent.eic.osaka-sandai.ac.jp/chenen/software/MNAligner, or upon request from authors. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.     

Discovery of Boolean metabolic networks: integer linear programming based approach

Background

Traditional drug discovery methods focused on the efficacy of drugs rather than their toxicity. However, toxicity and/or lack of efficacy are produced when unintended targets are affected in metabolic networks. Thus, identification of biological targets which can be manipulated to produce the desired effect with minimum side-effects has become an important and challenging topic. Efficient computational methods are required to identify the drug targets while incurring minimal side-effects.

Results

In this paper, we propose a graph-based computational damage model that summarizes the impact of enzymes on compounds in metabolic networks. An efficient method based on Integer Linear Programming formalism is then developed to identify the optimal enzyme-combination so as to minimize the side-effects. The identified target enzymes for known successful drugs are then verified by comparing the results with those in the existing literature.

Conclusions

Side-effects reduction plays a crucial role in the study of drug development. A graph-based computational damage model is proposed and the theoretical analysis states the captured problem is NP-completeness. The proposed approaches can therefore contribute to the discovery of drug targets. Our developed software is available at “http://hkumath.hku.hk/~wkc/APBC2018-metabolic-network.zip”.

     

Modularization of biochemical networks based on classification of Petri net t-invariants

Background  

Structural analysis of biochemical networks is a growing field in bioinformatics and systems biology. The availability of an increasing amount of biological data from molecular biological networks promises a deeper understanding but confronts researchers with the problem of combinatorial explosion. The amount of qualitative network data is growing much faster than the amount of quantitative data, such as enzyme kinetics. In many cases it is even impossible to measure quantitative data because of limitations of experimental methods, or for ethical reasons. Thus, a huge amount of qualitative data, such as interaction data, is available, but it was not sufficiently used for modeling purposes, until now. New approaches have been developed, but the complexity of data often limits the application of many of the methods. Biochemical Petri nets make it possible to explore static and dynamic qualitative system properties. One Petri net approach is model validation based on the computation of the system's invariant properties, focusing on t-invariants. T-invariants correspond to subnetworks, which describe the basic system behavior.     

Identification of biochemical network modules based on shortest retroactive distances

Modularity analysis offers a route to better understand the organization of cellular biochemical networks as well as to derive practically useful, simplified models of these complex systems. While there is general agreement regarding the qualitative properties of a biochemical module, there is no clear consensus on the quantitative criteria that may be used to systematically derive these modules. In this work, we investigate cyclical interactions as the defining characteristic of a biochemical module. We utilize a round trip distance metric, termed Shortest Retroactive Distance (ShReD), to characterize the retroactive connectivity between any two reactions in a biochemical network and to group together network components that mutually influence each other. We evaluate the metric on two types of networks that feature feedback interactions: (i) epidermal growth factor receptor (EGFR) signaling and (ii) liver metabolism supporting drug transformation. For both networks, the ShReD partitions found hierarchically arranged modules that confirm biological intuition. In addition, the partitions also revealed modules that are less intuitive. In particular, ShReD-based partition of the metabolic network identified a 'redox' module that couples reactions of glucose, pyruvate, lipid and drug metabolism through shared production and consumption of NADPH. Our results suggest that retroactive interactions arising from feedback loops and metabolic cycles significantly contribute to the modularity of biochemical networks. For metabolic networks, cofactors play an important role as allosteric effectors that mediate the retroactive interactions.     

Steady-state analysis of genetic regulatory networks modelled by probabilistic boolean networks

Probabilistic Boolean networks (PBNs) have recently been introduced as a promising class of models of genetic regulatory networks. The dynamic behaviour of PBNs can be analysed in the context of Markov chains. A key goal is the determination of the steady-state (long-run) behaviour of a PBN by analysing the corresponding Markov chain. This allows one to compute the long-term influence of a gene on another gene or determine the long-term joint probabilistic behaviour of a few selected genes. Because matrix-based methods quickly become prohibitive for large sizes of networks, we propose the use of Monte Carlo methods. However, the rate of convergence to the stationary distribution becomes a central issue. We discuss several approaches for determining the number of iterations necessary to achieve convergence of the Markov chain corresponding to a PBN. Using a recently introduced method based on the theory of two-state Markov chains, we illustrate the approach on a sub-network designed from human glioma gene expression data and determine the joint steadystate probabilities for several groups of genes.     

Quantitative modeling of biochemical networks

Today different database systems for molecular structures (genes and proteins) and metabolic pathways are available. All these systems are characterized by the static data representation. For progress in biotechnology the dynamic representation of this data is important. The metabolism can be characterized as a complex biochemical network. Different models for the quantitative simulation of biochemical networks are discussed, but no useful formalization is available. This paper shows that the theory of Petrinets is useful for the quantitative modeling of biochemical networks.     

On construction of stochastic genetic networks based on gene expression sequences

Reconstruction of genetic regulatory networks from time series data of gene expression patterns is an important research topic in bioinformatics. Probabilistic Boolean Networks (PBNs) have been proposed as an effective model for gene regulatory networks. PBNs are able to cope with uncertainty, corporate rule-based dependencies between genes and discover the sensitivity of genes in their interactions with other genes. However, PBNs are unlikely to use directly in practice because of huge amount of computational cost for obtaining predictors and their corresponding probabilities. In this paper, we propose a multivariate Markov model for approximating PBNs and describing the dynamics of a genetic network for gene expression sequences. The main contribution of the new model is to preserve the strength of PBNs and reduce the complexity of the networks. The number of parameters of our proposed model is O(n2) where n is the number of genes involved. We also develop efficient estimation methods for solving the model parameters. Numerical examples on synthetic data sets and practical yeast data sequences are given to demonstrate the effectiveness of the proposed model.     

Redesigning metabolic networks using mathematical programming

The design of new generation bioprocessing plants is increasingly dependent on the design of process-compatible microorganisms. The latter, whether through genetic or physiological manipulations, can be greatly assisted by metabolic engineering. An emerging powerful tool in metabolic engineering research is computer-assisted cell design using mathematical programming. In this work, the problem of optimizing cellular metabolic networks has been formulated as a Mixed Integer Nonlinear Programming (MINLP) model. The model can assist genetic engineers to identify which cellular enzymes should be modified, and the new levels of activity required to produce an optimal network. Results are presented from the tricarboxylic acid cycle in Dictyostelium discoideum. Copyright 1998 John Wiley & Sons, Inc.     

Associative learning in biochemical networks

It has been recently suggested that there are likely generic features characterizing the emergence of systems constructed from the self-organization of self-replicating agents acting under one or more selection pressures. Therefore, structures and behaviors at one length scale may be used to infer analogous structures and behaviors at other length scales. Motivated by this suggestion, we seek to characterize various "animate" behaviors in biochemical networks, and the influence that these behaviors have on genomic evolution. Specifically, in this paper, we develop a simple, chemostat-based model illustrating how a process analogous to associative learning can occur in a biochemical network. Associative learning is a form of learning whereby a system "learns" to associate two stimuli with one another. Associative learning, also known as conditioning, is believed to be a powerful learning process at work in the brain (associative learning is essentially "learning by analogy"). In our model, two types of replicating molecules, denoted as A and B, are present in some initial concentration in the chemostat. Molecules A and B are stimulated to replicate by some growth factors, denoted as G(A) and G(B), respectively. It is also assumed that A and B can covalently link, and that the conjugated molecule can be stimulated by either the G(A) or G(B) growth factors (and can be degraded). We show that, if the chemostat is stimulated by both growth factors for a certain time, followed by a time gap during which the chemostat is not stimulated at all, and if the chemostat is then stimulated again by only one of the growth factors, then there will be a transient increase in the number of molecules activated by the other growth factor. Therefore, the chemostat bears the imprint of earlier, simultaneous stimulation with both growth factors, which is indicative of associative learning. It is interesting to note that the dynamics of our model is consistent with certain aspects of Pavlov's original series of conditioning experiments in dogs. We discuss how associative learning can potentially be performed in vitro within RNA, DNA, or peptide networks. We also describe how such a mechanism could be involved in genomic evolution, and suggest relevant bioinformatics studies that could potentially resolve these issues.     

Monotone and near-monotone biochemical networks

Monotone subsystems have appealing properties as components of larger networks, since they exhibit robust dynamical stability and predictability of responses to perturbations. This suggests that natural biological systems may have evolved to be, if not monotone, at least close to monotone in the sense of being decomposable into a “small” number of monotone components, In addition, recent research has shown that much insight can be attained from decomposing networks into monotone subsystems and the analysis of the resulting interconnections using tools from control theory. This paper provides an expository introduction to monotone systems and their interconnections, describing the basic concepts and some of the main mathematical results in a largely informal fashion. Supported in part by NSF Grants DMS-0504557 and DMS-0614371.     

Optimal identification of biochemical reaction networks

Advances in biotechnology and computer science are providing the possibility to construct mathematical models for complex biological networks and systematically understand their properties. Traditional network identification approaches, however, cannot accurately recover the model parameters from the noisy laboratory measurements. This article introduces the concept of optimal identification (OI), which utilizes a global inversion algorithm to extract the full distribution of parameters consistent with the laboratory data. In addition, OI integrates suitable computational algorithms with experimental capabilities in a closed loop fashion to maximally reduce the breadth of the extracted parameter distribution. The closed loop OI procedure seeks out the optimal set of control chemical fluxes and data observations that actively filter out experimental noise and enhance the sensitivity to the desired parameters. In this fashion, the highest quality network parameters can be attained from inverting the tailored laboratory data. The operation of OI is illustrated by identifying a simulated tRNA proofreading mechanism, in which OI provides superior solutions for all the rate constants compared with suboptimal and nonoptimal methods.