Results 1  10
of
58
Modeling and simulation of genetic regulatory systems: A literature review
 Journal of Computational Biology
, 2002
"... In order to understand the functioning of organisms on the molecular level, we need to know which genes are expressed, when and where in the organism, and to which extent. The regulation of gene expression is achieved through genetic regulatory systems structured by networks of interactions between ..."
Abstract

Cited by 415 (9 self)
 Add to MetaCart
In order to understand the functioning of organisms on the molecular level, we need to know which genes are expressed, when and where in the organism, and to which extent. The regulation of gene expression is achieved through genetic regulatory systems structured by networks of interactions between DNA, RNA, proteins, and small molecules. As most genetic regulatory networks of interest involve many components connected through interlocking positive and negative feedback loops, an intuitive understanding of their dynamics is hard to obtain. As a consequence, formal methods and computer tools for the modeling and simulation of genetic regulatory networks will be indispensable. This paper reviews formalisms that have been employed in mathematical biology and bioinformatics to describe genetic regulatory systems, in particular directed graphs, Bayesian networks, Boolean networks and their generalizations, ordinary and partial differential equations, qualitative differential equations, stochastic equations, and rulebased formalisms. In addition, the paper discusses how these formalisms have been used in the simulation of the behavior of actual regulatory systems. Key words: genetic regulatory networks, mathematical modeling, simulation, computational biology.
Genetic Network Inference: From CoExpression Clustering To Reverse Engineering
, 2000
"... motivation: Advances in molecular biological, analytical and computational technologies are enabling us to systematically investigate the complex molecular processes underlying biological systems. In particular, using highthroughput gene expression assays, we are able to measure the output of the ge ..."
Abstract

Cited by 210 (0 self)
 Add to MetaCart
motivation: Advances in molecular biological, analytical and computational technologies are enabling us to systematically investigate the complex molecular processes underlying biological systems. In particular, using highthroughput gene expression assays, we are able to measure the output of the gene regulatory network. We aim here to review datamining and modeling approaches for conceptualizing and unraveling the functional relationships implicit in these datasets. Clustering of coexpression profiles allows us to infer shared regulatory inputs and functional pathways. We discuss various aspects of clustering, ranging from distance measures to clustering algorithms and multiplecluster memberships. More advanced analysis aims to infer causal connections between genes directly, i.e. who is regulating whom and how. We discuss several approaches to the problem of reverse engineering of genetic networks, from discrete Boolean networks, to continuous linear and nonlinear models. We conclude that the combination of predictive modeling with systematic experimental verification will be required to gain a deeper insight into living organisms, therapeutic targeting and bioengineering.
IDENTIFICATION OF GENETIC NETWORKS FROM A SMALL NUMBER OF GENE EXPRESSION PATTERNS UNDER THE BOOLEAN NETWORK MODEL
 PACIFIC SYMPOSIUM ON BIOCOMPUTING 4:1728 (1999)
, 1999
"... ... for inferring genetic network architectures from state transition tables which correspond to time series of gene expression patterns, using the Boolean network model. Their results of computational experiments suggested that a small number of state transition (INPUT/OUTPUT) pairs are sufficient ..."
Abstract

Cited by 181 (16 self)
 Add to MetaCart
... for inferring genetic network architectures from state transition tables which correspond to time series of gene expression patterns, using the Boolean network model. Their results of computational experiments suggested that a small number of state transition (INPUT/OUTPUT) pairs are sufficient in order to infer the original Boolean network correctly. This paper gives a mathematical proof for their observation. Precisely, this paper devises a much simpler algorithm for the same problem and proves that, if the indegree of each node (i.e., the number of input nodes to each node) is bounded by a constant, only O(log n) state transition pairs (from 2n pairs) are necessary and sufficient to identify the original Boolean network of n nodes correctly with high probability. We made computational experiments in order to expose the constant factor involved in O(log n) notation. The computational results show that the Boolean network of size 100,000 can be identified by our algorithm from about 100 INPUT/OUTPUT pairs if the maximum indegree is bounded by 2. It is also a merit of our algorithm that the algorithm is conceptually so simple that it is extensible for more realistic network models.
Modelling gene expression data using dynamic bayesian networks
, 1999
"... Recently, there has been much interest in reverse engineering genetic networks from time series data. In this paper, we show that most of the proposed discrete time models — including the boolean network model [Kau93, SS96], the linear model of D’haeseleer et al. [DWFS99], and the nonlinear model of ..."
Abstract

