# Anomaly detection in gene expression via stochastic models of gene regulatory networks

^{1}Intelligent Systems Networks Group, Electrical and Electronic Engineering Department, Imperial College London, UK

^{}Corresponding author.

#### Supplement

#### Conference

## Abstract

### Background

The steady-state behaviour of gene regulatory networks (GRNs) can provide crucial evidence for detecting disease-causing genes. However, monitoring the dynamics of GRNs is particularly difficult because biological data only reflects a snapshot of the dynamical behaviour of the living organism. Also most GRN data and methods are used to provide limited structural inferences.

### Results

In this study, the theory of stochastic GRNs, derived from G-Networks, is applied to GRNs in order to monitor their steady-state behaviours. This approach is applied to a simulation dataset which is generated by using the stochastic gene expression model, and observe that the G-Network properly detects the abnormally expressed genes in the simulation study. In the analysis of real data concerning the cell cycle microarray of budding yeast, our approach finds that the steady-state probability of CLB2 is lower than that of other agents, while most of the genes have similar steady-state probabilities. These results lead to the conclusion that the key regulatory genes of the cell cycle can be expressed in the absence of CLB type cyclines, which was also the conclusion of the original microarray experiment study.

### Conclusion

G-networks provide an efficient way to monitor steady-state of GRNs. Our method produces more reliable results then the conventional *t*-test in detecting differentially expressed genes. Also G-networks are successfully applied to the yeast GRNs. This study will be the base of further GRN dynamics studies cooperated with conventional GRN inference algorithms.

## Background

Identifying the key features and dynamics of gene regulatory networks (GRNs) is an important step towards understanding behaviours of biological systems. Thanks to the development of high-throughput technology, the amount of microarray gene expression data has greatly increased, and numerous mathematical models attempt to explain gene regulations using gene networks [1,2]. Once a network structure is inferred, its dynamics needs to be considered. However, most methods focus on the inference of network structure which only provides a snapshot of a given dataset. Probabilistic Boolean Networks (PBNs) represent the dynamics of GRNs [3], but PBNs are limited by the computational complexity of the related algorithms [4].

In [5], a new approach to the steady-state analysis of GRNs based on G-Network theory [6,7] is proposed, while G-Networks were firstly applied to GRNs with simplifying assumptions concerning gene expression in [8]. However, the G-Network approach also exhibits specific difficulties because of the large number of parameters that are needed to compute their steady-state solution. Thus, in this study we reduce the number of model parameters on the basis of biological assumptions and focus on estimating two parameters in particular: the total input rate and steady-state probability of a gene.

A G-Network is a probabilistic queuing network having special customers which include positive and negative "customers", signals and triggers [6,7]. It was originally developed also as a model of stochastic neuronal networks [9] with "negative and positive signals or spikes" which represent inhibition and excitation. In terms of GRNs, a queue is a "place" in which mRNAs are stored, and an mRNA can be considered to be a "customer" of the G-Network. The positive and negative signals are interpreted as the protein activities such as transcription factors, inducers and repressors. Note that the customers or signals of the G-Network can be any biological molecules. However, in our study, we focus on behaviours of mRNAs because the available GRN data are usually mRNA expressions. Each queue has an input and service rates which represent a transcription and degradation processes, respectively. Our interest is to estimate the steady-state probability that a queue is busy, which corresponds to the probability that an mRNA is present, and we are also interested in the total mRNA input rate of each queue. To evaluation the accuracy of the proposed method, we generated a simple simulation dataset by using the stochastic gene expression models processed with the widely accepted Gillespie algorithm [10,11]. We also examine a real biological dataset obtained from the cell cycle of the budding yeast [12].

Although queueing theory is a common computational tool, G-Networks are an essential departure from queueing theory; in particular conventional queues could not be possibly applied to GRNs because the notion of inhibition does not exist in queueing theory but was introduced by G-Network theory. There are two other essential novelties in our work. First, our approach enables us to obtain the steady-state of GRNs with only polynomial computational complexity due to the product form solution of G-Networks; the computational cost due to large memory space and non-polynomial computational complexity are basic limitations in conventional methods such as PBN. Also our method can provide more reliable measures to detect differentially expressed genes in microarray analysis (as shown in our simulation study).

