 Research
 Open Access
 Published:
Bayesian inference based modelling for gene transcriptional dynamics by integrating multiple source of knowledge
BMC Systems Biology volume 6, Article number: S3 (2012)
Abstract
Background
A key challenge in the post genome era is to identify genomewide transcriptional regulatory networks, which specify the interactions between transcription factors and their target genes. Numerous methods have been developed for reconstructing gene regulatory networks from expression data. However, most of them are based on coarse grained qualitative models, and cannot provide a quantitative view of regulatory systems.
Results
A binding affinity based regulatory model is proposed to quantify the transcriptional regulatory network. Multiple quantities, including binding affinity and the activity level of transcription factor (TF) are incorporated into a general learning model. The sequence features of the promoter and the possible occupancy of nucleosomes are exploited to estimate the binding probability of regulators. Comparing with the previous models that only employ microarray data, the proposed model can bridge the gap between the relative background frequency of the observed nucleotide and the gene's transcription rate.
Conclusions
We testify the proposed approach on two realworld microarray datasets. Experimental results show that the proposed model can effectively identify the parameters and the activity level of TF. Moreover, the kinetic parameters introduced in the proposed model can reveal more biological sense than previous models can do.
Background
A challenge facing molecular biology is to develop quantitative, predictive models of gene regulation. The advance of highthroughput microarray technique makes it possible to measure the expression profiles of thousands of genes, and genomewide microarray datasets are collected, providing a way to reveal the complex regulatory mechanism among cells. There are two broad classes of gene regulatory interactions: one based on the 'physical interaction' that aim at identifying relationships among transcription factors and their target genes (genetosequence interaction) and another based on the 'influence interaction' that try to relate the expression of a gene to the expression of the other genes in the cell (genetogene interaction).
In recent years, researchers have proposed many different computational approaches to reconstruct gene regulatory networks from highthroughput data, e.g. see reviews by Bansal et al. and Markowetz and Spang [1, 2]. These approaches fall roughly into two categories: qualitative and quantitative aspects. Inferring qualitative regulatory networks from microarray data has been well studied, and a number of effective approaches have been developed [3–10]. However, these methods are based on coarse grained qualitative models [11, 12], and cannot provide a realistic and quantitative view of regulatory systems. On the other hand, quantitative modelling for gene regulatory network is in its infancy. Research on quantitative models for genetic regulation has arisen only in recent years, and most of them are based on classical statistical techniques. Liebermeister et al. [13] proposed a linear model for cell cyclerelated gene expression in yeast based on independent component analysis. Holter et al. [14] employ singular value decomposition to uncover the fundamental patterns underlying gene expression profiles. Pournara et al. [15] and Yu et al. [16] proposed the Factor analysis model to describe a larger number of observed variables. However, these approaches are based on linear regression, and are not always being consistent with the observations in biochemical experiments which are nonlinear. Imoto et al. [17] proposed a nonlinear model with heterogeneous error variances. This model matches the microarray data well but it is not satisfying enough in revealing more biological sense. Segal et al. [18] proposed a transcription control network based model and apply their model to the segmentation gene network of Drosophila melanogaster. They reveal that positional information is encoded in the regulatory sequence and input factor distribution. However, there is still a little bit of dilemma in the model: the activity level of transcription factors is difficult to be measured or to be identified. Actually, assaying the transcription factors' activity state in a dynamic fashion is a major obstacle to the wider application of the kinetic modeling. TFs' activity levels are difficult to measure mainly due to two technical limitations: TFs are often present at low intercellular concentrations and the changes in their activity state can occur rapidly due to posttranslational modifications.
Based on the above description, this paper aims to describe the transcriptional regulatory network quantitatively. In this work, a Bayesian inference based regulatory model is proposed to quantify the transcriptional dynamics. Multiple quantities, including binding energy, binding affinity and the activity level of transcription factor are incorporated into a general learning model. The sequence features of the promoter and the occupancy of nucleosomes are exploited to derive the binding energy. Compared with the previous models, the proposed model can reveal more biological sense.
Results
Case Ι: Circadian patterns in rat liver
Circadian rhythm is a daily timekeeping mechanism fundamental to a wide range of species. The basic molecular mechanism of circadian rhythm has been studied extensively. As a real example to test our approach, we considered the dynamics of the circadian patterns in rat liver. We employ the datasets from Almon et al [19]. This experiment was designed to examine fluctuations in gene expression in liver within the 24 hour circadian cycle in normal animals. Fiftyfour male normal Wistar rats were housed in a strictly controlled stress free environment with light: dark cycles of 12 hr: 12 hr. Three animals were sacrificed at each of 18 selected time points within the 24 hour cycle. RNA was prepared from livers for gene arrays. Time point designations reflect time after lights on in hours. For details, please refer to Table S1 in additional file 1.
Analysis of the predicted activity levels of transcription factors
To test the proposed model on the above dataset, we employ two important transcriptional regulators of which activity levels indicate the variation of heat signals in a subset of gene circadian network, hsf1 and ppara. In total, we selected 7 genes to perform posterior inference of TF activities. To ensure identifiability, we included three genes that are regulated solely by hsf1 (HSP110, HSPA8 and COL4A1), and two genes that are regulated solely by ppara (ACSL1 and HMGCS1). The remaining two genes are jointly regulated by hsf1 and ppara. These genes were chosen since they exhibit the largest variance in the microarray time course, and hence are likely to provide a cleaner representation of the output of the system.
The inferred TFs' activity levels are shown in Figure 1(a) and 1(b). Both inferred TF profiles show a noisy periodic behaviour [20]. Figure 1(c) gives the values of the parameters k_{i} for the four selected circadian genes (HSPA8, ACSL1, HSP90AA1 and HSPA1B). The green column represents the response k_{1} to hsf1 alone, the red column is the response k_{2} to ppara alone and the black column represents the joint response k_{12}. It can be seen that, for gene, HSPA8, the model predicts a clear activation by hsfl alone, which is consistent with the experimental conclusion from Yan et al [20]. The black columns of HSP90AA1 and HSPA1B demonstrate that the model predicts a significant combinatorial activation which can be verified by mutagenetic techniques, i.e. by knocking out one of the TFs.
The biological sense of kinetic parameters
Table 1 shows the relationship between scaling parameter k and the corresponding binding affinity φ. In table 1, 'H' indicates 'high' and 'L' indicates 'low'. We define the scaling parameter ki as 'High' if it is bigger than the mean value, as 'low', otherwise, and the same to binding affinity φ. From Table 1, we can find that, for most case, the scaling parameter is in accordance with the binding affinity: High scaling parameter coupling with high binding affinity, vice versa. However, gene COL4A1 and HSP110 are 2 exceptions: they have high scaling parameter but low binding affinity. Our view is that low binding affinity but high value for k_{ i } might represent a TF which rarely binds to promoter but can strongly regulate gene expression when bound.
Figure 2 shows the results of inference on the values of the parameters c_{j} and ω_{j}. The columns on the left, shaded red, show results from our model and the white columns are the estimates obtained by the method of Barenco et al. [21]. The parameters were assigned a vague gamma prior distribution (a = b = 0.2, corresponding to a mean of 1 and a variance of 5). The results are in good accordance with the results obtained by Barenco et. a l [21]. We can find that the parameters c_{j} and ω_{j} obtained by our method have smaller variance than that of Barenco et al. Figure 3 shows the fit of the model to the observed data at each timepoint.
Case II: A yeast synthetic network for in vivo assessment
Validation of gene regulation network (GRN) inference methods has traditionally been done using in silico networks. However, depending on how realistic the choice of an in silico model is, this kind of validation approach has obvious limitations. To our knowledge, rarely the underlying model from which artificial/simulated data is generated is realistic enough. Real biological networks are fairly complex chemical reaction network models. In simulation setting one typically adds noise on top of a hypothetical simulation model, but the noise characteristics may not be realistic enough. Also, simulation models tend to be overly simplistic when compared to e.g. real gene regulatory networks. Data measured from a real biological system is, real. To overcome these problems, we use the IRMA network to evaluate out model. The IRMA network is a synthetically constructed GRN in the Saccharomyces cerevisiae genome [22], which is designed to be maximally independent in such a way that genes in the network are not regulated by genes outside of the network (i.e. by other yeast genes). However, genes in the IRMA network may regulate other genes in the genome. The network consists of five genes and there are positive and negative feedback loops and one protein to protein interaction, shown as Figure 4. Although the IRMA network contains only five genes, there are studies suggesting that the performance on smaller networks typically generalize to larger networks [1, 23]. The data samples were collected every 20 min up to 5 hr in five independent experiments for the switchon state, and every 10 min up to 3 hr in four independent experiments for the switchoff state. For details on the construction of the network and experimental procedures, we refer to [22]. One of the purposes of the IRMA network is to provide a realistic benchmark set for computational studies by providing mRNAlevel measurements from a known GRN. To our knowledge, the IRMA network and dataset are the first of a kind that are meant for validation purposes. Besides, we assume that mRNA decay rates may be genespecific, but remain constant in time [36]. The sequences of all promoters are retrieved from SCPD and SGD database. The scanning region ranges from 800 to +50 bp of each target gene.
Analysis of the predicted activity levels of transcription factors
To evaluate whether the proposed model can effectively learn the TFs' activity level and the regulation type, we first evaluate the model using the switchon time series data. The inferred TFs' activity levels are shown in Figure 5(a) and 5(b). Both inferred TF profiles show a noisy switchon behavior. Figure 5(c) gives the values of the parameters ki for the five target genes. The green column represents the response to the first regulator alone, the red column is the response to the second regulator alone and the black column represents the joint response, k_{12}. It can be seen that, for gene, GAL80, the model predicts a clear activation by swi5 which is consistent with the experimental conclusion [22]. For gene CBF1, the red downward column indicates that ash1 behaves as a repressor, which is verified in [22]. The black column of CBF1 demonstrates that the model predicts a significant combinatorial regulation [22].
Analysis of the kinetic parameters
Table 2 shows the relationship between scaling parameter k and the corresponding binding affinity φ. In table 2, the definition of 'High' and 'Low' are same as in Table 1, and the same abbreviations are employed. It can be found that gene GAL80 has the TF that rarely binds to promoter but can strongly upregulate its expression when bound.
Figure 6 shows the results of inference on the values of the parameters c_{j} and ω_{j}. The columns on the left, shaded red, show results from our model and the white columns are the estimates obtained by Opper et al. [24]. It can be found that the results are in good accordance with the results obtained by the method of Opper et Al. [24]. It can be found that the parameters c_{j} and ω_{j} obtained by our method have smaller variance than that of Opper et al. [24].
For comparison, we also evaluate the model using the switchoff data. Figure 7 shows the fit of the model to the observed data at each timepoint for both the switchon case and switchoff case.
Discussion
In this study, two realworld microarray datasets were exploited two evaluate the efficiency of the proposed model. Comparison shows that the kinetic parameters obtained by our method have smaller variance than that of Barenco et al. [21]. One reason is that the proposed model provides a principled method for the incorporation of prior biological knowledge. This may be in the form of suitable ranges for kinetic parameters, known kinetic parameter values and suitable distributions on measurement noise. Besides, it is possible for the proposed model to circumvent the need for expensive samplingbased inference and a TFA profile can be inferred over all time, rather than just at the discrete timepoints at which expression was measured.
The Bayesian inference based model of transcription rates and regulator activity levels allows us to handle these biologically relevant quantities despite the indirect measurement of the former and the lack of measurements of the latter. It also allows us to handle the inherently noisy measurement in a principled way. However, the proposed model still abstracts away some of the explicit processes that generate the actual observed expression data. A more explicit modelling of these will provide a more principled treatment of different sources of noise in the data. Furthermore, this model does not handle directly the upstream events that affect regulator activity. In fact, the current model is an open loop system, such that the regulation of regulator activity is itself viewed as exogenous to the system. By developing a richer modeling language we may capture more complex reaction models, model the upstream regulation of activity levels, and identify systems that involve feedback mechanisms and signalling networks.
PostTranscriptional Modification Model (PTMM) have been previously used to model TF activities [25]; in that work, further dependencies were included between TF mRNA expression levels and their predicted activities, which enabled to predict possible posttranscriptional modifications in TFs. Naturally, it should be possible to combine both our approach and their approach to give a model capable of simultaneously inferring TF activities, combinatorial interactions and post transcriptional regulations.
Conclusions
In this work, we have proposed a computational model to reverse engineer simultaneously both the activity of TFs and the logical structure of promoters by integrating multiple sources of knowledge, including timeseries gene expression data, TFs' binding information and sequence features of promoters. The approach relies on a detailed model of transcription, which is an approximation to the MichaelisMenten model from classical enzyme kinetics, and therefore should be able to capture accurately the effects that changes in TF activity have on gene expression dynamics. We testify the proposed approach on two realworld microarray datasets. Experimental results show that the proposed model can effectively identify the parameters and the activity level of TF. Moreover, the kinetic parameters introduced in the proposed model can reveal more biological sense than previous models can do.
Methods
Problem statement
A microarray experiment only measures the "observed" quantities, as shown in Figure 8, whereas the other quantities are not observed ("hidden"). The dashed oval encloses the closest quantities on the path between the TF and the target gene. Consider a transcriptional network of n genes that are regulated by m regulators, as well as a timedependent external signal. Given the structure G and a set X of transcription rates of these genes in T time points, is it possible to reconstruct the timevarying activity level of m regulators, R, at all time points and the corresponding model parameters? This is an infinite dimensional problem that we tackle by placing a stochastic process prior over the activities of regulators.
Our approach relies on a continuous time, differential equation description of transcriptional dynamics where TFs are treated as latent on/off variables and are modelled using a switching stochastic process. The framework of the proposed method is shown in the Figure 9.
Kinematic model of regulation
Compared with the gene expression level, the gene transcription rate can capture more dynamic characteristics of transcription regulation. We here employ the transcription rate to model the regulation function. We first assume:

The derived transcription rates are average rates over a cell population.

The speed of a TF's binding to or dissociation from its target sites is assumed to be much more rapid than the transcription process, thus rapidequilibrium approximation can be used.
Based on the above assumptions, the transcription rate of a gene is proportional to the amount of the gene bound by its regulators in all genes of the measured cell population. We first consider the case that a gene is regulated by a single activator. The corresponding regulation function can be properly described by MichaelisMenten equation:
here x represents the mRNA concentration for a particular gene, r(t) the concentration of active TF, β and d are kinetic constants, c a baseline expression rate and ω the mRNA decay rate.
To incorporate the sequence feature and the TF binding preference into the model, we set the binding affinity φ = k/d, and (1) can be reformulated as
here k is a scaling parameter.
We now take the regulation involving two regulators into account. Denote by r_{1}(t) and r_{2}(t) the concentration of two regulators, φ_{1} and φ_{2} the binding affinity of two regulators from their own target sites, the regulation function can be written as below:
Considering the general case, a gene is regulated by n regulators. There are 2^{n} different binding states in total. The ndimension binary vector is employed to indicate a certain binding state, e.g., a 4dimension vector (0 1 0 1) indicates that the second and the fourth regulators are bound to their own target sites while the first and the third are not bound. The regulation function can be written as:
where S_{j} denotes the set of all 2^{n} possible state vectors, and s_{i} is the i_{th} element of the state vector s.
Modelling for binding affinity
Measuring affinities of molecular interactions in highthroughput format remains problematic, especially for transient and lowaffinity interactions. We here try to describe the landscape of binding affinity in the perspective of binding energy between the various DNAbinding molecules and their target genes. Binding affinity landscapes describe how each molecule translates an input DNA sequence into a binding potential that is specific to that molecule. The presented framework models several important aspects of the binding process.
By allowing molecules to bind anywhere along the input sequence, the entire range of affinities is considered, thereby allowing contributions from both strong and weak binding sites [26, 27].