Cited by 157 (1 self)
 Add to MetaCart
Recently, there has been much interest in reverse engineering genetic networks from time series data. In this paper, we show that most of the proposed discrete time models — including the boolean network model [Kau93, SS96], the linear model of D’haeseleer et al. [DWFS99], and the nonlinear model of Weaver et al. [WWS99] — are all special cases of a general class of models called Dynamic Bayesian Networks (DBNs). The advantages of DBNs include the ability to model stochasticity, to incorporate prior knowledge, and to handle hidden variables and missing data in a principled way. This paper provides a review of techniques for learning DBNs. Keywords: Genetic networks, boolean networks, Bayesian networks, neural networks, reverse engineering, machine learning. 1
Metabolomics: the link between genotypes and phenotypes
 Plant Molecular Biology
"... Metabolites are the end products of cellular regulatory processes, and their levels can be regarded as the ultimate response of biological systems to genetic or environmental changes. In parallel to the terms ‘transcriptome ’ and ‘proteome’, the set of metabolites synthesized by a biological system ..."
Abstract

Cited by 85 (8 self)
 Add to MetaCart
Metabolites are the end products of cellular regulatory processes, and their levels can be regarded as the ultimate response of biological systems to genetic or environmental changes. In parallel to the terms ‘transcriptome ’ and ‘proteome’, the set of metabolites synthesized by a biological system constitute its ‘metabolome’. Yet, unlike other functional genomics approaches, the unbiased simultaneous identification and quantification of plant metabolomes has been largely neglected. Until recently, most analyses were restricted to profiling selected classes of compounds, or to fingerprinting metabolic changes without sufficient analytical resolution to determine metabolite levels and identities individually. As a prerequisite for metabolomic analysis, careful consideration of the methods employed for tissue extraction, sample preparation, data acquisition, and data mining must be taken. In this review, the differences among metabolite target analysis, metabolite profiling, and metabolic fingerprinting are clarified, and terms are defined. Current approaches are examined, and potential applications are summarized with a special emphasis on data mining and mathematical modelling of metabolism.
Computational Methods for the Identification of Differential and Coordinated Gene Expression
 Human Molecular Genetics
, 1999
"... this article, I review the theoretical and computational approaches used to: (i) identify genes differentially expressed (across cell types, developmental stages, pathological conditions, etc.); (ii) identify genes expressed in a coordinated manner across a set of conditions; and (iii) delineate clu ..."
Abstract

Cited by 45 (0 self)
 Add to MetaCart
this article, I review the theoretical and computational approaches used to: (i) identify genes differentially expressed (across cell types, developmental stages, pathological conditions, etc.); (ii) identify genes expressed in a coordinated manner across a set of conditions; and (iii) delineate clusters of genes sharing coherent expression features, eventually defining global biological pathways
Modeling Tcell activation using gene expression profiling and state space modeling
 Bioinformatics
, 2004
"... Motivation: We have used statespace models to reverse engineer transcriptional networks from highly replicated gene expression profiling time series data obtained from a wellestablished model of Tcell activation. State space models are a class of dynamic Bayesian networks that assume that the obse ..."
Abstract

Cited by 45 (2 self)
 Add to MetaCart