### G-networks and gene regulatory networks

The GRN model used in this study is the probabilistic gene regulatory model introduced in [5]. In this model, let *K*_{i}(*t*) be integer-valued random variables which represent a quantity (mRNA) of the gene *i *at time *t*. If the *K*_{i}(*t*) is zero, the gene *i *cannot interact with other genes. Then we have the following Probabilities,

where Λ_{i }is the total input rate (sum of transcription rate, *λ*_{i }and increment rate of mRNAs come from outside of system, *I*_{i}), *μ*_{i }is the service rate (e.g. Degradation rate of mRNAs). *o*(Δ*t*) → 0 as *t *→ 0. Let *r*_{i }is representing the activity (signal process) rate of each gene *i*. Then 1/*r*_{i }is the average time between successive interactions of gene *i *with other genes. If the *i*th gene interacts with other genes, the following events occur:

• With probability *P*^{+ }(*i*, *j*), gene *i *activates gene *j*; when this happens, *K*_{i}(*t*) is depleted by 1 and *K*_{j}(*t*) is increased by 1

• With probability *P*^{- }(*i*, *j*), gene *i *inhibits gene *j*; when this happens, both *K*_{i}(*t*) and *K*_{j}(*t*) are depleted by 1

• With probability *Q*(*i*, *j*, *l*) gene *i *joins with gene *j *to act upon gene *l *in excitatory mode, as a result of which both *K*_{i}(*t*) and *K*_{j}(*t*) are reduced by 1, while *K*_{l}(*t*) is increased by 1

• With probability *d*_{i}, which is defined as follow,

the signal of gene *i *exits the system so *K*_{i}(*t*) is depleted by 1

Let's define a random process **K**(*t*) = [*K*_{1}(*t*), ..., *K*_{n}(*t*)], *t *≥ 0 and an *n*-vector of non-negative integers **k **= [*k*_{1}, ..., *k*_{n}]. The *P *(**k**, *t*) is the probability that **K**(*t*) takes **k **at time *t*, *P *(**k**, *t*) = *P *(**K**(*t*) = **k**). Then the probability that **K**(*t*) have **k **at time *t *+ Δ*t *is defined by

where is a vector that the value of *i*th element is *k*_{i }+ 1 (*k*_{i }- 1) and *I*(*x*) is indicator function which is 1 if the condition, *x*, is satisfied or 0 other wise. The first and second terms describe the increment and decrement of the length of queue *i*, respectively. Third term is the probability that the gene *i *is activated but nothing is happened except queue *i *lose one mRNA. From fourth to sixth terms are the probabilities that gene *i *is activated and interacts with gene *j*. The rest terms of (1) represent the probabilities that the interaction of gene *i *and gene *j *affect the gene *l *(length of *l*th queue). Divide (1) by Δ*t *and introduce the equilibrium probability distribution of the system *P*(*k*) = *lim*_{t → ∞ }*P *(**k**, *t*) then we obtain following dynamic behaviour,

Now, let's consider following equations, and

Where *q*_{i }(= /(*r*_{i }+ )) represents the probability that gene *i *is expressed in steady-state. Using (2) and (3), E. Gelenbe showed the following product form is satisfied [5,7].

where for any subset *I * 1, ..., *n *such that *q*_{m}*<*1 for each *m * *I*, and *I*{*m*_{1}, ..., *m*_{|I|}}.

## Results and discussion

### Simple gene regulatory networks using stochastic gene expression model

In order to assess our G-Network model, we construct a simple GRN structure and generate the expression data using a synthetic stochastic gene expression model [13,14]. This stochastic gene expression model has several important features such as protein dimerization [15] and time delay for protein signalling [13]. Figure Figure11 shows the simulated network structure which is based on the following basic principles: the number of proteins per cell chases the number of mRNAs which in turn chases the number of active genes [14]. Figure Figure22 depicts the assumptions of our model and (5)~(11) give the corresponding processes (RPo: RNA open complex, Pro: promoter, R: mRNA, P: protein monomer, PP: protein dimmer, 0: degradation, *t*: time, and Δ*t*: time increment):

**Simple gene regulatory network structure**. The simulation study performed with the four gene GRN structure. Each gene inhibits its neighbor gene.

**Assumptions for the stochastic gene expressions**. There are total 10 processes (Transcription, Translation, mRNA degradation, Dimerization, Monomerization, Monomer degradation, Dimer degradation, Time delay for protein activation, DNA-protein association/disassociation)

**...**

where *i*, *j * {*A*, *B*, *C*, *D*} in Figure Figure1.1. In addition, we assume that proteins such as transcription factors and repressors require accumulation times for their activation [11,13], and use the modified Gillespie algorithm to generate the expression data [10,11]. The cell growth rate and cell volume are fixed, and we consider five cells. Detailed parameters are summarized in Table Table11 with their references.

The transcription process in (5) follows an exponential distribution with transcription initiation rate *λ*_{2 }[16]. The translation processes are given in (6) and include direct competition between the ribosome binding site and the RNAse-E binding site which degrade the mRNAs. Thus the translation process follows a geometric distribution with probability *p *and busting size *b *= *p*(1 - *p*) [13,16]. *T*_{D }is the average time interval between successive competitions, and the number of surviving mRNAs *n*_{2 }in the population after transcription is blocked with *n*_{2 }= *n*_{2,0 }. This is equal to *T*_{half }= -(*log*(2)/*log*(*p*))*T*_{D }[13]. Thus the translation initiation rate, *λ*_{3 }= 1/*T*_{D}, can be computed. The protein dimer association and disassociation rates are *k*_{a2 }and *k*_{d2}, respectively, as shown in (7) and (8) [17]. We also consider the DNA-protein association and disassociation rates (*k*_{a1 }and *k*_{d2 }in (9) and (10), respectively) [18]. The degradation rate of mRNA and of proteins are obtained by using the half-life of each molecule (11) [16,17].

We generate three sets of expression data (Dataset 1, 2, and 3); each dataset has two groups, the normal and the case group. These groups are obtained with the same parameter values except for the transcription initiation rate of *G*_{A }in case group is 0.0012 *sec*^{-1 }which is half of the transcription rate in normal group, 0.0025 *sec*^{-1}. Both groups are simulated during 3000 seconds. In order to compare these two groups, we perform not only the G-Network analysis but also the *t*-test which is widely used to find differentially expressed genes in microarray analysis. Datasets 1 and 2 consist of 50 samples each which are drawn from all the data points. In Dataset 1, the expression of *G*_{A }is significantly different (*p*-value of *t*-test *<*0.01 in Table Table2)2) while the difference of the *G*_{A }expression in Dataset 2 is not significant. The third dataset consists of 500 samples which are randomly chosen from the original observations.

Table Table22 summarizes the results of the three datasets. In the case groups of Datasets 1 and 2, both the *q*_{A }and Λ_{A }have the lowest values among the four nodes while the *t*-test of the *G*_{A }expression in Dataset 2 shows that it is not significant (*p*-value = 0.202). In the small sample results (Datasets 1 and 2), our method provides consistent results with large sample analysis (Dataset 3). The ratios (case/normal) also show that the *q*_{A }and Λ_{A}, in the case group, are smaller than one while the other ratios stay around one. In Dataset 3, the *p*-value of *G*_{B }is significant along with that of *G*_{A }because the expression of *G*_{A }directly affects the expression of *G*_{B}. However, *G*_{B }is not the causal gene in this study. Our G-Network analysis reveals that only *G*_{A }has lower *q *and Λ values than other nodes including *G*_{B}. All these results concur with the simulation data generated with one half of the normal transcription rate.

### Modeling cell cycle gene regulatory networks in budding yeast

The cell cycle regulated transcription and its overall controls have been studied in detail for budding yeast [19]. Recent developments in high-throughput microarray techniques help to reveal many of yeast genes controlling the cell cycle [20] which consists of four distinct phases: Gap1 (G1), Synthesis (S), Gap2 (G2), and Mitosis (M). The cells grow during their G1 and G2 phases and their DNA is replicated during the S phase. In the M phase, cell growth stops and the cell divides into two daughter cells that include nuclear division. Many genes are involved with specific cell cycle phases, but the number of key regulators that are responsible for the control of the cell cycle process is much smaller. Thus, based on published information, we build a cell cycle GRN with the key regulators in budding yeast as shown in Figure Figure3,3, although the relationships that contribute to the true regulatory network structure of the cell cycle still remain uncertain. Therefore we simplify the cell cycle network structure by selecting thirteen key regulatory genes (the gray circles in Figure Figure3)3) and connect the genes without regard to the transcriptional and post-transcriptional processes. Figure Figure44 shows the reconstructed regulatory network structure.

**Cell cycle regulatory network structure in budding yeast**. The genes are represented by circles. Complex molecules consisted of two more proteins are represented by a white rectangle. The gray and black boxes are transcription and post-transcription processes,

**...**

**Cell cycle regulatory network structure with selected 13 genes**. Each node represents a queue. Signals are transferred through the edges. Solid and dashed lines are positive and negative interactions, respectively.

The activity of cyclin-dependent kinases (CDKs) plays an important role in controlling periodic events during cell cycle. Some studies of cell cycle with high-throughput technologies have suggested alternative regulation models of periodic transcription [20]. D. Olando et., al. [12] measured the transcription levels of cell cycle related genes with the use of Yeast 2.0 oligonucleotide array and determined the manner in which transcription factor networks contribute to CDKs and to global regulation of the cell-cycle transcription process. This microarray dataset is used in our study with the cell cycle network structure of Figure Figure4;4; it consists of two groups: one group is obtained from wild-type (WT) cells and the other is from cyclin-mutant (CM) cells which are disrupted for all S-phase and mitotic cyclins (mutate clb1, 2, 3, 4, 5, and 6).

The microarray data consist of a total of 30 data points taken over 270 minutes. We subdivide it into five states (groups), each consisting of 6 data points. The expression levels are transformed by taking the natural logarithm. Figure Figure55 depicts the transformed expression profiles of the 13 genes with 5 states. The black and gray solid lines are the expression profiles from WT and CM cells, respectively, and S1, S2, ..., S5 represent the five states. It is obvious that the profiles of CLB2 are different between WT and CM cells because the CM dataset is designed to monitor the cell cycle processes without the clb cyclines.

**Expression profiles of selected 13 genes**. The black and gray lines represent the wild-type (WT) and clb-mutant (CM) groups' expression levels.

Table Table33 summarizes the steady-state probabilities of 13 genes in the cell cycle GRN. All genes have similar steady-state probabilities in the WT and CM cell groups except for CLB2 in the CM group, which has a lower steady-state probability than the elements of the WT group: as shown in Table Table3,3, the ratio of CM/WT is smaller than one (bold letter). This smaller probability can be explained by considering the experimental design of the CM dataset which is obtained without clb cyclines. Also, the original study of this dataset suggested alternative cell cycle regulatory pathways in [12] which had revealed that over 70% of the cell cycle related genes were expressed periodically without the clb cyclines. In our results, the steady-state probabilities of the CM group are consistent with that of the WT group. These results draw the same conclusion as the original study, i.e. that the steady-state of the 12 genes does not entirely depend on the expression of CLB2. Table Table44 shows the estimated total input rate of the 13 genes. These results also show that only the input rates of CLB2 decrease in the CM group.

## Conclusion

This paper has used the G-Network approach [5-8] to model GRNs. Two model parameters, the steady-state probability, *q*_{i}, and the total input rate, Λ_{I}, are estimated by determining the boundary of Λ_{i }and using a grid search. We first use simulated gene expression data generated on the basis of a stochastic gene expression model. Two groups (normal and case) of expression data are examined. These two groups are exactly the same except for one parameter, the transcription initiation rate. We have observed that the G-Network based method is able to detect the abnormally expressed genes, while the *t*-test produces false positives. Then, using real data, we have observed that the steady-state probability of CLB2 is lower than that of other agents and concluded that the key genes of cell cycle regulation can be expressed without the clb cyclines; this result is consistent with the original experimental study.

However, the unchanged steady-state probabilities in all the five states may need to be considered, because the cell cycle has four phases (G1, S, G2, M) and expressions of genes involved with a specific phase are expected to be different from those in other phases. Also the small decrease rate and relatively large total input rates of CLB2 may require a more careful analysis of the G-Network approach in relation to cell cycle GRN structure. The manner in which we have used G-Network models in this paper did not currently include simultaneous interactions with three or more nodes. However this is not really a limiting effect of the model, since it suffices to include chain representations of dependencies in the G-Network model as has been done for neuronal networks [9] to cover excitatory and inhibitory effects that involve three or more nodes, and in fact random chains of nodes of any length. Although in this study the probabilities that gene *i *affect gene *j*, *P*^{+ }(*i*, *j*) and *P*^{- }(*i*, *j*) in (3), are fixed at the value one, we think that the conventional reverse engineering GRN methods using the "Ensemble" method [21] can provide these probabilities more accurately for an improved steady-state analysis of GRNs.

In conclusion, our study has illustrated the use of G-Networks as a new approach for the steady-state analysis of GRNs, and has shown their usefulness in obtaining quantities such as the effective transcription rate and the steady-state probabilities, using them to detect differentially expressed genes, thus introducing a new approach which differs from more conventional microarray analysis methods. Future research will investigate the ensemble approaches to GRNs [21] based on the G-Network methodology in [5], which will allow to infer GRN structures, and also to monitor their steady-state behaviour.

## Methods

Once a GRN structure is determined, it is necessary to estimate the total input rate (Λ_{i}) of *i*th queue and its steady-state probability, (*q*_{i}). For the simplicity, the probabilities, *P*^{+ }(*i*, *j*), *P*^{- }(*i*, *j*), and *Q*(*i*, *j*, *l*) in (3) are set to be one. Then, it can be rewritten as follows

In (12), the Λ_{i }and *R*_{i }is the total input (Λ_{i }= *λ*_{i }+ *I*_{i}) and total output rates (*R*_{i }= *r*_{i }+ *μ*_{i}), respectively. is a function of activation probabilities of genes which affect to gene *i *positively and is a function of activation probabilities of genes which affect to gene *i *negatively. We fix the *r*_{i }as the number of out degrees of gene *i *and the degradation rate of mRNA, *i*, as a constant (Table (Table1)1) because the total output rate, *R*_{i }is not our interest. Therefore, we need to estimate two parameters, the total input rate, Λ_{i}, and the steady-state probability, *q*_{i}.

Let is the lower bound of the Λ_{i}, which is larger than zero. The lower bound of total input is regarded as an initial transcription rate without any external input. In this study, we use = 0.0025 [16]. The upper bound of Λ_{i } is obtained by assuming inputs from other nodes are zero and the queues fully work. That is

where the probabilities and are one.

Let is the initial value of *q*_{i}. Then can be obtained as follow,

where *x*_{ij }is the observed expression level (number of mRNAs) of *i*th gene at the *j*th observation and max(*x*_{ij}) is the maximum value among all observed values of *i*th gene. Let Λ_{iu }is a value of total input rate between the lower bound and the upper bound of Λ_{i }(). Then the steady-state probability *q*_{i }can be obtained numerically by solving (12) with the and the Λ_{iu}. Once the steady-state probability is determined, the log-likelihood of the given model can be computed by using (4) which is the same form of the likelihood of geometric distribution. It is known that the log-likelihood of geometric distribution is convex so we choose appropriate value Λ_{i }which maximizes the log-likelihood function.

For each value of total input, Λ_{iu }(), we compute the steady-state probability, *q*_{iu}, with initial value, , and obtain the log-likelihood score, log *L*_{iu}, which is used to choose the optimal *I *total input rate, ,

Note that the *q*_{iu }is a numerical solution of (12) with initial value, , and total input rate, Λ_{iu}. In order to compute , the initial value, in (13) is substituted by which is a numerical solution of (12) with initial value, , and total input rate, . Then the steady-state probability of gene *i*, *q*_{i}, can be obtained by updating its value iteratively until the *d*^{(t) }<*δ *where *d*^{(t) }is the difference between and at *t*th iteration. In this study, *δ *is 0.0001.

## Competing interests

The authors declare that they have no competing interests.

## Authors' contributions

Haseong Kim developed the data analysis techniques including synthetic data generation and tested the models on the data. He wrote the first draft of the paper.

E. Gelenbe developed the G-Network models and the specific application of these models to GRNs. He rewrote the paper for submission, and then finalised the accepted paper in preparation for its publication.

## Note

Other papers from the meeting have been published as part of *BMC Bioinformatics* Volume 10 Supplement 15, 2009: Eighth International Conference on Bioinformatics (InCoB2009): Bioinformatics, available online at http://www.biomedcentral.com/1471-2105/10?issue=S15.

## Acknowledgements

Some of this research has been supported by the EU FP7 DIESIS Project.

This article has been published as part of *BMC Genomics *Volume 10 Supplement 3, 2009: Eighth International Conference on Bioinformatics (InCoB2009): Computational Biology. The full contents of the supplement are available online at http://www.biomedcentral.com/1471-2164/10?issue=S3.

## References

- Friedman N, Linial M, Nachman I, Pe'er D. Using Bayesian networks to analyze expression data. Journal of computational biology. 2000;7(3-4):601–620. doi: 10.1089/106652700750050961. [PubMed] [Cross Ref]
- Schafer J, Strimmer K. An empirical Bayes approach to inferring large-scale gene association networks. Bioinformatics. 2005;21(6):754–764. doi: 10.1093/bioinformatics/bti062. [PubMed] [Cross Ref]
- Shmulevich I, Gluhovsky I, Hashimoto R, Dougherty E, Zhang W. Steady-state analysis of genetic regulatory networks modelled by probabilistic Boolean networks. Comparative and Functional Genomics. 2003;4(6):601–608. doi: 10.1002/cfg.342. [PMC free article] [PubMed] [Cross Ref]
- Ching W, Zhang S, Ng M, Akutsu T. An approximation method for solving the steady-state probability distribution of probabilistic Boolean networks. Bioinformatics. 2007;23(12):1511. doi: 10.1093/bioinformatics/btm142. [PubMed] [Cross Ref]
- Gelenbe E. Steady-state solution of probabilistic gene regulatory networks. J Theor Biol Phys Rev E. 2007;76:031903. doi: 10.1103/PhysRevE.76.031903. [PubMed] [Cross Ref]
- Gelenbe E. Product-form queueing networks with negative and positive customers. Journal of Applied Probability. 1991. pp. 656–663. [Cross Ref]
- Gelenbe E. G-networks with triggered customer movement. Journal of Applied Probability. 1993. pp. 742–748. [Cross Ref]
- Arazi A, Ben-Jacob E, Yechiali U. Bridging genetic networks and queueing theory. Physica A: Statistical Mechanics and its Applications. 2004;332:585–616. doi: 10.1016/j.physa.2003.07.009. [Cross Ref]
- Gelenbe E, Timotheou S. Random neural networks with synchronized interactions. Neural Computation. 2008;20(9):2308–2324. doi: 10.1162/neco.2008.04-07-509. [PubMed] [Cross Ref]
- Gillespie D. Exact stochastic simulation of coupled chemical reactions. The journal of physical chemistry. 1977;81(25):2340–2361. doi: 10.1021/j100540a008. [Cross Ref]
- Bratsun D, Volfson D, Tsimring L, Hasty J. Delay-induced stochastic oscillations in gene regulation. Proc Natl Acad Sci U S A. 2005;102(41):14593–14598. doi: 10.1073/pnas.0503858102. [PMC free article] [PubMed] [Cross Ref]
- Orlando D, Lin C, Bernard A, Wang J, Socolar J, Iversen E, Hartemink A, Haase S. Global control of cell-cycle transcription by coupled CDK and network oscillators. Nature. 2008;453(7197):944–947. doi: 10.1038/nature06955. [PMC free article] [PubMed] [Cross Ref]
- McAdams H, Arkin A. Stochastic mechanisms in gene expression. 1997. [PMC free article] [PubMed]
- Paulsson J. Models of stochastic gene expression. Physics of life reviews. 2005;2(2):157–175. doi: 10.1016/j.plrev.2005.03.003. [Cross Ref]
- Ribeiro A, Zhu R, Kauffman S. A general modeling strategy for gene regulatory networks with stochastic dynamics. Journal of Computational Biology. 2006;13(9):1630–1639. doi: 10.1089/cmb.2006.13.1630. [PubMed] [Cross Ref]
- Thattai M, van Oudenaarden A. Intrinsic noise in gene regulatory networks. Proc Natl Acad Sci U S A. 2001;98(15):8614–8619. doi: 10.1073/pnas.151588598. [PMC free article] [PubMed] [Cross Ref]
- Buchler N, Gerland U, Hwa T. Nonlinear protein degradation and the function of genetic circuits. Proc Natl Acad Sci U S A. 2005;102(27):9559–9564. doi: 10.1073/pnas.0409553102. [PMC free article] [PubMed] [Cross Ref]
- Goeddel D, Yansura D, Caruthers M. Binding of synthetic lactose operator DNAs to lactose repressors. Proc Natl Acad Sci U S A. 1977;74(8):3292–3296. doi: 10.1073/pnas.74.8.3292. [PMC free article] [PubMed] [Cross Ref]
- Bloom J, Cross F. Multiple levels of cyclin specificity in cell-cycle control. Nature Reviews Molecular Cell Biology. 2007;8(2):149–160. doi: 10.1038/nrm2105. [PubMed] [Cross Ref]
- Fink G, Spellman P, Sherlock G, Zhang M, Iyer V, Anders K, Eisen M, Brown P, Botstein D, Futcher B. Comprehensive identification of cell cycle-regulated genes of the yeast Saccharomyces cerevisiae by microarray hybridization. Molecular biology of the cell. 1998;9(12):3273–3297. [PMC free article] [PubMed]
- Kim H, Lee J, Park T. Inference of Large Scale Gene Regulatory Networks Using Regressionbased Approach. Journal of Bioinformatics and Computational Biology. 2009. in press . [PubMed]
- Golding I, Paulsson J, Zawilski S, Cox E. Real-time kinetics of gene activity in individual bacteria. Cell. 2005;123(6):1025–1036. doi: 10.1016/j.cell.2005.09.031. [PubMed] [Cross Ref]

**BioMed Central**

## Formats:

- Article |
- PubReader |
- ePub (beta) |
- PDF (452K) |
- Citation

- Stochastic Boolean networks: an efficient approach to modeling gene regulatory networks.[BMC Syst Biol. 2012]
*Liang J, Han J.**BMC Syst Biol. 2012 Aug 28; 6:113. Epub 2012 Aug 28.* - Scalable steady state analysis of Boolean biological regulatory networks.[PLoS One. 2009]
*Ay F, Xu F, Kahveci T.**PLoS One. 2009 Dec 1; 4(12):e7992. Epub 2009 Dec 1.* - On the transient and steady-state estimates of interval genetic regulatory networks.[IEEE Trans Syst Man Cybern B Cybern. 2010]
*Li P, Lam J, Shu Z.**IEEE Trans Syst Man Cybern B Cybern. 2010 Apr; 40(2):336-49. Epub 2009 Oct 23.* - Molecular network dynamics of cell cycle control: transitions to start and finish.[Methods Mol Biol. 2011]
*Csikász-Nagy A, Palmisano A, Zámborszky J.**Methods Mol Biol. 2011; 761:277-91.* - Dynamical approaches to modeling developmental gene regulatory networks.[Birth Defects Res C Embryo Today. 2009]
*Geard N, Willadsen K.**Birth Defects Res C Embryo Today. 2009 Jun; 87(2):131-42.*

- Extending Asia Pacific bioinformatics into new realms in the "-omics" era[BMC Genomics. ]
*Ranganathan S, Eisenhaber F, Tong JC, Tan TW.**BMC Genomics. 10(Suppl 3)S1*

- Anomaly detection in gene expression via stochastic models of gene regulatory ne...Anomaly detection in gene expression via stochastic models of gene regulatory networksBMC Genomics. 2009; 10(Suppl 3)S26

Your browsing activity is empty.

Activity recording is turned off.

See more...