Email updates

Keep up to date with the latest news and content from BMC Bioinformatics and BioMed Central.

This article is part of the supplement: Otto Warburg International Summer School and Workshop on Networks and Regulation

Open Access Highly Accessed Review

Current approaches to gene regulatory network modelling

Thomas Schlitt1 and Alvis Brazma2*

Author Affiliations

1 Department of Medical and Molecular Genetics, King's College London School of Medicine, 8th floor Guy's Tower, London SE1 9RT, UK

2 European Bioinformatics Institute, EMBL-EBI, Wellcome Trust Genome Campus, Cambridge CB10 1SD, UK

For all author emails, please log on.

BMC Bioinformatics 2007, 8(Suppl 6):S9  doi:10.1186/1471-2105-8-S6-S9

The electronic version of this article is the complete one and can be found online at:

Published:27 September 2007

© 2007 Schlitt and Brazma; licensee BioMed Central Ltd.

This is an open access article distributed under the terms of the Creative Commons Attribution License (, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Many different approaches have been developed to model and simulate gene regulatory networks. We proposed the following categories for gene regulatory network models: network parts lists, network topology models, network control logic models, and dynamic models. Here we will describe some examples for each of these categories. We will study the topology of gene regulatory networks in yeast in more detail, comparing a direct network derived from transcription factor binding data and an indirect network derived from genome-wide expression data in mutants. Regarding the network dynamics we briefly describe discrete and continuous approaches to network modelling, then describe a hybrid model called Finite State Linear Model and demonstrate that some simple network dynamics can be simulated in this model.


Most cellular processes involve many different molecules. The metabolism of a cell consists of many interlinked reactions. Products of one reaction will be educts of the next, thus forming the metabolic network. Similarly, signalling molecules are interlinked and cross-talk between the different signalling cascades forms the signalling network. And the same is true for regulatory relationships between genes and their products. All these networks are closely related, e.g. the regulatory network is influenced by extracellular signals. But there are characteristic features in the signalling network, which do not exist in the regulatory network; therefore dealing with these networks separately makes sense. Our main interest is in transcription regulation networks and we will refer to them as "gene networks", but many principles are valid for a wide range of networks. High-throughput technologies allow studying aspects of gene regulatory networks on a genome-wide scale and we will discuss recent advances as well as limitations and future challenges for gene network modelling. This survey is largely based on and is an extension of two previous publications [1,2].

Gene networks are concerned with the control of transcription, i.e. how genes are up and down regulated in response to signals. In the 1960's genetic and biochemical experiments demonstrated the presence of regulatory sequences in the proximity of genes and the existence of proteins that are able to bind to those elements and to control the activity of genes by either activation or repression of transcription. These regulatory proteins are themselves encoded by genes (Figure 1). This allows the formation of complex regulatory networks, including positive and negative feedback loops. These principles of gene regulation apply to prokaryotes (e.g. bacteria) as well as to eukaryotes (e.g. higher organisms). The control of gene activity is much more complex than Figure 1 suggests. It involves many kinds of proteins thus allowing additional levels of control particularly in eukaryotes. Transcription factors, the proteins that recognize the regulatory elements in the DNA (the binding sites) need to interact with other proteins in order to activate gene expression. In addition to control of gene expression there are regulatory controls to determine the maturation, transport and degradation of the mRNA, as well as its translation. Just to illustrate the complexity of gene regulation: Gene Ontology (GO), a controlled vocabulary used to describe protein functions contains currently over 7500 different terms describing biological process 'transcription', including over 6500 terms under process 'regulation of transcription' [3].

thumbnailFigure 1. Representation of a simple, fictional transcription factor network. All genes shown encode transcription factors that control the activity of genes encoding transcription factors.

Gene networks are often described verbally in combination with figures to illustrate sometimes-complicated interrelations between network elements. Due to the complexity of these networks, such models are not always easy to comprehend and they often leave a considerable amount to ambiguity to the reader's imagination. Since the 1960's methods from mathematics and physics have been used to describe and simulate small gene networks more stringently. Nowadays, molecular biological methods and high-throughput technologies make it possible to study a large number of genes and proteins in parallel enabling the study of larger gene networks. This allows tackling gene networks more efficiently and has led to a new discipline called Systems Biology, which seeks to combine methods from biology with methods from mathematics, physics and engineering to describe biological systems.

We proposed to categorize gene networks models in four classes according to increasing level of detail in the models [1]. Each class has its own advantages and limitations. The four classes are:

i. parts lists – a collection, description and systematisation of network elements in a particular organism or a particular biological system (e.g., transcription factors, promoters, and transcription factor binding sites);

ii. topology models – a description of the connections between the parts; this can be viewed as wiring diagrams where directed or undirected connections between genes represent different types of interactions;

iii. control logic models – a description of combinatorial (synergetic or interfering) effects of regulatory signals – e.g., which transcription factor combinations activate and which repress the transcription of the gene;

iv. dynamic models – the simulation of the real-time behaviour of the network and the prediction of its response to various environmental changes, external, or internal stimuli.

Obviously, for a fixed number of network elements each next level is more detailed and complex. But the size of the networks that we are able to model at each particular level is limited. Much larger networks can be described on topological level than on the dynamic level. In the following section we will discuss these classes in more detail.

Organisational levels of gene network models

"All models are wrong, but some are useful". – George E. P. Box

Parts list

Compiling the parts list is the first step in developing any model of some complexity and is not always a trivial exercise. Simple parts lists of genes, transcription factors, promoters, binding sites and other molecular entities are useful means for assessing the network complexity and for comparing different organisms. Such parts lists can be the result of a genome-sequencing and annotation project, where the complete DNA sequence of an organism is determined and all (or at least many) genes and proteins are identified. A parts list could also be represented as a database of regulatory elements or it could be ontology terms of transcription regulation processes assigned to a set of genes.

Comparing such lists from different organisms can provide an indication of the complexity of the transcriptional machinery or be used to predict the presence or absence of particular metabolic pathways [4-6]. The number of known and predicted transcriptional regulators in eukaryotic organisms varies from about 300 in yeast to about 1000 in humans (Table 1).

Table 1. Number of transcription regulators in different organisms

Many publications address the computational identification of transcription factor binding sites for instance by analysing promoter sequences of coexpressed genes [7]. One approach is to search for short sequences that are overrepresented in the promoters of a particular group of genes (e.g. clusters of coexpressed genes or sets of longer sequences known to bind a particular transcription factor) in comparison to the promoter sequences of all other genes. This approach obviously depends on the availability of the sequences for many genes and their upstream regions. Such an approach was applied in a cell cycle study in Schizosaccharomyces pombe, where Rustici et al. showed that the presence or absence of consensus binding sites in the promoter regions corresponds to the cyclic expression pattern of the genes [8]. Genes with a peak expression at similar cell cycle stage often share similar sets of consensus binding sites.

However, the exact promoter regions are usually unknown and even the transcription start sites are only known for a few genes. Baker's yeast (Saccharomoyces cerevisiae) has a relatively small genome with short intergenic regions, considering about 600–1000 bp upstream of the translation start site (ATG) appears to be a good approximation for the promoter regions. In higher organisms like vertebrates the intergenic regions and thus the putative promoter regions are much larger than in yeast, therefore the identification of regulatory elements in the DNA sequence by computational means has turned out to be rather elusive. Some studies have focused on the computational analysis of higher-level organisation of transcription factor binding sites in promoters, such as frequently occurring combinations of known binding sites [9,10], or restricted the search for regulatory elements to conserved sequence regions, identified by genome comparisons, a method often referred to as phylogenetic footprinting [11]. However, phylogenetic footprinting does not always work, because the localisation and the binding sites themselves are not always conserved [12,13].

Transcription factor localisations can be identified experimentally, too. For example, individual binding sites can be detected using the "DNAse I footprinting assay"; proteins bound to the DNA protect it from degradation by DNAse I, therefore these regions can be analysed further [14]. Another common experimental method is the "electrophoretic mobility shift assay" (EMSA) sometimes called "band shift assay" or "gel retardation assay" – DNA fragments that are bound by protein move slower in an electrophoretic gel than unbound fragments [15,16]. These methods allow fine mapping of individual binding sites, but are very labour intensive. High-throughput methods such as the Chip-on-chip method (see additional file 2, which describes this methods in more detail) allow the genome-wide detection of binding sites for a transcription factor, but the spatial resolution and signal quality is limited. Furthermore, assigning transcription factors to their target genes based on the genomic localisation is difficult due to the size of intragenic and intronic regions and long range effects of some transcription factors.

Additional File 1. A short primer on graph theory

Format: PDF Size: 27KB Download file

This file can be viewed with: Adobe Acrobat ReaderOpen Data

Nevertheless parts lists provide the first impression of gene networks in different organisms and they are necessary to have before we continue by having a look at the network topology.

Topology models

Once we know the transcription factors and their binding sites, we can describe the gene transcription regulatory networks by graphs with nodes corresponding to genes and edges to regulatory interactions [17]. (Note the difference between these discrete graphs and plots of mathematical functions also often referred to as graphs.) A short introduction to discrete graphs is given in additional file 1, for more details please consult for example Cormen et al. [18]. One important concept that we will use below is a representation of a graph by a so-called adjacency matrix, where the element aij in a row i and column j equals 1 (i.e., aij = 1), if node i is connected to node j, otherwise aij = 0. Graph representations have been used for various biological data sets ranging from protein-protein interactions networks to coexpression networks, they have been long used in mathematics, physics and computer science, and many aspects of graphs and their applications have been studied (e.g., [19-21]).

Additional File 2. A very short primer on biology techniques

Format: PDF Size: 368KB Download file

This file can be viewed with: Adobe Acrobat ReaderOpen Data

In a directed graph (i.e., a graph where connections between nodes have a definite direction) we call genes (nodes) with outgoing edges (arcs) source genes. For a given source gene, we call the set of all genes with incoming arcs from that source gene its target genes. Regulatory relationships can be of various natures. For a specific model we need to define the precise meaning that we assign to the edges (Figure 2). For instance, an arc from a gene A to B may mean that source gene A is a transcription factor, which is known to bind to the promoter of target gene B. A rather different network will be obtained if an arc from A to B denotes the observation that the disruption (e.g., mutation) of source gene A changes the expression of target gene B. We will present examples for these types of networks in the next section. A widely studied type of molecular network of a different type is the protein-protein interaction network, where the nodes represent proteins and two proteins are connected by an undirected edge, if they bind to each other (Figure 2) [22]. A different network will be established by connecting genes based on their sequence similarity. Networks can also be built based on the co-occurrence of gene names in journal abstracts. If two gene names frequently occur in the same abstracts it is likely that they share some kind of functional relationship [23].

thumbnailFigure 2. Edges and arcs of a graph can represent different kinds of relationships. Some examples are shown.

To illustrate knowledge that we can obtain from studying network topology, we will compare and combine information from two high throughput data sets for the yeast Saccharomyces cerevisiae. The first is obtained from chromatin immunoprecipitation experiments for transcription factors (ChIP network), while the second is obtained from microarray experiments on single gene deletion mutants (mutant network), for more detail on the experimental methods please refer to additional file 2. Microarray experiment measurements can be presented in a data matrix, where rows represent genes and columns particular experiments (hybridisations). For instance, in the ChIP experiment each column will correspond to a particular transcription factor (studied in the particular experiment), while in the mutant experiment each column will correspond to a particular mutant. In this way, not only rows, but also columns will correspond to genes. The measurement values are typically real numbers, such as intensity levels, expression levels, or p-values, depending on the data processing steps applied. By applying an additional data processing step, often called thresholding, we can transform these continuous values into discrete values (e.g., if we chose a threshold t, then we can replace any xij by 0, if xij <t, and by 1, otherwise). In this way we will transform the original measurement matrix for these experiments into an adjacency matrix defining a graph: two genes in this graph are connected, if the measurement value is higher than the chosen threshold.

The ChIP network is based on experimental data published by Harbison et al. [24]. As described in additional file 2 they used genomic tiling arrays to identify the genomic regions bound by transcription factors. The authors assigned each genomic region to one or two target genes based on proximity in the genome. Relative intensities of spots are the basis for an error model that assigns a probability score (p-values) to binding interactions, which we use for discretisation.

The starting point for the mutant network is the gene expression data matrix published by Hughes et al. [25]. Each experimental condition, which in our case is a particular gene deletion mutant, corresponds to a column and each gene corresponds to a row (for more detail see additional file 2). We discretise the data matrix using a gene-specific standard deviation estimate γ obtained from the error model proposed by Hughes et al. [25].

The size of the networks depends on the discretisation thresholds chosen (Table 2). The criteria used to choose these thresholds are rather subjective, for the following comparisons we focused on these thresholds: ChIP network pt = 0.001 and mutant network γ = 2.5.

Table 2. Some properties of the mutant network and the ChIP network at different thresholds

What do these two networks mean and how do they compare? In the ChIP network, an arc A→B means that the gene A codes for a transcription factor that binds to the promoter of gene B, while in the mutant network it means, that the mutation of A will change the expression level of B [23]. The ChIP network describes physical interactions, but it does not tell us anything about the effects of these interactions. The mutant network is similar to the one used in gene networks built by classical genetics means – we know that a mutation (perturbation) of the first gene has an effect on the second one, but it does not necessarily mean a direct physical interaction – there may be a long transcriptional or signalling cascade leading from the first gene to the second. In this way the first network is likely to contain direct interactions, while the second may include indirect interactions as well. However, it is possible that some of the 'direct' interactions of the Chip network are not biologically functional and thus may not be supported by mutant network. Most importantly it should be noted that the experimental conditions in the two experiments are not identical, which may result in considerable discrepancies between the two networks.

First we can observe that both networks consist of one major component and almost all genes are part of it and are connected (this is true for a wide range of discretization thresholds). The degree distributions resemble roughly a power-law, i.e. most source genes have few target genes, while few source genes have many (Figure 3). Rung et al. discovered that the number of connections can indicate the functional class of the gene. Genes in the mutant network with many outgoing arcs (high outdegree) often encode proteins with regulatory functions, whereas genes with many incoming arcs (high indegree) are predominantly involved in metabolism [26]. Functionally related genes tend to be close in the networks, it is therefore possible to identify functionally related genes by comparing their neighbourhoods [23]. Manke et al. found directly interacting transcription factors and those, which are members of a protein complex, to occur together as putative DNA-binding modules more often than expected randomly [27].

thumbnailFigure 3. Log-log plot of the node connectivity in different topological networks. The genes with the highest degrees are ABF1 in the ChIP-network and TUP1 in the mutant network, adapted from [2]

When we compare and combine the mutant network and the ChIP network we immediately observe that their intersection is sparse. They share 102 edges connecting 13 from a total of 23 shared source genes to 93 distinct target genes (Table 3 and Figure 4). In the mutant network these 13 source genes are connected to 937 distinct target genes by 1157 edges (89 edges per source gene, 8.8% of the connections are in the intersection); whereas in the ChIP network they are connected to 631 distinct target genes via 924 edges (71 edges per source gene, 11.0% of the connections are found in the intersection). We used the hypergeometric distribution to compare target sets of all source genes [23] to identify source genes with target set intersections larger than expected by chance (Figure 5). We found that 9 of the 23 shared transcription factors Arg80p, Gcn4p, Hir2p, Mbp1p, Stb4p, Ste12p, Swi4p, Swi5p and Yap1p have significantly similar target sets in both networks (p < 0.05, 4000 genes in total) (Table 3). In these cases the transcription factor localisation might actually explain the changes in gene expression we see in the corresponding deletion mutants. One would assume that due to the nature of the experiments some effects in the mutant network are indirect effects that could be explained by a combination of direct connections in the ChIP network (Figure 6A). We find that indeed a number of connections in the mutant network can be explained by a combination of two edges in the ChIP network (Figure 6B).

Table 3. Degrees of the source genes that are shared between the mutant network and the ChIP network (data for YPD medium only)

thumbnailFigure 4. Venn diagrams of the intersection between the mutant and the ChIP network. The Venn diagram on the left hand side shows the intersection of the source genes between the mutant network and the ChIP network; the right hand side shows the intersections of the target genes between both networks. The connections between the two Venn diagrams indicate the corresponding number of edges. The networks share 23 source genes and 102 edges, but only 13 of the shared genes contribute to 102 shared edges, which connect to 93 distinct target genes. The 23 shared source genes are connected by 1362 edges to 631 target genes in the ChIP network and by 1572 edges to 937 target genes in the mutant network (see also Table 3).

thumbnailFigure 5. Illustration of the target set comparison. A In the ChIP network transcription factors are connected to their target genes (regulation set); in the mutant network the deleted genes are linked to all genes with differential expression in this particular mutant background (effectual set). B Some transcription factors are present in both networks (ChIP and mutant network); we can therefore compare the genomic localisation (regulation set) with the expression changes in the mutant cell (effectual set). Reproduced from [2]

thumbnailFigure 6. Direct and indirect effects. Red arcs are from the mutant network, green arcs from the ChIP network. A In the mutant where transcription factor A is deleted (disrupted) the expression of gene B is significantly different from its expression in the wild type. The transcription factor A does not bind to the putative promoter region of gene B (no green arc), but to the putative promoter region of transcription factor C, which in turn is found in the putative promoter region of gene B. This indirect path from A to B in the ChIP network might therefore explain the direct path in the mutant network. B All direct effects in the mutant network that could be explained by indirect paths via one additional transcription factor in the ChIP network.

Others have observed that when comparing different protein-protein interaction networks, their intersections are small, too. Only few interactions are reported by several experiments despite using just different methods to measure the same interactions [28]. Reassuringly, the shared interactions turned out to be more reliable than most of the data [28]. Here we work with experiments measuring different, if somehow related effects, but still the proportion of connections between functionally related genes is increased in the intersection of the two networks. In the intersection 40 of 102 (39.2%) connections connect genes that have the same cellular role in YPD, compared to less than 20% in the original networks (Table 2).

To summarise we can say that although the two networks are rather different, the part that is common to both is biologically more meaningful, and some of the indirect interactions of the mutant network can be explained by the direct interactions in the chip network.

Network topologies, particularly in yeast, have been widely studied and many interesting observations have been made. It has been proposed that the existence of highly connected genes (hubs) in a network might make networks more tolerant to random failure of network elements [29,30]. In protein-protein interaction networks it seems possible to classify hubs in combination with expression data: Han et al. [31] showed that hub proteins can be divided into two groups based on the level of coexpression between their neighbours in the network (the proteins directly connected to the hub proteins). Hubs with low coexpression seem to link functionally separate modules and removing these hubs leads to more rapid disintegration of the network [31]. However so far this has not been observed in transcription networks.

Luscombe et al. compiled data from ChIP-on-chip experiments for yeast to construct a network of 142 transcription factors, 3420 target genes and 7074 regulatory interactions [32]. To study the dynamics of this network they traced the paths from the target genes back to initial transcription factors, starting from target genes that are differentially expressed under particular conditions as demonstrated in previously published microarray experiments. Depending on the conditions, different sets of genes are expressed, leading to different sets of target genes as start points for the backtracking and different transcription factors along the path. This is consistent with results from ChIP-on-chip experiments and demonstrates that the topology of the gene regulatory network is not independent of the experimental conditions [24].

In a different line of investigations, Lee et al. [31], and Milo et al. [33], identified re-occurring structural elements (motifs) in the networks. They examined topological networks derived from ChIP-on-chip data for structures consisting of 3, 4 or more edges that occur in the original network more often than in randomised networks. Network motifs they identified to be significantly more frequent than in randomised networks included feed-forward and feedback loops. These motifs may partly be the result of gene duplications during genome evolution [34].

These are just some examples of possible analyses that can be performed on topology level. However, arguably the main reason to study the network topology is to prepare the ground for the next step of building more detailed models for gene networks. Before any logic or dynamic network model can be constructed we need to know which gene products interact and which are mutually independent. Even if we take the view that in the real-world network every gene is connected to every other gene to some degree, not all these connections are equally strong and a discretization step can be used to keep only the strong connections in the model. A complete network where everything is connected to everything may not be a practical approach to network modelling on a genome scale.

Arguably the most important question is if we can find modules, i.e. subnetworks that are relatively isolated from the rest of the network. If such modules are found, they can help us to use the reductionist approach later on by allowing modelling the parts of the network independently on a more detailed level. For instance, if we can build a dynamic model of an independent module, then we can perform simulations independently from the rest of the network. The existence of modules in biological systems has often been taken as an axiom [35]. However, a precise definition for what constitutes a module is elusive, and therefore this term has been used in various contexts [36]. In a graph representation it is natural to define a module as a 'relatively' isolated component, and indeed such components were found in protein-protein interaction networks. In contrast isolated components have hitherto not been found in the wiring diagrams of eukaryotic transcription regulation networks [26]. Several methods have been proposed to identify modules as groups of genes coexpressed under specific conditions [37,38], but there remain controversial opinions regarding the existence and nature of modules in gene networks [39,40]. Biologically meaningful pathways are sometimes used to define modules and to implement a reductionist approach. However, this easily breaks down in conditions when the pathways interact.

In general, data sets used for topological models have important limitations. While hundreds of organisms have been fully sequenced and many genes are identified relatively reliably, the data sets underlying most topological models are much less complete. Only a fraction of all protein-protein interactions in yeast have been tested; most large-scale experiments show high noise levels; and whereas the genome sequence is independent of particular growth conditions and (sometimes) is even conserved in fossils, data like protein-protein interactions and transcription factor localisations are condition dependent. In this context it is particularly important to note that some experimental methods are performed under conditions considerably different from the natural conditions in the cell. For example, the yeast-2-hybrid technology was used to determine protein-protein interactions between human proteins, yet the yeast cell provides a very different environment from a human cell [41,42]. This can be a considerable source for variation and systematic errors. Some experimental techniques are performed in test tubes, thus providing the most "unnatural" conditions. Unfortunately various limitations are unavoidable and we have to work with incomplete data for a limited set of conditions.

We can conclude that genome scale topological representations have helped us to make many interesting observations about the network properties, however the main question of finding well defined modules of such networks on topology level is still open.

Control logics models

Once we know the network topology, the next step is to study the rules of interaction between the different elements in the network. For instance, if a promoter consists of only one binding site for a transcription factor, we may want to know whether it is an activator or a repressor. If several transcription factors bind to a promoter, we need to know what each factor does, but also how these factors interact (Figure 7). Biological studies demonstrate that some promoters show combinatorial behaviour that can be approximated by Boolean functions (AND, OR, NOT and combinations of these), but in other cases the interaction is more complicated [43]. Linear functions, Boolean functions, decision trees, and Bayesian probability distributions have all been used to describe the network logic. We can distinguish between discrete functions and continuous functions. Discrete functions are based on the assumption that a gene can be in a finite number of states. In the simplest case we use only two different states to describe the activity of genes (e.g., expressed and not expressed). We can thus use Boolean functions to describe the interactions between transcription factors, e.g. "gene j is active, if transcription factor A AND B are bound to the promoter". It has to be stressed that such 'states' are only approximations of reality, that in the real world the interactions are not so well defined and are often fuzzy.

thumbnailFigure 7. Example for network logics. Genes A, B and C control the activity of gene D; D is active if A and B are bound, but not C; right: shows the FSLM representation for such a promoter. Reproduced from [2].

Continuous functions use continuous values (real numbers) to represent the gene activity. Weights wij represent the interaction between genes i and j, which can be positive or negative. Thus the activity gi of gene i can be calculated as the weighted sum of the activities of all n genes:

gi = wi1 g1 + ... + win gn

This approach assumes that the influence of one gene on another gene is linear. Note that the network topology will determine which of the weights wij are equal to 0 (i.e., if there is no arc from gene i to gene j in the network topology, then wij = 0). Like Boolean functions, linear functions are only approximations. For instance, it is not possible by linear functions to model a situation where the same transcription factor can play a role of an activator or repressor for the same gene, depending on the presence or absence of other transcription factors.

Although few promoters have been studied in great detail, there are excellent examples, such as the description of the promoter action logics of sea urchin developmental gene Endo16 [44]. The Endo16 promoter consists of almost 30 regulatory elements stretched over a region of 2.3 kb. Based on experimental data collected using modified promoter constructs Davidson and co-workers constructed a model expressed as an algorithm combining Boolean and linear functions. This algorithm takes as an input the occupancy information from 12 binding sites and outputs a value, that 'can be thought of as the factor by which, at any point of time, the endogenous transcription activity (...) is multiplied as a result of the interactions mediated by the cis-regulatory control system' [44]. Predictions of promoter manipulations based on this model have largely been confirmed in subsequent experiments. Extending their earlier work the group of Davidson compiled a regulatory network containing over 40 genes by the construction of a model that integrates extensive experimental evidence on early development of sea urchin embryos [45].

Recently Klamt et al. published an example for control logic networks [46], based on hypergraphs, which are an extension to the graphs described above. Several hyper-edges pointing to the same node represent OR relationships, but edges are allowed to combine to represent AND relationships. Weights on the edges distinguish positive and negative relationships. The authors provide a set of methods to analyse these networks, just to list a few examples: computation of all positive and negative signalling paths, computation of all positive and negative feedback loops and computation of minimal cut sets. These minimal cut sets report the smallest number of interventions necessary to force the network into a particular behaviour, for example, a minimal number of deletions necessary to block the activation of a particular downstream protein in a signalling cascade. These methods are implemented in the software tool CellNetAnalyzer and the example presented, a model of a signalling network for T-cell activation shows that these analyses are non-trivial for signalling networks of a typical size.

Soinov et al. used a supervised learning approach to build decision-tree-related classifiers. A decision tree is a predictive model (Figure 8). Soinov et al. built decision trees which allow us to predict the gene expression activity of a particular gene (leaf node) based on the expression data of other genes (interior nodes) [47]. Although the gene predictions are binary in this approach (the gene is predicted be "active" or "inactive"), this system utilizes continuous expression values, such as microarray data.

thumbnailFigure 8. Decision trees. A decision tree is a special type of tree where the root and each interior node correspond to a variable; an arc to a child represents a possible value of that variable. A leaf represents the predicted value of target variable given the values of the variables represented by the path from the root. Following a route from the root node to a leaf node at each interior node we have to decide, which path to follow. Effectively each possible path encodes a decision rule. A Example for a decision tree. By following from the root node (top) to a leaf node (bottom) one has to make a decision at every interior node. B Corresponding set of decision rules.

Bayesian networks provide a probabilistic framework for modelling gene regulatory networks [48-50]. Their graphical representation is a directed acyclic graph, where each node represents a variable and the edges represent dependencies. For a more detailed description of the application of Bayesian networks in gene expression analysis see the reviews by Pe'er [51] and Friedman [52]. Segal et al. applied a learning procedure based on probabilistic graphical models to networks consisting of groups of coregulated genes [53].

There are situations where neither Boolean rules nor linear functions are powerful enough to express the control logics: transcription factors might bind competitively, if one factor is bound, the other one is excluded, as is the case for example in the phage λ switch between lysis and lysogeny [54]. In some cases, transcription factors have to form homodimers or heterodimers to be fully functional. The transcription factors might have to bind sequentially or might act synergistically. In these situations it might be necessary to use more complex functions (here this would be solved by Boolean circuits with memory or delay). It remains an open question what is the minimum repertoire of functions to describe regulatory logics.

Dynamic models

The knowledge of the parts list of a network, its topology and the control logics are necessary requirements in order to expand the model to capture dynamic changes during time. Compared to the approaches above, the dynamic models can be described as 'classical' approaches to gene network modelling, as many of them have been developed and studied long before the current genome era. Typically, they are relatively small, involving only a few genes. They aim at describing and often simulating the dynamic changes in the state of the system and predicting the network's response to various environmental changes and stimuli.

Various dynamic models have been proposed. Greller and Somogyi subclassified them [55] as follows: "Dichotomies for framing our thinking on how to best represent a particular biological network problem include the following distinguishing attributes: quantitative versus qualitative measurements; logical versus ordinal variables (e.g. Boolean versus abundances); deterministic versus probabilistic state transitions (e.g. differential equations versus hidden Markov); deterministic versus statistical overall system description (e.g. vector field versus Bayesian belief network probability distributions); continuous versus discrete state (e.g. continuous intensities or concentrations versus low, medium and high); nonlinear versus linear elementary interactions and state update rules (e.g. multiplicatives, sigmoids or non-monitonics versus linear ramps); high-dimensional versus low-dimensional (e.g. >> 100s of variables versus << 100 variables); stochasticity present and profound versus absent or present as nuisance noise (e.g. probabilistic state transitions versus small amplitude errors); measurement error substantially corrupting and obfuscating versus negligible distortion." In the following sections we describe several approaches following the discrete to continuous model axis. The discrete model approaches we consider include Boolean network based models [56-58] and Petri nets [59-62], the dynamic systems are based on difference or differential equations [63-65]. We will then discuss hybrid models, which combine discrete and continuous elements [66-68].

Boolean models

The simplest dynamic models – synchronous Boolean network models – were used as a model for gene regulatory networks already in the 1960's by Stuart Kauffman as [69]. Boolean networks are based on the assumption that binary on/off switches functioning in discrete time steps can describe important aspects of gene regulation. In synchronous Boolean network models all genes switch states simultaneously (Figure 9). We can introduce the concept of the state of the network defined as an n-tuple of 0s and 1s describing which genes in the network are or are not expressed at the particular moment (Figure 9). As time progresses, the network navigates through the 'state space', switching from one state to another, as shown in Figure 9D. For a network of n genes, in total there are 2n possible different states, for instance, for a three gene network the possible states are (0,0,0), (0,0,1), ..., (1,1,1). We can follow the succession of states with time and study which states are reached. Some states might never be reached. It is possible to look for attractors: these are states or series of states that once reached will not be left anymore. The small example network in Figure 9 has two attractors: one attractor is a single state (0,0,1), and the second attractor consists of two alternating states (1,0,1) and (0,1,0).

thumbnailFigure 9. Example for a small Boolean network consisting of 3 genes X, Y, Z. There are different ways for representing the network: A as a graph, B Boolean rules for state transitions, C a complete table of all possible states before and after transition, or D as a graph representing the state transitions. Reproduced from [2].

Kauffman introduced the notion of canalizing function – a Boolean function that has at least one input variable (canalizing variable) and one value (0 or 1) for that input (canalizing value), which determines the value of the output of the function regardless of other variables (i.e., if the canalizing variable has the canalizing value, then the output of the function do not depend on other variables, but if the canalizing variable does not have the canalizing value, then the output of the function is determined by the values of other variables) [70]. He hypothesized that genes are predominantly controlled by such functions (whether this is indeed true is still unknown). Kauffman used randomly generated networks to study their general features [69]. He found that under certain assumptions about the network topology (a limited number of incoming connections at each node) and logics (promoters are predominantly controlled by canalizing functions) there are only a small number of states in which the network will stay for most of the time. These states are called attractors; any other state, if possible at all, will lead to an attractor state in a relatively small number of steps. Moreover, the system either reaches a steady state or fluctuates between the attractor states in a regular fashion. Kauffman hypothesized that attractors correspond to different cell types of an organism. The number of cell types predicted by this model corresponds well with our current knowledge [70].

This approach has been generalized in a number of ways. Randomly generated networks are used to study the dynamics of complex systems [71]. Stochastic extensions to deterministic Boolean networks were proposed – so-called noisy networks by Akutsu et al. [72] and Probabilistic Boolean Networks by Shmulevich et al. [73].

Thomas and Thieffry describe a generalized model for the qualitative description of gene regulatory networks [74]. They introduce a notion of gene state and image, the last effectively representing the substance produced by the respective gene. There is a time delay between the change of the gene state and the change of the image state. By introducing several levels of gene activity and thresholds for switching the gene states they go beyond binary models, but they do not make continuous changes possible.

Petri nets

Petri nets are an extension to graph models and have been used successfully in many areas for example to simulate metabolic networks. For a brief introduction into Petri nets see Pinney et al. [59] or the more detailed reviews by Moore et al. and Hardy and Robillard [60,61]. Petri nets allow simple quantitative representation of dynamic processes like mass flow in a network. Petri nets were developed in the 1960's by Carl Adam Petri and have since been extended. In general they are directed graphs consisting of arcs and two different kinds of nodes, the place nodes and the transition nodes (Figure 10). The arcs only connect place nodes to transition nodes and vice versa. The dynamic aspect is introduced by so-called tokens. Each place node can contain tokens. Each arc has a 'weight' that determines how many tokens are needed for a transition along this arc. Intuitively, you can imagine that the tokens travel along the arcs if there are a sufficient number of them at the source node (as determined by the weighted arcs) and the transition nodes determine the exchange ratio along the way. In the simplest case, a transition node fires (= a transition takes place) always if sufficient tokens are present in the input place nodes.

thumbnailFigure 10. A metabolic reaction (left) and its representation as a Petri net (right). Aldolase splits one molecule of Fructose-1,6-bisphosphate into one molecule Dihydroxyacetonephosphate and one molecule Glyceraldehyde-3-phosphate. The Triosephosphateisomerase then transforms one molecule Dihydroxyacetonephosphate into one molecule Glyceraldehyde-3-phosphate (the reversibility of the reaction has been omitted here for the sake of clarity). In the Petri net representation place nodes (circles) are denoted by p, transition nodes (boxes) by t and tokens numbers by m. The place node p1 represents Fructose-1,6-bisphosphate and m1 the number of tokens or number of Fructose-1,6-bisphosphate molecules present. The transition node t1 represents the enzyme Aldolase. The weights on the edges reflect the stoichiometry of the reactions. p2 Dihydroxyacetonephosphate, m2 number of Dihydroxyacetonephosphate molecules, t2 Triosephosphateisomerase, p3 Glyceraldehyde-3-phosphate, m3 number of Glyceraldehyde-3-phosphate molecules.

In metabolic networks the place nodes represent metabolites and the transition nodes represent reactions. Metabolite concentrations correspond to the number of tokens in the particular place nodes and the stoichiometry is described by the weights of the arcs. Subsequent analyses of Petri net models look for place nodes running out of tokens or accumulating tokens and for subnetworks that are inactive. Interesting are invariants, such as transition invariants (T-invariants), where the transitions reproduce a given state. In metabolic networks T-invariants represent reactions reproducing the given concentrations of metabolites, as for example in steady state situations. For examples of the application of Petri Nets in the analysis of metabolic networks see articles by Koch et al., Kuffner et al., Schuster et al. or Steggles et al. [62,75-77].

Petri nets are particularly suitable for modelling metabolic reactions, because the similarities are intuitive and there is no need for detailed information about the reactions rates. This is an advantage, because often these rates are not known and hard, or at least costly to obtain. The lack of information about reaction rates is one major shortcoming for the application of differential models, which we will discuss in the next section. However, sometimes the reaction rates will be crucial to the function of the whole metabolic pathway and therefore need to be included in the pathway model (there are extensions to Petri Nets which address this, see the section on hybrid models below).

Difference and differential equation models

Boolean networks and Petri nets can reveal important network properties, but are too crude to capture some important aspects of network dynamics. Difference and differential equations allow more detailed descriptions of network dynamics, by explicitly modelling the concentration changes of molecules over time [63,64,78-80].

The basic difference equation model is of the form

g1(t+Δt) - g1(t) = (w11 g1(t) + ... + w1n gn(t)) Δt


gn(t+Δt) - gn(t) = (wn1 g1(t) + ... + wnn gn(t)) Δt

where gi(t + Δt) is the expression level of gene i at time t + Δt, and wij the weight indicating how much the level of gene i is influenced by gene j (i,j = 1...n). Note that this model assumes a linear logic control model – the expression levels of genes at a time t+Δt, depends linearly on the expression levels of all genes at a time t. For each gene, one can add extra terms indicating the influence of additional substances [64].

Differential equation models are similar to difference equation models, but follow concentration changes continuously, modelling the time difference between two time steps in infinitely small time increases, i.e. Δt is approaching 0.

Dynamic networks models have been reviewed intensively [81-84]. One of the largest transcription network models using differential equations we are aware of is a model for segment polarity genes and pattern formation in the early development of Drosophila by von Dassow et al. [85]. Their system included 48 parameters, such as the half-lives of messenger RNAs and proteins, binding ranges and cooperativity coefficients. The initial model described all known interactions, but it also revealed that the addition of at least two new hypothetical interactions were needed to ensure that the behaviour of the model was consistent with the observations.

Difference and differential models depend on numerical parameters, which are often difficult to measure experimentally. An important question for these models is stability – does the behaviour of the system depend on the exact values of these parameters and initial substance concentrations, or is it similar for different variations. It seems unlikely that an unstable system represents a biologically realistic model, while on the other hand, if the system is stable, the exact values of some parameters may not be essential. For instance, the Drosophila developmental model [85] is stable – it tolerates tenfold or more variation in the values of most individual parameters.

Many software packages have been developed for dynamical simulation of biological networks, but the exchange of models and data between these software packages was often not easy. The systems biology markup language SBML was developed to address this problem. SBML is an XML-based format that allows describing models software-independently [86]. (XML eXtensible Markup Language allows to define special-purpose markup languages, capable of describing many different kinds of data.) An example for a markup language is HTML. Nowadays SBML model descriptions can be used on many software platforms, enabling data exchange and cross-validation of models. This has also enabled the establishment of model databases like BioModels, a curated database of published quantitative kinetic models [86]. This is a central database where biological models published in scientific journals can be deposited.

Hybrid models

In the real world systems both continuous aspects and discrete aspects are present. In general, concentrations are expressed as continuous values, whereas the binding of a transcription factor to DNA is expressed as a discrete event (bound or unbound). However, the boundaries between the discrete and continuous aspects depend on the level of detail that our model is designed for. For instance, on single cell level the concentrations may have to be expressed by molecule counts and become discrete, whereas if we use thermodynamic equilibrium to model the protein-DNA binding, the variable describing the binding state becomes continuous.

Hybrid models have been developed in an attempt to describe both, discrete and continuous aspects in one model, and such models have therefore been proposed, for instance in [67,68].

There are extensions of the Petri net model, that allow us to include knowledge about the dynamics of reactions: for example to include stochastic time delays for the transitions, first applied to molecular biology by Goss and Peccoud [87]. In these networks the firing of transition nodes depends not only on the number of tokens in the input place nodes, but also on a stochastic component. In their study of circadian rhythms Matsuno et al. used another type of extension to Petri nets to simulate gene regulatory networks [88]: in addition to standard Petri nets Hybrid Functional Petri Nets (HFPN) contain continuous place nodes and continuous transitions. Continuous place nodes can hold a real numbers and continuous transition nodes are firing at a constant rate. In metabolic networks this rate corresponds to reaction rates. However, this means we loose one major advantage of Petri nets over difference and differential models: we need information on reaction rates. If we have information only for some reactions, HFPNs provide a compromise by allowing the implementation of a mix of continuous and discrete place nodes and transitions.

Another example for hybrid models is the phage λ model by McAdams and Shapiro [89], where elements similar to ones used to describe electronic circuits have been exploited.

Finite State Linear Model (FSLM)

As an example we will describe the finite state linear model (FSLM), more detailed descriptions of FSLM can be found in [2,90,91]. It combines the advantages of Boolean networks such as simplicity and low computational cost, with the advantages of continuous models, such as continuous representation of concentrations and time. The activity of genes is described by discrete states (e.g., gene is 'on' or 'off'), but the gene product concentrations are expressed as real numbers. Time is continuous in FSLM and the state of the network determines directly the concentration change rates, while the state is in turn affected by the concentrations themselves.

In FSLM there is only one class of molecules, represented by substances. There are three types of network elements: binding sites, control functions and substance generators (Figure 11A). The binding sites in the FLSM are comparable to DNA binding sites for transcription factors in the promoter regions of genes. A combination of binding site(s), control function(s) and a substance generator in the FSLM corresponds to a biological gene (Figure 11A). A gene network consists of one or more such genes, which influence each other via the substances they produce (Figure 12).

thumbnailFigure 11. The building blocks of the finite state linear model. A Binding sites are represented by triangles, control functions by boxes and substance generators by diamonds. Dotted lines represent cases where the discrete output of one element is the input for another element. B Switching behaviour of the binding sites. The curve (left) is typical for processes with hysteresis characteristics of a system that does not instantly follow the forces applied to it, but reacts slowly, or does not return completely to their original state: that is, systems whose states depend on their immediate history. The threshold for switching the states of the binding sites in FSLM is state dependent and results in a similar curve (right). [c] concentration of substance binding to binding site j; assoj, dissoj association and dissociation constants for binding site j; u binding site not occupied, o binding site occupied. Reproduced from [2].

thumbnailFigure 12. Example for the dynamics of a simple FSLM network. A In this negative feedback loop the substance generator produces a substance, which acts as a repressor of its own control function. B Environment change graph recording the changes in repressor concentration during time. From the initial concentration the repressor accumulates with rate r+ until the association constant of the binding site brep is reached at time t1. Then the substance generator is switched off and the repressor degrades with rate r- until the dissociation constant is reached at time t2. The substance generator then produces the repressor until the association constant is reached again (means Boolean „not“). Reproduced from [2].

The binary FSLM allows only two possible states for the binding sites (bound or unbound) and substance generators (on or off). A generalisation of the FSLM model and a more mathematically thorough definition can be found in [91]. For each substance there is a corresponding substance generator. The substances can bind to binding sites, but each binding site can be bound by one substance only. The binding of a substance to a binding site bj depends on the association constant aj and the dissociation constant dj of the binding site (0 < dj <aj). The binding site is bound if the concentration of the binding substance exceeds the association constant. If the substance concentration falls below the dissociation constant then the binding site is released and switches to the unbound state. The biochemical equivalents of the association and dissociation constants in FSLM are affinity constants. The difference between the association constant aj and the corresponding dissociation constant dj leads to a hysteresis characteristics (Figure 11B) for the switching between the states of a binding site (see for example [65]). The concentration threshold for the switch between the states of the binding site depends on the state of the binding site itself. Using discrete states to represent the binding sites means we approximate the binding equilibrium with a simpler step function.

The states of a set of binding sites comprise the binary input vector to a Boolean control function F. Depending on the input state vector the control function computes an output state (on or off). A substance generator S changes the concentration of a substance in time in a linear fashion. The concentration can either increase with rate r+ or decrease with rate r- (r- < 0 < r+), corresponding to substance production and degradation, respectively. The output state of a control function determines the activity of a substance generator, i.e. whether the concentration of a particular substance is increasing or decreasing. Note that the linear increase and decrease rates that are assumed in the FSLM are only approximations to the reality.

Let us illustrate the dynamics of the FSLM by modelling a negative feedback loop (Figure 12). To begin with the substance concentration of the repressor is low, the binding site is unbound, the substance generator is active and therefore the substance is produced with rate r+. Its concentration increases until it reaches the association constant of the binding site. The binding site switches to the bound state, which in turn leads to the inactivation of the substance generator, and the substance concentration decreases with rate r- until it reaches the dissociation constant of the binding site. Consequently, the binding site switches to the unbound state, the substance is generated again, its concentration increases and the process repeats itself. Figure 13 shows the behaviour of a gene network consisting of two genes, demonstrating that a very simple network of just two genes can exhibit a non-trivial behaviour.

thumbnailFigure 13. A FSLM network consisting of two genes and four binding sites. Left: The control functions of both genes have two inputs each. One input is from a binding site for its own substance, thus each gene is autoregulated by a negative feedback loop. Gene 1 has an additional negative feedback on gene 2, whilst gene 2 has an additional positive feedback on gene 1. Right: Result of the simulation of this network in FSLM. a1 association constantof binding site 1, d1 is the corresponding dissociation constant; a2, d2, a3, d3, a4, d4 correspondingly; ¬ Boolean „not“, &Boolean „and“. Reproduced from [2].

FSLM can be used to build complex models for instance to simulate the life cycle of phage λ (Figure 14). Phage λ is a virus that infects Escherichia coli cells [92]; it either integrates into the host genome and stays dormant (lysogenic) or causes production of new phage particles and lysis of the host cell, to allow spreading the infection. The decision for one or the other alternative (lysis vs. lysogeny) is made by the so-called lambda switch, which is based on competitive binding of two transcription factors to overlapping regions in the genome of phage λ. If the repressor is bound, the phage stays dormant, if the repressor is degraded and the activator can bind, new virus particles are being made. The FSLM model of phage λ allows two different kinds of behaviours, which correspond to lytic or lysogenic behaviour.

thumbnailFigure 14. Description of phage λ using the elements of FSLM. In the FSLM model for phage λ the substance generators highlighted in grey produce substances, which bind to binding sites on the left (the connections have been omitted to improve the readability of the figure). The promoters PL1, PL2, PR1, and PR2 are used to model the behaviour of the λ terminator sites tL1, tL2, tR1, and tR2. The substance generators connected to them are only active, if N is bound to the respective binding sites. The substance "Struc" represents the structural proteins of the phage particles. The shaded grey boxes indicate the number of different states that the corresponding control functions can have. A simulation of phage λ using this model leads to lysogenic behaviour or lytic behaviour. In the lysogenic mode the initially active genes are inactivated, and the substance concentrations decrease rapidly, only CI is produced. The fluctuations of the CI concentration are due to the negative feedback loop involving the binding site OR3. In the lytic mode, CI and CII are not produced, but the other substance generators are active. The concentrations of Int, N, and Q increase infinitely because of the lack of a negative feedback control. The inset describes the effect of the stress response of the host cell using elements not yet implemented in the FSLM simulator. For a more detailed description of the model see [2, 91]. Reproduced from [2].

In our example models the biological systems are relatively simple, but for larger networks we often lack detailed information about the biology.

Stochastic networks

All networks mentioned so far are deterministic – they assume that the next state of the system is determined by the current state and the external inputs. However, in real world systems stochastic effects may play an important role. For instance, for some genes in yeast the number of mRNA molecules is close to one copy per cell [93]. This means that it is likely that there is a considerable intrinsic noise element present – some cells apparently have more mRNA molecules of the given species present than others. Thus modelling a cell by using continuous concentrations effectively means modelling an ensemble of cells by mean values of stochastic variables. It is not obvious to what extent this is possible. It has been demonstrated that the stochastic effects are important for the phage λ switch decision between lysis and lysogeny [94]. Lately experimental studies have tried to measure the level of intrinsic noise in eukaryotic cells (e.g., [95,96]). Simulating a stochastic model is computationally more expensive, because the simulations have to be run several times to provide a good impression of the system behaviour. But stochastic models are not always necessary; it depends on the system that is to be modelled. If the number of molecules involved is small and if important processes depend on random effects, stochastic models might be the best choice.

Reverse engineering and synthetic networks

"With four parameters I can fit an elephant, and with five I can make him wiggle his trunk" – John von Neumann

Reverse engineering of gene networks

Reverse engineering refers to an approach where one starts from data and tries to design a model that fits the data (semi-) automatically within the given model class, without additional prior hypothesis about the biological system. The model derived from the data is judged by the results of simulations compared to new experimental data. For example, one could use a gene expression data set to construct a particular gene network model that is consistent with the data. Inconsistencies between simulated data generated using this model and new data, that has not been used to construct the model, indicate shortcomings of the model. These inconsistencies can be used to choose between alternative models, or to improve the model. However, reverse engineering is possible only (1) if we have chosen an appropriate model class (in the sense that the desired properties of the real world network can be described in it), and (2) if we have enough quantitative data describing the behaviour of the system. Of course, even if the answers to these two questions are positive, reverse engineering is still a difficult problem, and few efficient algorithms are known. The methods chosen for reverse engineering depend crucially on the kind of modelling technique used. Quantitative models are normally more demanding than qualitative models. Dynamic models contain many parameters, and detailed experimental data are required to work out the parameters.

Miyano et al. have proposed algorithms to infer Boolean networks [67,72] and Friedman et al. developed methods to extract probabilistic graphical models, such as Bayesian networks from experimental data [49,52]. Tegner et al. proposed an approach for the reverse engineering of dynamic gene networks based on integrating genetic perturbations [97]. They identified " [...] the network topology by analysing the steady-state changes in gene expression resulting from the systematic perturbation of a particular node in the network." [97]. However, they only apply their approach to simulated data and to a comparatively small biological system consisting of only 5 genes.

Synthetic networks

A powerful approach to test our understanding of gene regulatory networks is to build new networks from scratch in an approach called synthetic biology. Predictions of small models have been successfully tested experimentally using specifically engineered control circuits, such as feed forward loops [98] and feedback loops [99-103]. In a sense this is reverse engineering of a real world network. For a more detailed description see the reviews by Kaern et al. and Ball [104,105].

Summary and open questions

"If you torture the data long enough, Nature will confess." – Ronald Coase

At the basis of any modelling, including network modelling, there is a realisation and acceptance that a model describes only some properties of the 'real world' system, and ignores others. Thus it emphasizes particular aspects of reality, leaving out details that are not relevant for the purpose of the study.

How far are we from being able to build realistic cell models? The availability of large-scale data sets such as microarray gene expression and genomic localisation data triggered the search for suitable approaches to model complex biological systems. As the result of genome projects we are now able to compile parts lists on genome scale, though we do not know how many important categories in these parts lists are missing. Models describing the network topology are approaching the whole genome scale. High-throughput experiments, most notably microarrays, provide us with temporal information about transcriptional processes in time series experiments. These have been used to study control logics as well as some dynamics aspects of transcription regulation in processes such as the cell cycle [8,106,107], stress response [108,109], or galactose utilization [110]. Models have been built to explore the fundamentals for example of the cell cycle for yeast [65] and improvements in the understanding of genome wide dynamics of cell cycle have been made [111]. Nevertheless, high-throughput technologies have yet to have a direct impact on quantitative real time simulations of gene networks.

The function of about one third of all genes is still unknown for the yeast Saccharomyces cerevisiae despite it being one of the best-studied organisms. And even for many of the better-known genes and core processes that have been studied for decades, like the cell cycle, there is still not enough data available to exactly know all changes in concentration and activation patterns. Currently it seems not feasible to simulate even relatively simple cells like yeast. Mechanisms like RNA interference, regulated degradation of mRNAs and proteins, chemical modifications of key molecules and others might play a larger role than anticipated in current models, other processes might still be unknown. It is obvious that the separation into gene regulatory networks, metabolic networks and protein interaction networks is possible only up to a certain degree. To what extent can the transcription regulation networks be decoupled from other networks, such as signal transduction networks? We need to integrate many types of information if we want to build realistic dynamic models, however, for current modelling approaches we have to limit the complexity of the systems we are dealing with.

One possibility to reduce the complexity of biological systems depends on the modularity of the real world networks and their robustness (stability against changes of various network parameters and initial conditions). If the networks are modular and robust, it might be possible to build genome scale networks as sets of smaller modules. If we can find modules – units behaving independently of each other – it would be possible to build the complete model as a set of modules.

The belief that real world biological networks 'must be' robust and 'must be' modular is quite wide spread. However precise definitions of biological robustness and modularity and, moreover, the proofs of their presence remain elusive. The principles of modularity and robustness used in engineering are sometimes given as a reason that the same must be true in biological systems, but there are many examples when the 'designs' in nature, which are obtained by natural selection are different from the designs one would use in engineering. However, there are other arguments why biological networks could be modular, such as reuse of the components after genome duplications, but they are no proofs. There are indications that, on the dynamic level, network modules exist. For instance, cell growth can be decoupled from cell cycle in yeast (e.g., [112]), indicating that to some extent independent modules control these two processes. Similarly, the Drosophila developmental network indicates that the exact values of the model parameters may not be crucial in large-scale systems behaviour [85]. But to what extent can specific processes be decoupled from each other?

Another possibility to reduce complexity in network models depends on the importance of the exact values of parameters and substance concentrations. How much do the exact quantitative values, such as substance concentrations, matter in determining the more general patterns of system behaviour, such as cell differentiation? If we are not interested in predicting the exact concentrations of different substances, but only in the patterns of the systems behaviour such as steady states, we can often use simplified Boolean-type networks instead of differential equations [113] and hybrid models might offer "good enough" solutions.

The question "Is real time simulation on genome scale possible at all?" is still open. Obtaining high quality systematic quantitative data characterizing systems parameters such as mRNA, protein and metabolite concentrations, interactions and spatial and temporal localization of different molecules will be important. Nevertheless, the data will not provide new insights automatically. We believe that hypotheses expressed as rigorously defined models, the properties of which can be studied independently and tested on experimental data, will play an important role in understanding the living systems on genome-wide level. In any case, finding the right language for describing the models is a prerequisite for success.


This article is an extended version based on two earlier publications [1,2]. The project is funded by the European Commission by the DIAMONDS grants under the RTD programme "Quality of Life and Management of Living Resources".

This article has been published as part of BMC Bioinformatics Volume 8 Supplement 6, 2007: Otto Warburg International Summer School and Workshop on Networks and Regulation. The full contents of the supplement are available online at


  1. Schlitt T, Brazma A: Modelling gene networks at different organisational levels.

    FEBS Lett 2005, 579(8):1859-1866. PubMed Abstract | Publisher Full Text OpenURL

  2. Schlitt T, Brazma A: Modelling in molecular biology: describing transcription regulatory networks at different scales.

    Philos Trans R Soc Lond B Biol Sci 2006, 361(1467):483-494. PubMed Abstract | Publisher Full Text OpenURL

  3. Ashburner M, Ball CA, Blake JA, Botstein D, Butler H, Cherry JM, Davis AP, Dolinski K, Dwight SS, Eppig JT, et al.: Gene ontology: tool for the unification of biology. The Gene Ontology Consortium.

    Nat Genet 2000, 25(1):25-29. PubMed Abstract | Publisher Full Text OpenURL

  4. Dandekar T, Schuster S, Snel B, Huynen M, Bork P: Pathway alignment: application to the comparative analysis of glycolytic enzymes.

    Biochem J 1999, 343(Pt 1):115-124. PubMed Abstract | Publisher Full Text | PubMed Central Full Text OpenURL

  5. Pruess M, Fleischmann W, Kanapin A, Karavidopoulou Y, Kersey P, Kriventseva E, Mittard V, Mulder N, Phan I, Servant F, et al.: The Proteome Analysis database: a tool for the in silico analysis of whole proteomes.

    Nucleic Acids Res 2003, 31(1):414-417. PubMed Abstract | Publisher Full Text | PubMed Central Full Text OpenURL

  6. Overbeek R, Begley T, Butler RM, Choudhuri JV, Chuang HY, Cohoon M, de Crecy-Lagard V, Diaz N, Disz T, Edwards R, et al.: The subsystems approach to genome annotation and its use in the project to annotate 1000 genomes.

    Nucleic Acids Res 2005, 33(17):5691-5702. PubMed Abstract | Publisher Full Text | PubMed Central Full Text OpenURL

  7. Brazma A, Jonassen I, Vilo J, Ukkonen E: Predicting gene regulatory elements in silico on a genomic scale.

    Genome Res 1998, 8(11):1202-1215. PubMed Abstract | Publisher Full Text | PubMed Central Full Text OpenURL

  8. Rustici G, Mata J, Kivinen K, Lio P, Penkett CJ, Burns G, Hayles J, Brazma A, Nurse P, Bahler J: Periodic gene expression program of the fission yeast cell cycle.

    Nat Genet 2004, 36(8):809-817. PubMed Abstract | Publisher Full Text OpenURL

  9. Brazma A, Vilo J, Ukkonen E, Valtonen K: Data mining for regulatory elements in yeast genome.

    Proc Int Conf Intell Syst Mol Biol 1997, 5:65-74. PubMed Abstract OpenURL

  10. Werner T, Fessele S, Maier H, Nelson PJ: Computer modeling of promoter organization as a tool to study transcriptional coregulation.

    Faseb J 2003, 17(10):1228-1237. PubMed Abstract | Publisher Full Text OpenURL

  11. Dickmeis T, Muller F: The identification and functional characterisation of conserved regulatory elements in developmental genes.

    Brief Funct Genomic Proteomic 2005, 3(4):332-350. PubMed Abstract | Publisher Full Text OpenURL

  12. Sauer T, Shelest E, Wingender E: Evaluating phylogenetic footprinting for human-rodent comparisons.

    Bioinformatics (Oxford, England) 2006, 22(4):430-437. PubMed Abstract | Publisher Full Text OpenURL

  13. Balhoff JP, Wray GA: Evolutionary analysis of the well characterized endo16 promoter reveals substantial variation within functional sites.

    Proc Natl Acad Sci USA 2005, 102(24):8591-8596. PubMed Abstract | Publisher Full Text | PubMed Central Full Text OpenURL

  14. Galas DJ, Schmitz A: DNAse footprinting: a simple method for the detection of protein-DNA binding specificity.

    Nucleic Acids Res 1978, 5(9):3157-3170. PubMed Abstract | Publisher Full Text | PubMed Central Full Text OpenURL

  15. Fried M, Crothers DM: Equilibria and kinetics of lac repressor-operator interactions by polyacrylamide gel electrophoresis.

    Nucleic Acids Res 1981, 9(23):6505-6525. PubMed Abstract | Publisher Full Text | PubMed Central Full Text OpenURL

  16. Garner MM, Revzin A: A gel electrophoresis method for quantifying the binding of proteins to specific DNA regions: application to components of the Escherichia coli lactose operon regulatory system.

    Nucleic Acids Res 1981, 9(13):3047-3060. PubMed Abstract | Publisher Full Text | PubMed Central Full Text OpenURL

  17. Schlitt T, Brazma A: Learning about gene regulatory networks from gene deletion experiments.

    Comp Funct Genom 2002, 3:499-503. Publisher Full Text OpenURL

  18. Cormen TH, Leiserson CE, Rivest RL: Introduction to Algorithms. Cambridge, Mass.: MIT Press; 2001.

  19. Bornholdt S, Schuster HG, eds: Handbook of Graphs and Networks. 1st edition. Weinheim: Willey-VCH; 2003.

  20. Albert R, Barabási A-L: Statistical mechanics of complex networks.

    Reviews of Modern Physics 2002., 74(47) OpenURL

  21. de Silva E, Stumpf MP: Complex networks and simple models in biology.

    Journal of the Royal Society, Interface/the Royal Society 2005, 2(5):419-430. PubMed Abstract | Publisher Full Text OpenURL

  22. Schwikowski B, Uetz P, Fields S: A network of protein-protein interactions in yeast.

    Nat Biotechnol 2000, 18(12):1257-1261. PubMed Abstract | Publisher Full Text OpenURL

  23. Schlitt T, Palin K, Rung J, Dietmann S, Lappe M, Ukkonen E, Brazma A: From gene networks to gene function.

    Genome Res 2003, 13:2568-2576. PubMed Abstract | Publisher Full Text | PubMed Central Full Text OpenURL

  24. Harbison CT, Gordon DB, Lee TI, Rinaldi NJ, Macisaac KD, Danford TW, Hannett NM, Tagne JB, Reynolds DB, Yoo J, et al.: Transcriptional regulatory code of a eukaryotic genome.

    Nature 2004, 431(7004):99-104. PubMed Abstract | Publisher Full Text OpenURL

  25. Hughes TR, Marton MJ, Jones AR, Roberts CJ, Stoughton R, Armour CD, Bennett HA, Coffey E, Dai H, He YD, et al.: Functional discovery via a compendium of expression profiles.

    Cell 2000, 102(1):109-126. PubMed Abstract | Publisher Full Text OpenURL

  26. Rung J, Schlitt T, Brazma A, Freivalds K, Vilo J: Building and analysing genome-wide gene disruption networks.

    Bioinformatics (Oxford, England) 2002, 18(Suppl 2):S202-210. PubMed Abstract | Publisher Full Text OpenURL

  27. Manke T, Bringas R, Vingron M: Correlating protein-DNA and protein-protein interaction networks.

    Journal of molecular biology 2003, 333(1):75-85. PubMed Abstract | Publisher Full Text OpenURL

  28. von Mering C, Krause R, Snel B, Cornell M, Oliver SG, Fields S, Bork P: Comparative assessment of large-scale data sets of protein-protein interactions.

    Nature 2002, 417(6887):399-403. PubMed Abstract | Publisher Full Text OpenURL

  29. Albert R, Jeong H, Barabasi AL: Error and attack tolerance of complex networks.

    Nature 2000, 406(6794):378-382. PubMed Abstract | Publisher Full Text OpenURL

  30. Albert R, Jeong H, Barabasi AL: correction: Error and attack tolerance of complex networks.

    Nature 2001, 409(6819):542. OpenURL

  31. Han JD, Bertin N, Hao T, Goldberg DS, Berriz GF, Zhang LV, Dupuy D, Walhout AJ, Cusick ME, Roth FP, et al.: Evidence for dynamically organized modularity in the yeast protein-protein interaction network.

    Nature 2004, 430(6995):88-93. PubMed Abstract | Publisher Full Text OpenURL

  32. Luscombe NM, Babu MM, Yu H, Snyder M, Teichmann SA, Gerstein M: Genomic analysis of regulatory network dynamics reveals large topological changes.

    Nature 2004, 431(7006):308-312. PubMed Abstract | Publisher Full Text OpenURL

  33. Milo R, Shen-Orr S, Itzkovitz S, Kashtan N, Chklovskii D, Alon U: Network motifs: simple building blocks of complex networks.

    Science 2002, 298(5594):824-827. PubMed Abstract | Publisher Full Text OpenURL

  34. Teichmann SA, Babu MM: Gene regulatory network growth by duplication.

    Nat Genet 2004, 36(5):492-496. PubMed Abstract | Publisher Full Text OpenURL

  35. Hartwell LH, Hopfield JJ, Leibler S, Murray AW: From molecular to modular cell biology.

    Nature 1999, 402(6761 Suppl):C47-52. PubMed Abstract | Publisher Full Text OpenURL

  36. Schlosser G, Wagner GP: Modularity in development and evolution. 1st edition. Chicago: University of Chicago Press; 2004.

  37. Segal E, Shapira M, Regev A, Pe'er D, Botstein D, Koller D, Friedman N: Module networks: identifying regulatory modules and their condition-specific regulators from gene expression data.

    Nat Genet 2003, 34(2):166-176. PubMed Abstract | Publisher Full Text OpenURL

  38. Ihmels J, Friedlander G, Bergmann S, Sarig O, Ziv Y, Barkai N: Revealing modular organization in the yeast transcriptional network.

    Nat Genet 2002, 31(4):370-377. PubMed Abstract | Publisher Full Text OpenURL

  39. Wolf DM, Arkin AP: Motifs, modules and games in bacteria.

    Curr Opin Microbiol 2003, 6(2):125-134. PubMed Abstract | Publisher Full Text OpenURL

  40. Snel B, Huynen MA: Quantifying modularity in the evolution of biomolecular systems.

    Genome Res 2004, 14(3):391-397. PubMed Abstract | Publisher Full Text | PubMed Central Full Text OpenURL

  41. Stelzl U, Worm U, Lalowski M, Haenig C, Brembeck FH, Goehler H, Stroedicke M, Zenkner M, Schoenherr A, Koeppen S, et al.: A human protein-protein interaction network: a resource for annotating the proteome.

    Cell 2005, 122(6):957-968. PubMed Abstract | Publisher Full Text OpenURL

  42. Rual JF, Venkatesan K, Hao T, Hirozane-Kishikawa T, Dricot A, Li N, Berriz GF, Gibbons FD, Dreze M, Ayivi-Guedehoussou N, et al.: Towards a proteome-scale map of the human protein-protein interaction network.

    Nature 2005, 437(7062):1173-1178. PubMed Abstract | Publisher Full Text OpenURL

  43. Louis M, Becskei A: Binary and graded responses in gene networks.

    Sci STKE 2002, 2002(143):PE33. PubMed Abstract | Publisher Full Text OpenURL

  44. Yuh CH, Bolouri H, Davidson EH: Genomic cis-regulatory logic: experimental and computational analysis of a sea urchin gene.

    Science 1998, 279(5358):1896-1902. PubMed Abstract | Publisher Full Text OpenURL

  45. Davidson EH, Rast JP, Oliveri P, Ransick A, Calestani C, Yuh CH, Minokawa T, Amore G, Hinman V, Arenas-Mena C, et al.: A provisional regulatory gene network for specification of endomesoderm in the sea urchin embryo.

    Dev Biol 2002, 246(1):162-190. PubMed Abstract | Publisher Full Text OpenURL

  46. Klamt S, Saez-Rodriguez J, Lindquist JA, Simeoni L, Gilles ED: A methodology for the structural and functional analysis of signaling and regulatory networks.

    BMC Bioinformatics 2006, 7:56. PubMed Abstract | BioMed Central Full Text | PubMed Central Full Text OpenURL

  47. Soinov LA, Krestyaninova MA, Brazma A: Towards reconstruction of gene networks from expression data by supervised learning.

    Genome Biol 2003, 4(1):R6. PubMed Abstract | BioMed Central Full Text | PubMed Central Full Text OpenURL

  48. Friedman N, Linial M, Nachman I, Pe'er D: Using Bayesian networks to analyze expression data.

    J Comput Biol 2000, 7(3–4):601-620. PubMed Abstract | Publisher Full Text OpenURL

  49. Pe'er D, Regev A, Elidan G, Friedman N: Inferring subnetworks from perturbed expression profiles.

    Bioinformatics (Oxford, England) 2001, 17(Suppl 1):S215-224. PubMed Abstract | Publisher Full Text OpenURL

  50. Pournara I, Wernisch L: Reconstruction of gene networks using Bayesian learning and manipulation experiments.

    Bioinformatics (Oxford, England) 2004, 20(17):2934-2942. PubMed Abstract | Publisher Full Text OpenURL

  51. Pe'er D: Bayesian network analysis of signaling networks: a primer.

    Sci STKE 2005, 2005(281):pl4. PubMed Abstract | Publisher Full Text OpenURL

  52. Friedman N: Inferring cellular networks using probabilistic graphical models.

    Science 2004, 303(5659):799-805. PubMed Abstract | Publisher Full Text OpenURL

  53. Segal E, Wang H, Koller D: Discovering molecular pathways from protein interaction and gene expression data.

    Bioinformatics (Oxford, England) 2003, 19(Suppl 1):I264-I272. PubMed Abstract | Publisher Full Text OpenURL

  54. Ptashne M: A genetic switch; phage lambda and higher organisms. 2nd edition. Oxford: Blackwell Science; 1992.

  55. Greller LD, Somogyi R: Reverse engineers map the molecular switching yards.

    Trends Biotechnol 2002, 20(11):445-447. PubMed Abstract | Publisher Full Text OpenURL

  56. Szallasi Z, Liang S: Modeling the normal and neoplastic cell cycle with "realistic Boolean genetic networks": their application for understanding carcinogenesis and assessing therapeutic strategies.

    Pac Symp Biocomput 1998, 66-76. PubMed Abstract OpenURL

  57. Akutsu T, Miyano S, Kuhara S: Identification of genetic networks from a small number of gene expression patterns under the Boolean network model.

    Pac Symp Biocomput 1999, 17-28. PubMed Abstract OpenURL

  58. Liang S, Fuhrman S, Somogyi R: Reveal, a general reverse engineering algorithm for inference of genetic network architectures.

    Pac Symp Biocomput 1998, 18-29. PubMed Abstract OpenURL

  59. Pinney JW, Westhead DR, McConkey GA: Petri Net representations in systems biology.

    Biochem Soc Trans 2003, 31(Pt 6):1513-1515. PubMed Abstract | Publisher Full Text OpenURL

  60. Hardy S, Robillard PN: Modeling and simulation of molecular biology systems using petri nets: modeling goals of various approaches.

    J Bioinform Comput Biol 2004, 2(4):595-613. PubMed Abstract | Publisher Full Text OpenURL

  61. Moore JH, Boczko EM, Summar ML: Connecting the dots between genes, biochemistry, and disease susceptibility: systems biology modeling in human genetics.

    Mol Genet Metab 2005, 84(2):104-111. PubMed Abstract | Publisher Full Text OpenURL

  62. Steggles LJ, Banks R, Shaw O, Wipat A: Qualitatively modelling and analysing genetic regulatory networks: a Petri net approach.

    Bioinformatics (Oxford, England) 2007, 23(3):336-343. PubMed Abstract | Publisher Full Text OpenURL

  63. Chen T, He HL, Church GM: Modeling gene expression with differential equations.

    Pac Symp Biocomput 1999, 29-40. PubMed Abstract OpenURL

  64. D'Haeseleer P, Wen X, Fuhrman S, Somogyi R: Linear modeling of mRNA expression levels during CNS development and injury.

    Pac Symp Biocomput 1999, 41-52. PubMed Abstract OpenURL

  65. Tyson JJ, Csikasz-Nagy A, Novak B: The dynamics of cell cycle regulation.

    Bioessays 2002, 24(12):1095-1109. PubMed Abstract | Publisher Full Text OpenURL

  66. Smolen P, Baxter DA, Byrne JH: Modeling transcriptional control in gene networks–methods, recent results, and future directions.

    Bull Math Biol 2000, 62(2):247-292. PubMed Abstract | Publisher Full Text OpenURL

  67. Akutsu T, Miyano S, Kuhara S: Algorithms for inferring qualitative models of biological networks.

    Pac Symp Biocomput 2000, 293-304. PubMed Abstract OpenURL

  68. Mendoza L, Thieffry D, Alvarez-Buylla ER: Genetic control of flower morphogenesis in Arabidopsis thaliana: a logical analysis.

    Bioinformatics (Oxford, England) 1999, 15(7–8):593-606. PubMed Abstract | Publisher Full Text OpenURL

  69. Kauffman S: Homeostasis and differentiation in random genetic control networks.

    Nature 1969, 224(215):177-178. PubMed Abstract | Publisher Full Text OpenURL

  70. Kauffman SA: Investigations. Oxford University Press Inc, USA; 2002.

  71. Paul U, Kaufman V, Drossel B: Properties of attractors of canalyzing random Boolean networks.

    Phys Rev E Stat Nonlin Soft Matter Phys 2006, 73(2 Pt 2):026118. PubMed Abstract | Publisher Full Text OpenURL

  72. Akutsu T, Miyano S, Kuhara S: Inferring qualitative relations in genetic networks and metabolic pathways.

    Bioinformatics (Oxford, England) 2000, 16(8):727-734. PubMed Abstract | Publisher Full Text OpenURL

  73. Shmulevich I, Dougherty ER, Kim S, Zhang W: Probabilistic Boolean Networks: a rule-based uncertainty model for gene regulatory networks.

    Bioinformatics (Oxford, England) 2002, 18(2):261-274. PubMed Abstract | Publisher Full Text OpenURL

  74. Thomas R, Thieffry D, Kaufman M: Dynamical behaviour of biological regulatory networks–I. Biological role of feedback loops and practical use of the concept of the loop- characteristic state.

    Bull Math Biol 1995, 57(2):247-276. PubMed Abstract OpenURL

  75. Koch I, Junker BH, Heiner M: Application of Petri net theory for modelling and validation of the sucrose breakdown pathway in the potato tuber.

    Bioinformatics (Oxford, England) 2005, 21(7):1219-1226. PubMed Abstract | Publisher Full Text OpenURL

  76. Kuffner R, Zimmer R, Lengauer T: Pathway analysis in metabolic databases via differential metabolic display (DMD).

    Bioinformatics (Oxford, England) 2000, 16(9):825-836. PubMed Abstract | Publisher Full Text OpenURL

  77. Schuster S, Pfeiffer T, Moldenhauer F, Koch I, Dandekar T: Exploring the pathway structure of metabolism: decomposition into subnetworks and application to Mycoplasma pneumoniae.

    Bioinformatics (Oxford, England) 2002, 18(2):351-361. PubMed Abstract | Publisher Full Text OpenURL

  78. Maki Y, Tominaga D, Okamoto M, Watanabe S, Eguchi Y: Development of a system for the inference of large scale genetic networks.

    Pac Symp Biocomput 2001, 446-458. PubMed Abstract OpenURL

  79. Hatzimanikatis V: Nonlinear metabolic control analysis.

    Metab Eng 1999, 1(1):75-87. PubMed Abstract | Publisher Full Text OpenURL

  80. Wahde M, Hertz J: Modeling genetic regulatory dynamics in neural development.

    J Comput Biol 2001, 8(4):429-442. PubMed Abstract | Publisher Full Text OpenURL

  81. Brazhnik P, de la Fuente A, Mendes P: Gene networks: how to put the function in genomics.

    Trends Biotechnol 2002, 20(11):467-472. PubMed Abstract | Publisher Full Text OpenURL

  82. de Jong H: Modeling and simulation of genetic regulatory systems: a literature review.

    J Comput Biol 2002, 9(1):67-103. PubMed Abstract | Publisher Full Text OpenURL

  83. Smolen P, Baxter DA, Byrne JH: Mathematical modeling of gene networks.

    Neuron 2000, 26(3):567-580. PubMed Abstract | Publisher Full Text OpenURL

  84. van Someren EP, Wessels LF, Backer E, Reinders MJ: Genetic network modeling.

    Pharmacogenomics 2002, 3(4):507-525. PubMed Abstract | Publisher Full Text OpenURL

  85. von Dassow G, Meir E, Munro EM, Odell GM: The segment polarity network is a robust developmental module.

    Nature 2000, 406(6792):188-192. PubMed Abstract | Publisher Full Text OpenURL

  86. Hucka M, Finney A, Sauro HM, Bolouri H, Doyle JC, Kitano H, Arkin AP, Bornstein BJ, Bray D, Cornish-Bowden A, et al.: The systems biology markup language (SBML): a medium for representation and exchange of biochemical network models.

    Bioinformatics (Oxford, England) 2003, 19(4):524-531. PubMed Abstract | Publisher Full Text OpenURL

  87. Goss PJ, Peccoud J: Quantitative modeling of stochastic systems in molecular biology by using stochastic Petri nets.

    Proc Natl Acad Sci USA 1998, 95(12):6750-6755. PubMed Abstract | Publisher Full Text | PubMed Central Full Text OpenURL

  88. Matsuno H, Inouye ST, Okitsu Y, Fujii Y, Miyano S: A new regulatory interaction suggested by simulations for circadian genetic control mechanism in mammals.

    J Bioinform Comput Biol 2006, 4(1):139-153. PubMed Abstract | Publisher Full Text OpenURL

  89. McAdams HH, Shapiro L: Circuit simulation of genetic networks.

    Science 1995, 269(5224):650-656. PubMed Abstract | Publisher Full Text OpenURL

  90. Ruklisa D, Brazma A, Viksna J: Reconstruction of gene regulatory networks under the Finite State Linear Model.

    Genome informatics 2005, 16(2):225-236. PubMed Abstract OpenURL

  91. Brazma A, Schlitt T: Reverse engineering of gene regulatory networks: a finite state linear model.

    Genome Biology 2003, 4(6):P5. BioMed Central Full Text OpenURL

  92. Ptashne M: A Genetic Switch – Phage lambda and Higher Organisms. 2nd edition. Oxford: Cell Press & Blackwell Science; 1992.

  93. Holstege FC, Jennings EG, Wyrick JJ, Lee TI, Hengartner CJ, Green MR, Golub TR, Lander ES, Young RA: Dissecting the regulatory circuitry of a eukaryotic genome.

    Cell 1998, 95(5):717-728. PubMed Abstract | Publisher Full Text OpenURL

  94. McAdams HH, Arkin A: Stochastic mechanisms in gene expression.

    Proc Natl Acad Sci USA 1997, 94(3):814-819. PubMed Abstract | Publisher Full Text | PubMed Central Full Text OpenURL

  95. Raser JM, O'Shea EK: Control of stochasticity in eukaryotic gene expression.

    Science 2004, 304(5678):1811-1814. PubMed Abstract | Publisher Full Text | PubMed Central Full Text OpenURL

  96. Paulsson J: Summing up the noise in gene networks.

    Nature 2004, 427(6973):415-418. PubMed Abstract | Publisher Full Text OpenURL

  97. Tegner J, Yeung MK, Hasty J, Collins JJ: Reverse engineering gene networks: integrating genetic perturbations with dynamical modeling.

    Proc Natl Acad Sci USA 2003, 100(10):5944-5949. PubMed Abstract | Publisher Full Text | PubMed Central Full Text OpenURL

  98. Basu S, Mehreja R, Thiberge S, Chen MT, Weiss R: Spatiotemporal control of gene expression with pulse-generating networks.

    Proc Natl Acad Sci USA 2004, 101(17):6355-6360. PubMed Abstract | Publisher Full Text | PubMed Central Full Text OpenURL

  99. Becskei A, Seraphin B, Serrano L: Positive feedback in eukaryotic gene networks: cell differentiation by graded to binary response conversion.

    EMBO J 2001, 20(10):2528-2535. PubMed Abstract | Publisher Full Text | PubMed Central Full Text OpenURL

  100. Becskei A, Serrano L: Engineering stability in gene networks by autoregulation.

    Nature 2000, 405(6786):590-593. PubMed Abstract | Publisher Full Text OpenURL

  101. Elowitz MB, Leibler S: A synthetic oscillatory network of transcriptional regulators.

    Nature 2000, 403(6767):335-338. PubMed Abstract | Publisher Full Text OpenURL

  102. Gardner TS, Cantor CR, Collins JJ: Construction of a genetic toggle switch in Escherichia coli.

    Nature 2000, 403(6767):339-342. PubMed Abstract | Publisher Full Text OpenURL

  103. Kobayashi H, Kaern M, Araki M, Chung K, Gardner TS, Cantor CR, Collins JJ: Programmable cells: interfacing natural and engineered gene networks.

    Proc Natl Acad Sci USA 2004, 101(22):8414-8419. PubMed Abstract | Publisher Full Text | PubMed Central Full Text OpenURL

  104. Ball CA, Jin H, Sherlock G, Weng S, Matese JC, Andrada R, Binkley G, Dolinski K, Dwight SS, Harris MA, et al.: Saccharomyces Genome Database provides tools to survey gene expression and functional analysis data.

    Nucleic Acids Res 2001, 29(1):80-81. PubMed Abstract | Publisher Full Text | PubMed Central Full Text OpenURL

  105. Kaern M, Blake WJ, Collins JJ: The engineering of gene regulatory networks.

    Annu Rev Biomed Eng 2003, 5:179-206. PubMed Abstract | Publisher Full Text OpenURL

  106. Cho RJ, Campbell MJ, Winzeler EA, Steinmetz L, Conway A, Wodicka L, Wolfsberg TG, Gabrielian AE, Landsman D, Lockhart DJ, et al.: A genome-wide transcriptional analysis of the mitotic cell cycle.

    Mol Cell 1998, 2(1):65-73. PubMed Abstract | Publisher Full Text OpenURL

  107. Spellman PT, Sherlock G, Zhang MQ, Iyer VR, Anders K, Eisen MB, Brown PO, Botstein D, Futcher B: Comprehensive identification of cell cycle-regulated genes of the yeast Saccharomyces cerevisiae by microarray hybridization.

    Mol Biol Cell 1998, 9(12):3273-3297. PubMed Abstract | Publisher Full Text | PubMed Central Full Text OpenURL

  108. Chen D, Toone WM, Mata J, Lyne R, Burns G, Kivinen K, Brazma A, Jones N, Bahler J: Global transcriptional responses of fission yeast to environmental stress.

    Mol Biol Cell 2003, 14(1):214-229. PubMed Abstract | Publisher Full Text | PubMed Central Full Text OpenURL

  109. Gasch AP, Spellman PT, Kao CM, Carmel-Harel O, Eisen MB, Storz G, Botstein D, Brown PO: Genomic expression programs in the response of yeast cells to environmental changes.

    Mol Biol Cell 2000, 11(12):4241-4257. PubMed Abstract | Publisher Full Text | PubMed Central Full Text OpenURL

  110. Ideker T, Thorsson V, Ranish JA, Christmas R, Buhler J, Eng JK, Bumgarner R, Goodlett DR, Aebersold R, Hood L: Integrated genomic and proteomic analyses of a systematically perturbed metabolic network.

    Science 2001, 292(5518):929-934. PubMed Abstract | Publisher Full Text OpenURL

  111. de Lichtenberg U, Jensen LJ, Brunak S, Bork P: Dynamic complex formation during the yeast cell cycle.

    Science 2005, 307(5710):724-727. PubMed Abstract | Publisher Full Text OpenURL

  112. Jorgensen P, Nishikawa JL, Breitkreutz BJ, Tyers M: Systematic identification of pathways that couple cell growth and division in yeast.

    Science 2002, 297(5580):395-400. PubMed Abstract | Publisher Full Text OpenURL

  113. Thomas R: Boolean formalization of genetic control circuits.

    J Theor Biol 1973, 42(3):563-585. PubMed Abstract | Publisher Full Text OpenURL