Motivation: We have used statespace models to reverse engineer transcriptional networks from highly replicated gene expression profiling time series data obtained from a wellestablished model of Tcell activation. State space models are a class of dynamic Bayesian networks that assume that the observed measurements depend on some hidden state variables that evolve according to Markovian dynamics.These hidden variables can capture effects that cannot be measured in a gene expression profiling experiment, e.g. genes that have not been included in the microarray, levels of regulatory proteins, the effects of messenger RNA and protein degradation, etc. Results: Bootstrap confidence intervals are developed for parameters representing ‘gene–gene ’ interactions over time. Our models represent the dynamics of Tcell activation and provide a methodology for the development of rational and experimentally testable hypotheses. Availability: Supplementary data and Matlab computer source code will be made available on the web at the URL given below.
Evaluating functional network inference using simulations of complex biological systems V.
, 2002
"... Motivation: Although many network inference algorithms have been presented in the bioinformatics literature, no suitable approach has been formulated for evaluating their effectiveness at recovering models of complex biological systems from limited data. To overcome this limitation, we propose an ap ..."
Abstract

Cited by 38 (1 self)
 Add to MetaCart
Motivation: Although many network inference algorithms have been presented in the bioinformatics literature, no suitable approach has been formulated for evaluating their effectiveness at recovering models of complex biological systems from limited data. To overcome this limitation, we propose an approach to evaluate network inference algorithms according to their ability to recover a complex functional network from biologically reasonable simulated data.
Automating genetic network inference with minimal physical experimentation using coevolution
 In Proceedings of The 2004 Genetic and Evolutionary Computation Conference
, 2004
"... Abstract. A major challenge in system biology is the automatic inference of gene regulation network topology—an instance of reverse engineering—based on limited local data whose collection is costly and slow. Reverse engineering implies the reconstruction of a hidden system based only on input and o ..."
Abstract

Cited by 22 (13 self)
 Add to MetaCart
Abstract. A major challenge in system biology is the automatic inference of gene regulation network topology—an instance of reverse engineering—based on limited local data whose collection is costly and slow. Reverse engineering implies the reconstruction of a hidden system based only on input and output data sets generated by the target system. Here we present a generalized evolutionary algorithm that can reverse engineer a hidden network based solely on input supplied to the network and the output obtained, using a minimal number of tests of the physical system. The algorithm has two stages: the first stage evolves a system hypothesis, and the second stage evolves a new experiment that should be carried out on the target system in order to extract the most information. We present the general algorithm, which we call the estimationexploration algorithm, and demonstrate it both for the inference of gene regulatory networks without the need to perform expensive and disruptive knockout studies, and the inference of morphological properties of a robot without extensive physical testing. 1
Reverse Engineering And Automatic Synthesis Of Metabolic Pathways From Observed Data Using Genetic Programming
 Paci Symposium on Biocomputing , 6
, 2001
"... This paper demonstrates that it is possible to automatically create (reverse engineer) a network of chemical reactions from observed timedomain data. Genetic programming starts with observed timedomain concentrations of input substances and automatically creates both the topology of the networ ..."
Abstract

Cited by 20 (4 self)
 Add to MetaCart
This paper demonstrates that it is possible to automatically create (reverse engineer) a network of chemical reactions from observed timedomain data. Genetic programming starts with observed timedomain concentrations of input substances and automatically creates both the topology of the network of chemical reactions and the rates of each reaction within the network such that the concentration of the final product of the automatically created network matches the observed timedomain data. This paper describes how genetic programming automatically created a metabolic pathway involving four chemical reactions that takes in glycerol and fatty acid as input, uses ATP as a cofactor, and produces diacylglycerol as its final product. In addition, this paper describes how genetic programming similarly created a metabolic pathway involving three chemical reactions for the synthesis and degradation of ketone bodies. Both automatically created metabolic pathways contain at least one instance of three noteworthy topological features, namely an internal feedback loop, a bifurcation point where one substance is distributed to two different reactions, and an accumulation point where one substance is accumulated from two sources