Conventional cooperative binding interactions can be explicitly modelled by assigning higher statistical weights to configurations in which two molecules are bound in close proximity.

The cooperativity that arises between factors when both nucleosomes and transcription factors are integrated is captured automatically [28].
We first consider the simplest case that there is only one target site S_{ij} for TF i in the promoter of gene j:
The sitespecific binding affinity is given by
where C_{i} is a constant, E_{ij} the binding free energy between TF_{i} and the promoter of gene j, k and T are the Boltzmann constant and temperature, respectively.
The above case can be expanded to the general case that binding may happen in anywhere along the input sequence and the accessibility of target sites varies due to the occupancy of nucleosomes. The general binding affinity is modelled as
where p^{(n)}_{ ij } is the probability of transcription factor i binding to the nth binding site in the promoter of gene j. Note that the derivation of p^{(n)}_{ ij } involves the information of the possible occupancy of nucleosomes. The nucleosomes positions can be predicted based on the nucleosomeDNA interaction model proposed by Kaplan et al [29]. Figure 10(b) shows the occupancy of nucleosomes for the genomic sequence shown in the Figure 10(a).
Since the positional weight matrices (PWM) are often used to represent the sequence motif [30, 31], we estimate the binding energy in perspective of PWM. As the background information has been taken into the PWM, the binding free energy can be approximately calculated as below:
where ${{J}^{n}}_{l}=\left\{\begin{array}{c}1\mathsf{\text{}}if\mathsf{\text{}}n=s\left(l\right)\\ 0\mathsf{\text{otherwise}}\end{array}\right.$
here K^{(q)} is the scaling factor, M*_{L} indicates the maximum background frequency in the motif, s(l) is the nucleotide in position l.
Regulatory network modelling using dynamic Bayesian inference
In many biological processes, the transcription factor transit from inactive to active state quickly as a consequence of fast posttranslational modifications, (the time scale is micro second), so it is reasonable that we model the TF activity as a binary variable r(t) ∈{0,1}[24, 32].
For the regulation involving a single regulator, the TF activity can be seen as a two states Markov Jump Process. Based on Ref [24, 33], the probability of the system being in a particular state at a given time is given by the following Master equation:
here p_{1}(t) = p(r(t) = 1), p_{0}(t) = p(r(t) = 0) and n_{±} indicates the transition rate.
The observed expression data is often assumed to be normally distributed [24]. We now define a noise model that relates the predicted mRNA concentration to the observed expression data, as shown in Figure 11.
Setting y_{j}(t) as the observations of mRNA species j at time t, x_{j}(t) the predicted expression and σ_{j} the variation, the noise model can be described as
Based on Refs [24, 33], we define the TF's switching stochastic process as the prior distribution, then we combine the prior distribution and the noise model (likelihood) into Bayes' theorem to obtain the posterior over the process:
where y denotes collectively the observations, Ω are the parameters involved in the regulation function and S a normalization constant.
Variational inference and model optimization
We will use a variational formulation of the inference problem [34]. Variational inference is a powerful inference method and it has been well applied for optimization by Opper and Sanguinetti [24, 33]. Our model optimization is based on Ref [22]. Variational inference is used as an approximation technique: given an intractable probability distribution p, the variational approach finds an optimal approximation q within a certain family of distributions. This is usually done by minimizing the KullbackLeibler (KL) divergence between the two distributions
By selecting a suitable family of approximating distributions, the inference problem is then turned into an optimization problem. It can be shown that the KL divergence is a convex functional of q and is equal to zero iff q = p [24, 35]. In this case, we will choose the approximating process q to be again a Markov Jump Process, so that the required KL is given by
here S is a normalization constant, E_{ q }[log p(yr, Ω)] the expectation of the likelihood of the observations under the approximating process.
According to Ref [24], minimization of the KL functional (11) can be represented as the saddle point problem
here τ is auxiliary variables. It can be found that this functional is concave in τ and convex in q. Hence we can exchange min and max. Performing the max first yields the result. This also shows that there is only a unique saddle point solution.
The optimization procedure is based on a forwardbackward procedure, leading to ordinary differential equations which can iteratively be solved. Taking the regulation involving two regulators for example, the free energy is a functional of both the approximating processes q^{1}, q^{2} and their transition rates n_{1}, n_{2}. However, these are not independent, but are related by the Master equation. To incorporate this constraint, we add Lagrange multipliers as
where g_{1} and g_{2} are the rates of jumps from the 0 to the 1 state for process q^{1} and q^{2}, respectively.
The Lagrange multiplier functions obey the final condition λ(T) = 0. Estimation of the parameters A and b can be done directly by maximizing the approximate marginal likelihood E_{q}[logp(yr,Ω)]. The framework of the inference is shown in the Figure 12.
References
 1.
Bansal M, Belcastro V, AmbesiImpiombato A, di Bernardo D: How to infer gene networks from expression profiles. Mol Syst Biol. 2007, 3: 78
 2.
Markowetz F, Spang R: Inferring cellular networks  a review. BMC Bioinformatics. 2007, 8 (Sul 6): S5
 3.
Eisen MB, Spellman PT, Brown PO, Bostein D: Cluster analysis and display of genomewide expression patterns. Proc Natl Acad Sci USA. 1998, 95: 1486314868. 10.1073/pnas.95.25.14863.
 4.
Davidich M, Bornholdt S: Boolean network model predicts cell cycle sequence of fission yeast. PLoS One. 2008, 3: e167210.1371/journal.pone.0001672.
 5.
Lahdesmaki H, Shmulevich I, YliHarja O: On learning gene regulatory networks under the Boolean network model. Mach Learn. 2004, 52: 147167.
 6.
Imoto S, Goto T, Miyano S: Estimation of genetic networks and functional structures between genes by using Bayesian networks and nonparametric regression. Pac Symp Biocomput. 2002, 175186.
 7.
Kirimasthong K, Manorat A: Inference of gene regulatory network by Bayesian network using MetropolisHastings Algorithm. Proceedings of 3rd International Conference on Advanced Data Mining and Alications: 0608 Aug, 2007; Harbin. Edited by: Alhajj R, Gao H. 2007, 276286.
 8.
Segal E, Taskar B, Gasch A, Friedman N, Koller D: Rich probabilistic models for gene expression. Bioinformatics. 2001, 17 (Suppl 1): S243S252. 10.1093/bioinformatics/17.suppl_1.S243.
 9.
Hu Z, Killion P, Iyer V: Genetic reconstruction of a functional transcriptional regulatory network. Nat Genet. 2007, 39: 683687. 10.1038/ng2012.
 10.
Luscombe N, Babu M, Yu H: Genomic analysis of regulatory network dynamics reveals large topological changes. Nature. 2004, 431: 308312. 10.1038/nature02782.
 11.
Werhli AV, Husmeier D: Reconstructing gene regulatory networks with Bayesian networks by combining expression data with multiple sources of prior knowledge. Stat Appl Genet Mol Biol. 2007, 6: Article15
 12.
Segal E, Barash Y, Simon I, Friedman N: From promoter sequence to expression: a probabilistic framework. Proceedings of the Sixth Annual International Conference on Computational Biology: 1821 April 2002; Washington. Edited by: Myers G, Hannenhalli S, Istrail S. 2002, 263272.
 13.
Liebermeister W: Linear modes of gene expression determined by independent component analysis. Bioinformatics. 2002, 18: 5160. 10.1093/bioinformatics/18.1.51.
 14.
Holter N, Mitra M, Maritan A: Fundamental patterns underlying gene expression profiles: simplicity from complexity. Proc Natl Acad Sci USA. 2000, 97: 84098414. 10.1073/pnas.150242097.
 15.
Pournara I, Wernisch L: Factor analysis for gene regulatory networks and transcription factor activity profiles. BMC Bioinformatics. 2007, 8: 6110.1186/14712105861.
 16.
Yu T, Li K: Inference of transcriptional regulatory network by twostage constrained space factor analysis. Bioinformatics. 2005, 21: 40334038. 10.1093/bioinformatics/bti656.
 17.
Imoto S, Kim S, Goto T: Bayesian network and nonparametric heteroscedastic regression for nonlinear modeling of genetic network. J Bioinform Comput Biol. 2003, 1 (2): 231252. 10.1142/S0219720003000071.
 18.
Segal E, RavehSadka T, Schroeder M, Unnerstall U, Gaul U: Predicting expression patterns from regulatory sequence in Drosophila segmentation. Nature. 2008, 451: 535540. 10.1038/nature06496.
 19.
Almon RR, Yang E, Lai W, Androulakis IP: Circadian variations in rat liver gene expression: relationships to drug actions. J Pharmacol Exp Ther. 2008, 326: 700716. 10.1124/jpet.108.140186.
 20.
Yan J, Wang HF, Liu YT, Shao CX: Analysis of Gene Regulatory Networks in the Mammalian Circadian Rhythm. Plos Comput Biol. 2008, 4 (10): e100019310.1371/journal.pcbi.1000193.
 21.
Barenco M, Tomescu D, Brewer D, Callard R, Stark J, Hubank M: Ranked prediction of p53 targets using hidden variable dynamic modelling. Genome Biol. 2006, 7 (3): R2510.1186/gb200673r25.
 22.
Cantone I, Marucci L, Iorio F, et al: A yeast synthetic network for in vivo assessment of reverse engineering and modelling aroaches. Cell. 2009, 137: 172181. 10.1016/j.cell.2009.01.055.
 23.
Stolovitzky G, Monroe D, Califano A: Dialogue on reverseengineering assessment and methods: the DREAM of highthroughput pathway inference. Ann N Y Acad Sci. 2007, 1115: 122. 10.1196/annals.1407.021.
 24.
Opper M, Sanguinetti G: Learning combinatorial transcriptional dynamics from gene expression data. Bioinformatics. 2010, 26 (13): 16231629. 10.1093/bioinformatics/btq244.
 25.
Shi Y, Klutstein M, Simon I, Mitchell T, BarJoseph Z: A combined expressioninteraction model for inferring the temporal activity of transcription factors. J Comput Biol. 2009, 16: 10351049. 10.1089/cmb.2009.0024.
 26.
Gertz J, Siggia E, Cohen B: Analysis of combinatorial cisregulation in synthetic and genomic promoters. Nature. 2002, 457: 215218. 10.1038/nature07521.
 27.
Tanay A: Extensive lowaffinity transcriptional interactions in the yeast genome. Genome Res. 2006, 16: 962972. 10.1101/gr.5113606.
 28.
Johnson SM, Tan FJ, McCullough HL, Riordan DP, Fire AZ: Flexibility and constraint in the nucleosome core landscape of Caenorhabditis elegans chromatin. Genome Res. 2006, 16: 15051516. 10.1101/gr.5560806.
 29.
Kaplan N, Moore IK, FondufeMittendorf Y, et al: The DNAEncoded Nucleosome Organization of a Eukaryotic Genome. Nature. 2008, 458: 362366.
 30.
Bulyk ML: Computational prediction of transcriptionfactor binding site locations. Genome Biol. 2003, 5 (1): 20110.1186/gb200351201.
 31.
Naum I, Gary D, Ilya P: Computational technique for improvement of the positionweight matrices for the DNA/protein binding sites. Nucleic Acids Res. 2005, 33: 22902301. 10.1093/nar/gki519.
 32.
Cai L, Friedman N, Sunney X: Stochastic protein expression in individual cells at the single molecule level. Nature. 2006, 440: 580586. 10.1038/440580a.
 33.
Ocone A, Sanguinetti G: Reconstructing transcription factor activities in hierarchical transcription network motifs. Bioinformatics. 2011, 27 (20): 28732879. 10.1093/bioinformatics/btr487.
 34.
Guido S, Andreas R, Manfred O, Cedric A: Switching regulatory models of cellular stress response. Bioinformatics. 2009, 25: 12801286. 10.1093/bioinformatics/btp138.
 35.
Cover T, Thomas J: Elements of information theory. 2006, Wiley, New York
 36.
Wang YL, Liu CL, Storey JD, et al: Precision and functional specificity in mRNA decay. Proc Natl Acad Sci USA. 2002, 99: 58605865. 10.1073/pnas.092538799.
 37.
Shuman S: Structure, mechanism, and evolution of the mRNA capping apparatus. Prog Nucleic Acid Res Mol Biol. 2001, 66: 140.
Acknowledgements
This work was supported by a GRF project from Hong Kong SAR (CityU 117310) and the grant from NNSF China (51175519).
This article has been published as part of BMC Systems Biology Volume 6 Supplement 1, 2012: Selected articles from The 5th IEEE International Conference on Systems Biology (ISB 2011). The full contents of the supplement are available online at http://www.biomedcentral.com/bmcsystbiol/supplements/6/S1.
Author information
Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors' contributions
SQW proposed the method, performed the analysis; HXL supervised the work and revised the paper critically for important intellectual content.
Electronic supplementary material
Rights and permissions
This article is published under license to BioMed Central Ltd. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Wang, SQ., Li, HX. Bayesian inference based modelling for gene transcriptional dynamics by integrating multiple source of knowledge. BMC Syst Biol 6, S3 (2012). https://doi.org/10.1186/175205096S1S3
Published:
Keywords
 Transcription Factor Activity
 Transcription Rate
 Transcriptional Regulatory Network
 Variational Inference
 mRNA Decay Rate