Skip to main content

Identifying regulatory targets of cell cycle transcription factors using gene expression and ChIP-chip data

Abstract

Background

ChIP-chip data, which indicate binding of transcription factors (TFs) to DNA regions in vivo, are widely used to reconstruct transcriptional regulatory networks. However, the binding of a TF to a gene does not necessarily imply regulation. Thus, it is important to develop methods to identify regulatory targets of TFs from ChIP-chip data.

Results

We developed a method, called Temporal Relationship Identification Algorithm (TRIA), which uses gene expression data to identify a TF's regulatory targets among its binding targets inferred from ChIP-chip data. We applied TRIA to yeast cell cycle microarray data and identified many plausible regulatory targets of cell cycle TFs. We validated our predictions by checking the enrichments for functional annotation and known cell cycle genes. Moreover, we showed that TRIA performs better than two published methods (MA-Network and MFA). It is known that co-regulated genes may not be co-expressed. TRIA has the ability to identify subsets of highly co-expressed genes among the regulatory targets of a TF. Different functional roles are found for different subsets, indicating the diverse functions a TF could have. Finally, for a control, we showed that TRIA also performs well for cell-cycle irrelevant TFs.

Conclusion

Finding the regulatory targets of TFs is important for understanding how cells change their transcription program to adapt to environmental stimuli. Our algorithm TRIA is helpful for achieving this purpose.

Background

By organizing the genes in a genome into transcriptional regulatory modules (TRMs), a living cell can coordinate the activities of many genes and carry out complex functions. Therefore, identifying TRMs is useful for understanding cellular responses to internal and external signals. Advances in high-throughput tools such as DNA microarray [1, 2] and chromatin immunoprecipitation-chip (ChIP-chip) [3, 4] have made the computational reconstruction of TRMs of a eukaryotic cell possible.

Genome-wide gene expression analysis has been used to investigate TRMs controlling a variety of cellular processes in yeast [5–9]. Clustering and motif-discovering algorithms have been applied to gene expression data to find sets of co-regulated genes and have identified plausible binding motifs of their TFs [7, 10, 11]. Such approaches have also been expanded to incorporate existing knowledge about the genes, such as cellular functions [12] or promoter sequence motifs [13]. Moreover, some researchers used model-based approaches such as random Boolean networks [14] and Bayesian networks [15, 16] to infer regulatory network architectures. However, this approach provides only indirect evidence of genetic regulatory interactions and does not identify the relevant TFs.

On the other hand, the ChIP-chip technique was developed to identify physical interactions between TFs and DNA regions. Using ChIP-chip data, Simon et al. [17] investigated how the yeast cell-cycle gene-expression program is regulated by each of nine major transcriptional activators. Lee et al. [18] constructed a network of TF-gene interactions and Harbison et al. [19] constructed an initial map of yeast's transcriptional regulatory code. However, a weakness in the ChIP-chip technique is that the binding of a TF to a gene does not necessarily imply regulation. A TF may bind to a gene but has no regulatory effect on that gene's expression. Even if a TF does regulate a specific gene, the ChIP-chip data alone does not tell whether the regulation is activation or repression. Hence, additional information is required to solve this ambiguity inherent in ChIP-chip data.

To overcome this problem, several algorithms have been developed to combine gene expression and ChIP-chip data to infer the regulatory targets of a TF. For instance, NCA [20] and MA-Network [21] both use multivariate regression analysis and MFA [22] uses modified factor analysis of gene expression data to classify a TF's binding targets inferred from ChIP-chip data into regulatory and non-regulatory targets. In this paper, we use a different approach to explore the different biological possibilities for the same phenomenon. We develop a method, called Temporal Relationship Identification Algorithm (TRIA), which uses time-lagged correlation analysis between a TF and its binding targets to identify its regulatory targets. Our rationale is that a TF has a high time-lagged correlation with its regulatory targets, but has a low time-lagged correlation with its binding but non-regulatory targets. Time-lagged correlation analysis has the ability to infer causality and directional relationships between genes [23, 24]. It has also been used to reconstruct the reaction network of central carbon metabolism [25] and the gene interaction networks of Synechocystis sp [26]. Therefore, time-lagged correlation analysis has the potential to be used to identify a TF's regulatory targets from its binding targets which may or may not be regulated by the TF.

Results

Identification of the plausible regulatory targets of a TF

Two previous papers [18, 19] used a statistical error model to assign a p-value to the binding relationship of a TF-gene pair. They found that if p-value ≤ 0.001, the binding relationship of a TF-gene pair is of high confidence and can usually be confirmed by gene-specific PCR. Therefore, we include a gene in the set B+ if the TF-gene binding p-value in the ChIP-chip data is ≤ 0.001, i.e. B+ consists of genes that are significantly bound by a TF. Further, a gene in B+ is assigned into B+R+ if it has a temporal relationship with the TF but into B+R- otherwise. A TF-gene pair is said to have a temporal relationship if the gene's expression profile is significantly correlated with the TF's regulatory profile possibly with time lags (see Methods). Our hypothesis is that the genes in B+R+ are more likely to be the regulatory targets of a TF than are the genes in B+R-. TRIA is developed to classify B+ into B+R+ and B+R-.

Only a subset of the binding targets are plausible regulatory targets of a TF

We considered nine cell cycle TFs that have both sizes of B+R+ and B+R- ≥ 25 (i.e. at least 25 genes in each group). The number of genes in each group (B+R+ and B+R-) is listed in Table 1. On average, 55% of significantly bound genes are identified as the plausible regulatory targets of a TF, similar to the result (58%) of [21], and 64% of the inferred regulatory targets have expression profiles that are positively correlated with the TF's regulatory profile possibly with time lags. Moreover, only 16% of the inferred regulatory targets and the TF are co-expressed (i.e. identified time lag = 0). That is, 84% of the inferred regulatory targets may not be found if we use the conventional correlation analysis that can only check whether a TF-gene pair are co-expressed or not (see Additional file 1 for details). The following analyses were performed to validate our method.

Table 1 Classification of the binding targets of a TF into plausible and non-plausible regulatory ones. The numbers of genes in B+, B+R+ and B+R- are shown for each of the nine cell cycle TFs under study. B+R+ is further divided into two subsets depending on whether the gene's expression profile is positively (TlC > 0) or negatively (TlC < 0) correlated with the TF's regulatory profile, possibly with time lags (see Additional file 1 for details).

Enrichment for specific functional categories

B+R+ is shown to be more enriched than B+R- for specific MIPS functional categories with adjusted p-value < 0.05 (after the Bonferroni correction for multiple tests) using the cumulative hypergeometric distribution (see Additional file 2 for details). In most cases (7/9), except for Rap1 and Swi5, the number of enriched MIPS functional categories in B+R+ is larger than that in B+R- (see Figure 1). This result suggests that our criterion for distinguishing the plausible from non-plausible regulatory targets of a TF is reliable because co-regulated genes should have a greater probability to be involved in the same functional categories than non-co-regulated genes.

Figure 1
figure 1

Enrichment in functional annotation for the cell cycle TFs under study. The numbers of significantly enriched MIPS functional categories in B+R+ (blue) and B+R- (brown) for each of the nine cell cycle TFs under study are shown.

Enrichment for cell cycle genes

We compute the proportions of genes of B+R+ and B+R- that belong to the known cell cycle genes identified by Spellman et al. [7]. We then test whether the enrichment of the known cell cycle genes in B+R+ is statistically higher than that in B+R-. The cumulative hypergeometric distribution is used to assign a p-value for determining the statistical significance (see Appendix for details). In most cases (7/9), except for Abf1 and Ace2, the cell cycle genes are more enriched in B+R+ than in B+R- (see Table 2). This result also suggests that our criterion for distinguishing the plausible from non-plausible regulatory targets of a cell cycle TF is reliable because regulatory targets of a cell cycle TF should be more enriched for the known cell cycle genes than should non-regulatory targets.

Table 2 Enrichment of cell cycle genes. The proportions of genes that belong to the 793 cell cycle genes identified by Spellman et al. [7] are calculated for B+R+ and B+R-. We then test whether the enrichment of the known cell cycle genes in B+R+ is statistically higher than that in B+R-. The cumulative hypergeometric distribution is used to determine the statistical significance (see the Appendix for details). In most cases (7/9), except for Abf1 and Ace2, the known cell cycle genes are more enriched in B+R+ than in B+R-.

Taken together, the results mentioned above convincingly demonstrate that TRIA is a good method for identifying the plausible regulatory targets of a TF from its binding targets.

Identifying highly co-expressed genes among the plausible regulatory targets of a TF

It is known that co-regulated genes may not be co-expressed [28]. Therefore, it is useful to identify highly co-expressed genes among co-regulated genes because these co-regulated and highly co-expressed genes should be more likely to be simultaneously co-activated or co-repressed by the same TF and involve in the same cellular process.

TRIA has the ability to identify subsets of highly co-expressed genes among the regulatory targets of a TF. First, we use TRIA to identify the plausible regulatory targets (B+R+) from the binding targets (B+) of a TF. Then, we classify B+R+ into subsets A i and R i , where A i (R i ) contains all genes whose expression profiles are positively (negatively) correlated with the TF's regulatory profile with a lag of i time points. Finally, we test whether the expression coherence of X i is statistically higher than that of B+R+, where X i = A i or R i . The expression coherence of genes in a set G (i.e. EC(G)) is defined as the fraction of gene pairs in G with a correlation in expression level higher than a threshold T [27]. The threshold T was determined to be the 95th percentile correlation value of all pairwise correlations between 2000 randomly chosen genes in the yeast genome. Note that 0 ≤ EC(G) ≤ 1. The cumulative hypergeometric distribution is used to assign a p-value for rejecting the null hypothesis EC(X i ) = EC(B+R+), where X i = A i or R i (see the Appendix for details).

Table 3 lists all subsets of X i 's that contain highly co-expressed genes with p-value < 0.001. This result shows that in general several groups of highly co-expressed genes can be extracted from the co-regulated genes, consistent with the result of [28]. These co-regulated and highly co-expressed genes should be more likely to be simultaneously co-activated or co-repressed by the TF and can be used as candidates for further experimental studies. As shown in Table 3, different subsets may have different functional roles, indicating the diverse functions a TF might have.

Table 3 Identification of highly co-expressed genes among the regulatory targets of a TF. The expression coherence (EC) of B+R+, A i and R i are calculated. We then test whether the expression coherence of X i is statistically higher than that of B+R-, where X i = A i or R i . The cumulative hypergeometric distribution is used to assign a p-value for rejecting the null hypothesis EC(X i ) = EC(B+R+). Only those X ′ i s MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWGybawgaqbamaaBaaaleaacqWGPbqAaeqaaOGaem4Camhaaa@30F1@ that have p < 0.001 (i.e., -log10 p > 3) are shown (see the Appendix for details). In addition, we show the most enriched MIPS functional category for each X i .

Performance comparison with existing methods

To identify the regulatory targets of a TF, Gao et al. [21] developed MA-Network that uses multivariate regression analysis of gene expression data and Yu et al. [22] developed a modified factor analysis (MFA) approach. We compare the identified regulatory targets of the TFs that are available in our study and at least one of the other two studies. On average, only 53% of our identified regulatory targets are also found by MA-Network and only 31% of our identified regulatory targets are also found by MFA. There is little overlap between the above three studies. This is not surprising biologically since the three methods study different biological possibilities for the same phenomenon. However, since the results of the three methods are not highly congruent, a performance comparison of these three methods should be done. Since a TF has to bind to its regulatory targets to regulate their expressions, enrichment of the high-confidence TF binding motifs among the identified regulatory targets of a TF can be used as a criterion for performance comparison. The high-confidence TF binding motifs were derived using six motif discovery methods, also including the requirement for conservation across at least three of the four related yeast species [19]. Let S1 (T1) be the set of regulatory targets of a TF that are identified by TRIA but not by MA-Network (MFA) and S2 (T2) be the set of regulatory targets of a TF that are identified by MA-Network (MFA) but not by TRIA. We tested over-representation of the high-confidence TF binding motifs in S1 and S2 (T1 and T2). The cumulative hypergeometric distribution is used to assign a p-value to the motif enrichment (see the Appendix for details). We found that in four of the five (4/5) cases the high-confidence TF binding motifs are enriched in S1 with p-value < 0.001 but only two of the five (2/5) cases in S2 are enriched (see Table 4). Similarly, we found that in six of the eight (6/8) cases the high-confidence TF binding motifs are enriched in T1 with p-value < 0.001 but none of the eight (0/8) cases in T2 is enriched (see Table 5). The results show that TRIA has a better ability to identify the regulatory targets of a TF than do MA-Network and MFA.

Table 4 Performance comparison of TRIA with MA-Network. We tested over-representation of the high-confidence TF binding motif in S1 and S2, where S1 is the set of regulatory targets of a TF that are identified by TRIA but not by MA-Network and S2 is the set of regulatory targets of a TF that are identified by MA-Network but not by TRIA. The proportions of genes, whose promoter regions contain the high-confidence TF binding motif is calculated for S1 and S2. The cumulative hypergeometric distribution is used to determine the statistical significance of over-representation (see the Appendix for details). In four of the five (4/5) cases the high-confidence TF binding motifs are enriched in S1 with p-value < 0.001 but only two of the five (2/5) cases in S2.
Table 5 Performance comparison of TRIA with MFA. We tested over-representation of the high-confidence TF binding motif in T1 and T2, where T1 is the set of regulatory targets of a TF that are identified by TRIA but not by MFA and T2 is the set of regulatory targets of a TF that are identified by MFA but not by TRIA. The proportions of genes, whose promoter regions contain the high-confidence TF binding motif is calculated for T1 and T2. The cumulative hypergeometric distribution is used to determine the statistical significance of the over-representation (see the Appendix for details). In six of the eight (6/8) cases the high-confidence TF binding motifs are enriched in T1 with p-value < 0.001 but none of the eight (0/8) cases in T2.

Discussion

Many researchers used ChIP-chip data to study regulatory networks of the yeast [17–19, 29, 30]. Most of them (except [29]) regarded that a gene is regulated by a TF if the gene is bound by the TF with a p-value ≤ 0.001 in the ChIP-chip data. However, a TF that binds to a gene may have no regulatory effect on that gene. Therefore, additional information is required to solve this uncertainty. TRIA was developed to overcome this problem and was applied to gene expression and ChIP-chip data to identify the plausible regulatory targets of nine cell cycle TFs. The effectiveness of TRIA was validated by statistically testing for the enrichment of functional groups and known cell cycle genes.

Since co-expressed genes are not necessarily co-regulated and vice versa [28], it is important to develop a method that can identify co-regulated genes that are not co-expressed. TRIA has the ability to do this task. Through identifying a TF's binding targets that have temporal relationships with the TF, we can find the TF's regulatory targets that may not be co-expressed. We can further identify subsets of highly co-expressed genes among the inferred regulatory targets according to the identified time lags and regulatory directions. These co-regulated and highly co-expressed genes should be more likely to be simultaneously co-activated or co-repressed by the TF and can be used as candidates for further experimental studies.

TRIA has been successfully used by two previous studies to investigate other biological problems. First, Tsai et al. [31] developed TFBSfinder, which utilizes several data sources (DNA sequences, phylogenetic information, microarray data and ChIP-chip data), to identify cell cycle TF binding sites in yeast. TRIA was used to select reliable target genes of a TF in the first step of their algorithm. The target gene selection is a important step that strongly enhances the performance of TFBSfinder [31]. Since the performance of TFBSfinder is shown to be better than three well-known TF binding site identification algorithms (AlignACE, MDscan and MEME) [31], this confirmed that TRIA does have ability to identify the plausible regulatory targets of a TF. Second, Wu et al. [32] developed MOFA, which integrates gene expression and ChIP-chip data, to reconstruct transcriptional regulatory modules (TRMs) of the yeast cell cycle. TRIA was used as the first step of MOFA to refine the noisy raw ChIP-chip data and construct a binding score matrix. The quality of the binding score matrix strongly affects the performance of MOFA [32]. The TRMs identified by MOFA was validated by using existing experimental data, enrichment for genes in the same MIPS functional category, known DNA-binding motifs, etc. In addition, MOFA is capable of finding many novel TF-target gene relationships and can determine whether a TF is an activator or/and a repressor [32]. Since MOFA can reconstruct biologically relevant TRMs of the yeast cell cycle, this also attests to the usefulness of TRIA.

In this paper, TRIA is used to identify regulatory targets of cell cycle TFs. For a control, we show that TRIA can also perform well for cell-cycle irrelevant regulators. In this regard, we apply TRIA to identify regulatory targets of TFs that are activated by amino acid starved stress. The genome-wide gene expression and ChIP-chip data under amino acid starved growth condition are download from [8, 19]. As shown in Figure 2, in most of the cases, B+R+ is more enriched than B+R- for specific MIPS functional categories with adjusted p-value < 0.05 (after the Bonferroni correction for multiple tests) using the cumulative hypergeometric distribution. This result suggests that TRIA performed well for cell-cycle irrelevant TFs.

Figure 2
figure 2

Enrichment in functional annotation for the stress response TFs under study. The numbers of significantly enriched MIPS functional categories in B+R+ (blue) and B+R- (brown) for each of the 27 amino acid starved stress TFs under study are shown.

The development of TRIA was motivated by two biological observations. First, it is known that TF binding affects gene expression in a nonlinear fashion: below some level it has no effect, and above some level the effect may saturate. This type of behavior can be modeled using a sigmoid function. Therefore, we define a TF's regulatory profile as a sigmoid function of its expression profile as in previous studies [33–35]. Although this may not be true for TFs that are activated at the post-translational stage [20, 36], it is not a serious problem for many cell cycle TFs whose expression levels significantly varies with times, indicating that they are under transcriptional control [24, 33, 34, 37–39]. Second, the regulatory effect of a TF on its target genes may not be simultaneous but has a time lag [23, 24, 26, 35, 37, 38, 40–42]. This makes TRIA more general than previous studies [20–22, 28] that regard a gene to be regulated by a TF only when the gene's expression profile are co-expressed with the transcription factor activity (TFA) profile. Actually, we found that TRIA performed better than two previous algorithms (MA-Network and MFA) [21, 22]. This may result from the fact that TRIA is designed for cell cycle TFs and also considers a time-lagged correlation between a cell cycle TF and its regulatory targets.

In this study, we use time-lagged correlation analysis between a TF and its binding targets to identify its regulatory targets. However, in some cases, TFs may interact with each other and together regulate a group of target genes. This issue will be addressed in the future. We will try to define an overall regulatory profile of a TF complex and apply TRIA to identify target genes that are co-regulated by the same TF complex.

Conclusion

An algorithm called TRIA is developed to identify the plausible regulatory targets of a TF from its binding targets. Since the binding of a TF to a gene does not necessarily imply regulation, TRIA is used to solve this ambiguity. We validated the effectiveness of TRIA by checking the enrichments for functional annotation and known cell cycle genes. Moreover, the performance of TRIA was shown to be better than two published methods (MA-Network and MFA). Moreover, TRIA has the ability to identify subsets of highly co-expressed genes among the regulatory targets of a TF. In addition, TRIA has been successfully applied to identify high-confidence cell cycle TF binding sites [31] and to reconstruct transcriptional regulatory modules of the yeast cell cycle [32]. Finally, for a control, TRIA is shown to perform well for cell-cycle irrelevant TFs. In conclusion, TRIA can find biologically relevant results and should be useful for systems biology study.

Methods

Data sets

Three types of data are used in this study. First, the ChIP-chip data of the cell cycle TFs under the rich media are downloaded from [19]. Second, the gene expression data of the yeast cell cycle are downloaded from [7]. Although it is an old data set, it is still the best cell cycle data set that are available in the public domain. Genes that have only one missing point in their gene expression profiles are reconstructed by the spline algorithm [43], but genes that have more than one missing value in their gene expression profiles or have no ChIP-chip data are excluded. Third, the genome-wide distribution of the high-confidence TF binding motifs was downloaded from [19]. The high-confidence TF binding motifs were derived by using six motif discovery methods, with the requirement for conservation across at least three of four related yeast species [19].

Temporal Relationship Identification Algorithm (TRIA)

Temporal Relationship Identification Algorithm (TRIA) is developed to identify TF-gene pairs that have a temporal relationship. A cell cycle TF and its binding target are said to have a positively (negatively) temporal relationship if the target gene's expression profile is significantly positively (negatively) correlated with the TF's regulatory profile possibly with a time lag. It is known that TF binding affects gene expression in a nonlinear fashion: below some level it has no effect, and above some level the effect may become saturated. This type of behavior can be modeled using a sigmoid function. Therefore, we define a TF's regulatory profile as a sigmoid function of its expression profile as in previous studies [33–35].

Let x → MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWG4baEgaWcaaaa@2E37@ =(x1, ..., x N ) be the gene expression time profile of cell cycle TF x and y → MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWG5bqEgaWcaaaa@2E39@ = (y1, ..., y N ) be the expression profile of gene y. The regulatory profile RP( x → MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWG4baEgaWcaaaa@2E37@ ) = (f(x1), ..., f(x N )) of TF x is defined as a sigmoid function:

f ( x i ) = 1 1 + e − ( x i − x ¯ ) / s ) i = 1 , 2 , ⋯ , N

where x ¯ MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWG4baEgaqeaaaa@2E3D@ is the sample mean and s is the sample standard deviation of x → MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWG4baEgaWcaaaa@2E37@ . Compute the correlation between y → MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWG5bqEgaWcaaaa@2E39@ and RP( x → MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWG4baEgaWcaaaa@2E37@ ) with a lag of k time points [24, 25]:

r ( k ) = ( ∑ i = 1 N − k ( y i + k − y ¯ ) ( f ( x i ) − m ¯ ) ) / ( ∑ i = 1 N − k ( y i + k − y ¯ ) 2 ⋅ ∑ i = 1 N − k ( f ( x i ) − m ¯ ) 2 ) , k = 0 , 1 , ... , L MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaafaqabeqacaaabaWaaSGbaeaacqWGYbGCcqGGOaakcqWGRbWAcqGGPaqkcqGH9aqpdaqadaqaamaaqahabaGaeiikaGIaemyEaK3aaSbaaSqaaiabdMgaPjabgUcaRiabdUgaRbqabaGccqGHsislcuWG5bqEgaqeaiabcMcaPiabcIcaOiabdAgaMjabcIcaOiabdIha4naaBaaaleaacqWGPbqAaeqaaOGaeiykaKIaeyOeI0IafmyBa0MbaebacqGGPaqkaSqaaiabdMgaPjabg2da9iabigdaXaqaaiabd6eaojabgkHiTiabdUgaRbqdcqGHris5aaGccaGLOaGaayzkaaaabaWaaeWaaeaadaGcaaqaamaaqahabaGaeiikaGIaemyEaK3aaSbaaSqaaiabdMgaPjabgUcaRiabdUgaRbqabaGccqGHsislcuWG5bqEgaqeaaWcbaGaemyAaKMaeyypa0JaeGymaedabaGaemOta4KaeyOeI0Iaem4AaSganiabggHiLdGccqGGPaqkdaahaaWcbeqaaiabikdaYaaaaeqaaOGaeyyXIC9aaOaaaeaadaaeWbqaaiabcIcaOiabdAgaMjabcIcaOiabdIha4naaBaaaleaacqWGPbqAaeqaaOGaeiykaKIaeyOeI0IafmyBa0MbaebacqGGPaqkdaahaaWcbeqaaiabikdaYaaaaeaacqWGPbqAcqGH9aqpcqaIXaqmaeaacqWGobGtcqGHsislcqWGRbWAa0GaeyyeIuoaaSqabaaakiaawIcacaGLPaaaaaGaeiilaWcabaGaem4AaSMaeyypa0JaeGimaaJaeiilaWIaeGymaeJaeiilaWIaeiOla4IaeiOla4IaeiOla4IaeiilaWIaemitaWeaaaaa@8825@

where y ¯ ≜ ( ∑ i = 1 N − k y i + k ) / ( N − k ) MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaadaWcgaqaaiqbdMha5zaaraGaeSixIa0aaeWaaeaadaaeWbqaaiabdMha5naaBaaaleaacqWGPbqAcqGHRaWkcqWGRbWAaeqaaaqaaiabdMgaPjabg2da9iabigdaXaqaaiabd6eaojabgkHiTiabdUgaRbqdcqGHris5aaGccaGLOaGaayzkaaaabaGaeiikaGIaemOta4KaeyOeI0Iaem4AaSMaeiykaKcaaaaa@4496@ , m ¯ ≜ ( ∑ i = 1 N − k f ( x i ) ) / ( N − k ) MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaadaWcgaqaaiqbd2gaTzaaraGaeSixIa0aaeWaaeaadaaeWbqaaiabdAgaMjabcIcaOiabdIha4naaBaaaleaacqWGPbqAaeqaaOGaeiykaKcaleaacqWGPbqAcqGH9aqpcqaIXaqmaeaacqWGobGtcqGHsislcqWGRbWAa0GaeyyeIuoaaOGaayjkaiaawMcaaaqaaiabcIcaOiabd6eaojabgkHiTiabdUgaRjabcMcaPaaaaaa@4557@ and L is the maximal time lag of the TF's regulatory profile considered. In this study, we set L = 8 meaning that we compute the correlation between a gene and a TF with all possible time lags that are less than one cell cycle. The time lag may be interpreted as the time for a TF to have a regulatory effect on a gene.

Then we test the null hypothesis H0: r(k) = 0 and the alternative hypothesis H1: r(k) ≠ 0 by the bootstrap method (see the Appendix) and get a p-value p(k). The time-lagged correlation (TlC) of y → MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWG5bqEgaWcaaaa@2E39@ and RP( x → MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWG4baEgaWcaaaa@2E37@ ) is defined as r(j) that has the smallest p-value (i.e. TlC( y → MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWG5bqEgaWcaaaa@2E39@ , RP( x → MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWG4baEgaWcaaaa@2E37@ )) = r(j) if p(j) ≤ p(k) ∀k ≠ j). Note that -1 ≤ TlC( y → MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWG5bqEgaWcaaaa@2E39@ , RP( x → MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWG4baEgaWcaaaa@2E37@ )) ≤ 1. Two possible temporal relationships between y → MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWG5bqEgaWcaaaa@2E39@ and RP( x → MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWG4baEgaWcaaaa@2E37@ ) can be identified by TRIA: y → MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWG5bqEgaWcaaaa@2E39@ and RP( x → MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWG4baEgaWcaaaa@2E37@ ) are (1) positively correlated with a lag of j time points if TlC( y → MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWG5bqEgaWcaaaa@2E39@ , RP( x → MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWG4baEgaWcaaaa@2E37@ )) = r(j) > 0 &p(j) ≤ p Threshold and (2) negatively correlated with a lag of j time points if TlC( y → MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWG5bqEgaWcaaaa@2E39@ , RP( x → MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWG4baEgaWcaaaa@2E37@ )) = r(j) < 0 &p(j) ≤ p Threshold . The p Threshold is chosen to ensure that we have at most a 5% false discovery rate (FDR) [44]. We may consider that TF x, after a lag of j time points, activates (represses) gene y if y → MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWG5bqEgaWcaaaa@2E39@ and RP( x → MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWG4baEgaWcaaaa@2E37@ ) are positively (negatively) correlated with a lag of j time points.

Appendix

Statistical test used in Table 2

We want to test whether the enrichment of the known cell cycle genes (identified in [7]) in B+R+ is statistically higher than that in B+R-. Following Banerjee and Zhang [27], a model based on hypergeometric distribution is used.

We calculate:

P ( m a , m b , n a , n b ) = ( n a m a ) ( n b m b ) ( n a + n b m a + m b ) = ( n a m a ) ( N − n a M − m a ) ( N M ) MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqWGqbaucqGGOaakcqWGTbqBdaWgaaWcbaGaemyyaegabeaakiabcYcaSiabd2gaTnaaBaaaleaacqWGIbGyaeqaaOGaeiilaWIaemOBa42aaSbaaSqaaiabdggaHbqabaGccqGGSaalcqWGUbGBdaWgaaWcbaGaemOyaigabeaakiabcMcaPiabg2da9maalaaabaWaaeWaaeaafaqabeGabaaabaGaemOBa42aaSbaaSqaaiabdggaHbqabaaakeaacqWGTbqBdaWgaaWcbaGaemyyaegabeaaaaaakiaawIcacaGLPaaadaqadaqaauaabeqaceaaaeaacqWGUbGBdaWgaaWcbaGaemOyaigabeaaaOqaaiabd2gaTnaaBaaaleaacqWGIbGyaeqaaaaaaOGaayjkaiaawMcaaaqaamaabmaabaqbaeqabiqaaaqaaiabd6gaUnaaBaaaleaacqWGHbqyaeqaaOGaey4kaSIaemOBa42aaSbaaSqaaiabdkgaIbqabaaakeaacqWGTbqBdaWgaaWcbaGaemyyaegabeaakiabgUcaRiabd2gaTnaaBaaaleaacqWGIbGyaeqaaaaaaOGaayjkaiaawMcaaaaacqGH9aqpdaWcaaqaamaabmaabaqbaeqabiqaaaqaaiabd6gaUnaaBaaaleaacqWGHbqyaeqaaaGcbaGaemyBa02aaSbaaSqaaiabdggaHbqabaaaaaGccaGLOaGaayzkaaWaaeWaaeaafaqabeGabaaabaGaemOta4KaeyOeI0IaemOBa42aaSbaaSqaaiabdggaHbqabaaakeaacqWGnbqtcqGHsislcqWGTbqBdaWgaaWcbaGaemyyaegabeaaaaaakiaawIcacaGLPaaaaeaadaqadaqaauaabeqaceaaaeaacqWGobGtaeaacqWGnbqtaaaacaGLOaGaayzkaaaaaaaa@7461@

where N = n a + n b , M = m a + m b , n a (n b ) is the number of genes in B+R+ (B+R-), m a (m b ) is the number of the known cell cycle genes in B+R+ (B+R-), and

( n a m a ) ≜ n a ! m a ! ( n a − m a ) ! MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaadaqadaqaauaabeqaceaaaeaacqWGUbGBdaWgaaWcbaGaemyyaegabeaaaOqaaiabd2gaTnaaBaaaleaacqWGHbqyaeqaaaaaaOGaayjkaiaawMcaaiablYLianaalaaabaGaemOBa42aaSbaaSqaaiabdggaHbqabaGccqGGHaqiaeaacqWGTbqBdaWgaaWcbaGaemyyaegabeaakiabcgcaHiabcIcaOiabd6gaUnaaBaaaleaacqWGHbqyaeqaaOGaeyOeI0IaemyBa02aaSbaaSqaaiabdggaHbqabaGccqGGPaqkcqGGHaqiaaaaaa@45FC@

Then, we consider all possible combinations of x a , x b such that ∑ i = { a , b } x i = ∑ i = { a , b } m i = M MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaadaaeqbqaaiabdIha4naaBaaaleaacqWGPbqAaeqaaaqaaiabdMgaPjabg2da9iabcUha7jabdggaHjabcYcaSiabdkgaIjabc2ha9bqab0GaeyyeIuoakiabg2da9maaqafabaGaemyBa02aaSbaaSqaaiabdMgaPbqabaGccqGH9aqpcqWGnbqtaSqaaiabdMgaPjabg2da9iabcUha7jabdggaHjabcYcaSiabdkgaIjabc2ha9bqab0GaeyyeIuoaaaa@4BC6@ and sum all probabilities calculated as above where x a ≥ m a , which is taken as the p-value for rejecting the null hypothesis that enrichment of the known cell cycle genes in B+R+ is not statistically higher than that in B+R-.

p = P ( x a ≥ m a ) = ∑ x a ≥ m a ( n a x a ) ( N − n a M − x a ) ( N M ) = 1 − ∑ x a = 0 m a − 1 ( n a x a ) ( N − n a M − x a ) ( N M ) MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqWGWbaCcqGH9aqpcqWGqbaucqGGOaakcqWG4baEdaWgaaWcbaGaemyyaegabeaakiabgwMiZkabd2gaTnaaBaaaleaacqWGHbqyaeqaaOGaeiykaKIaeyypa0ZaaabuaeaadaWcaaqaamaabmaabaqbaeqabiqaaaqaaiabd6gaUnaaBaaaleaacqWGHbqyaeqaaaGcbaGaemiEaG3aaSbaaSqaaiabdggaHbqabaaaaaGccaGLOaGaayzkaaWaaeWaaeaafaqabeGabaaabaGaemOta4KaeyOeI0IaemOBa42aaSbaaSqaaiabdggaHbqabaaakeaacqWGnbqtcqGHsislcqWG4baEdaWgaaWcbaGaemyyaegabeaaaaaakiaawIcacaGLPaaaaeaadaqadaqaauaabeqaceaaaeaacqWGobGtaeaacqWGnbqtaaaacaGLOaGaayzkaaaaaaWcbaGaemiEaG3aaSbaaWqaaiabdggaHbqabaWccqGHLjYScqWGTbqBdaWgaaadbaGaemyyaegabeaaaSqab0GaeyyeIuoakiabg2da9iabigdaXiabgkHiTmaaqahabaWaaSaaaeaadaqadaqaauaabeqaceaaaeaacqWGUbGBdaWgaaWcbaGaemyyaegabeaaaOqaaiabdIha4naaBaaaleaacqWGHbqyaeqaaaaaaOGaayjkaiaawMcaamaabmaabaqbaeqabiqaaaqaaiabd6eaojabgkHiTiabd6gaUnaaBaaaleaacqWGHbqyaeqaaaGcbaGaemyta0KaeyOeI0IaemiEaG3aaSbaaSqaaiabdggaHbqabaaaaaGccaGLOaGaayzkaaaabaWaaeWaaeaafaqabeGabaaabaGaemOta4eabaGaemyta0eaaaGaayjkaiaawMcaaaaaaSqaaiabdIha4naaBaaameaacqWGHbqyaeqaaSGaeyypa0JaeGimaadabaGaemyBa02aaSbaaWqaaiabdggaHbqabaWccqGHsislcqaIXaqma0GaeyyeIuoaaaa@8145@
(A1)

Statistical test used in Table 3

The expression coherence (EC) of sets B+R+, A i and R i are calculated, where A i (R i ) contains all genes in B+R+ whose expression profiles are positively (negatively) correlated with the TF's regulatory profile with a lag of i time points.

We want to test whether the expression coherence of X i is statistically higher than that of B+R-, where X i = A i or R i . The p-value for rejecting the null hypothesis EC(X i ) = EC(B+R+) (the alternative hypothesis is EC(X i ) > EC(B+R+)) is defined as in Equation (A 1). N is the number of gene pairs in B+R+, M is the number of gene pairs in X i , where X i = A i or R i , n a is the number of gene pairs in B+R+ that have correlations higher than the threshold T, and m a is the number of gene pairs in X i that have correlations higher than the threshold T.

Statistical tests used in Tables 4 and 5

The proportions of genes whose promoter regions contain the high-confidence TF binding motif are calculated for S1 (T1) and S2 (T2), where S1 (T1) is the set of regulatory targets of a TF that are identified by TRIA but not by MA-Network (MFA) and S2(T2) is the set of regulatory targets of a TF that are identified by MA-Network (MFA) but not by TRIA. Only 5 TFs (Abf1, Ace2, Fkh2, Swi4, Swi5) are studied for both TRIA and MA-Network. Only 8 TFs (Abf1, Ace2, Fkh1, Fkh2, Rap1, Swi4, Swi5, Swi6) are studied for both TRIA and MFA.

The high-confidence TF binding motifs were derived by using six motif discovery methods, under the requirement for conservation across at least three of the four related yeast species [19]. The yeast genome has 6229 ORFs. Only 817 genes contain Abf1 binding sites, 65 genes contains Ace2 binding sites, 461 genes contain Fkh2 binding sites, 501 genes contain Swi4 binding sites, 575 genes contain Swi5 binding sites, 1181 genes contain Fkh1 binding sites, 379 genes contain Rap1 binding sites, and 946 genes contain Swi6 binding sites [19].

We tested over-representation of the high-confidence TF binding motif in S1 (T1) and S2 (T2). The cumulative hypergeometric distribution is used to determine the statistical significance. The p-value is defined as in Equation (A 1), where N = 6229 is the number of genes in the yeast genome, M is the number of genes in G, where G = S1 (T1) or S2(T2) (e.g. M = 62 for Abf1 if G = S1 and M = 56 for Abf1 if G = S2; M = 72 for Rap1 if G = T1 and M = 36 for Rap1 if G = T2), n a is the number of genes in the yeast genome that contain binding sites of a TF under study (e.g. n a = 817 for Abf1; n a = 379 for Rap1) and m a is the number of genes in G that contain binding sites of a TF under study (e.g. m a = 46 for Abf1 if G = S1 and m a = 28 for Abf1 if G = S2; m a = 32 for Rap1 if G = T1 and m a = 7 for Rap1 if G = T2).

The bootstrap method for testing the statistical significance of the difference between r(k) and 0

We observed N-k pairs of observations, Z = {zi: i = 1, ..., N-k and zi = (f(x i ), yi+k)}. The correlation coefficient from the sample is calculated and denoted as

r ( k ) = ( ∑ i = 1 N − k ( y i + k − y ¯ ) ( f ( x i ) − m ¯ ) ) / ( ∑ i = 1 N − k ( y i + k − y ¯ ) 2 ⋅ ∑ i = 1 N − k ( f ( x i ) − m ¯ ) 2 ) , k = 0 , 1 , 2 , ⋯ MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaafaqabeqacaaabaWaaSGbaeaacqWGYbGCcqGGOaakcqWGRbWAcqGGPaqkcqGH9aqpdaqadaqaamaaqahabaWaaeWaaeaacqWG5bqEdaWgaaWcbaGaemyAaKMaey4kaSIaem4AaSgabeaakiabgkHiTiqbdMha5zaaraaacaGLOaGaayzkaaWaaeWaaeaacqWGMbGzcqGGOaakcqWG4baEdaWgaaWcbaGaemyAaKgabeaakiabcMcaPiabgkHiTiqbd2gaTzaaraaacaGLOaGaayzkaaaaleaacqWGPbqAcqGH9aqpcqaIXaqmaeaacqWGobGtcqGHsislcqWGRbWAa0GaeyyeIuoaaOGaayjkaiaawMcaaaqaamaabmaabaWaaOaaaeaadaaeWbqaamaabmaabaGaemyEaK3aaSbaaSqaaiabdMgaPjabgUcaRiabdUgaRbqabaGccqGHsislcuWG5bqEgaqeaaGaayjkaiaawMcaamaaCaaaleqabaGaeGOmaidaaaqaaiabdMgaPjabg2da9iabigdaXaqaaiabd6eaojabgkHiTiabdUgaRbqdcqGHris5aaWcbeaakiabgwSixpaakaaabaWaaabCaeaadaqadaqaaiabdAgaMjabcIcaOiabdIha4naaBaaaleaacqWGPbqAaeqaaOGaeiykaKIaeyOeI0IafmyBa0MbaebaaiaawIcacaGLPaaadaahaaWcbeqaaiabikdaYaaaaeaacqWGPbqAcqGH9aqpcqaIXaqmaeaacqWGobGtcqGHsislcqWGRbWAa0GaeyyeIuoaaSqabaaakiaawIcacaGLPaaaaaGaeiilaWcabaGaem4AaSMaeyypa0JaeGimaaJaeiilaWIaeGymaeJaeiilaWIaeGOmaiJaeiilaWIaeS47IWeaaaaa@868A@

where y ¯ ≜ ( ∑ i = 1 N − k y i + k ) / ( N − k ) MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaadaWcgaqaaiqbdMha5zaaraGaeSixIa0aaeWaaeaadaaeWbqaaiabdMha5naaBaaaleaacqWGPbqAcqGHRaWkcqWGRbWAaeqaaaqaaiabdMgaPjabg2da9iabigdaXaqaaiabd6eaojabgkHiTiabdUgaRbqdcqGHris5aaGccaGLOaGaayzkaaaabaWaaeWaaeaacqWGobGtcqGHsislcqWGRbWAaiaawIcacaGLPaaaaaaaaa@446D@ , m ¯ ≜ ( ∑ i = 1 N − k f ( x i ) ) / ( N − k ) MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaadaWcgaqaaiqbd2gaTzaaraGaeSixIa0aaeWaaeaadaaeWbqaaiabdAgaMjabcIcaOiabdIha4naaBaaaleaacqWGPbqAaeqaaOGaeiykaKcaleaacqWGPbqAcqGH9aqpcqaIXaqmaeaacqWGobGtcqGHsislcqWGRbWAa0GaeyyeIuoaaOGaayjkaiaawMcaaaqaamaabmaabaGaemOta4KaeyOeI0Iaem4AaSgacaGLOaGaayzkaaaaaaaa@452E@ and -1 ≤ r(k) ≤ 1. It is aimed to use these observations to test if r(k) is different from 0 significantly. Suppose the null hypothesis is H0: r(k)= 0 and the alternative hypothesis is H1: r(k) ≠ 0. We will apply the bootstrap method to perform this hypothesis testing based on the observations. Keeping the pair relationship of these N-k pairs to maintain the dependence between (f(x i ), yi+k), zi are sampled with replacement N-k times to form a bootstrap sample, Z* = {zi*: i = 1, ..., N-k and zi* belongs to Z}. The correlation coefficient from the bootstrap sample Z* is computed and denoted as r*(k), -1 ≤ r*(k) ≤ 1. Repeat the resampling procedure B times, we will observed r1*(k), r2*(k), ..., r B *(k). These bootstrap correlation coefficients are sorted to be − 1 ≤ r ( 1 ) ∗ ( k ) ≤ r ( 2 ) ∗ ( k ) ≤ ... ≤ r ( B ) ∗ ( k ) ≤ 1 MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqGHsislcqaIXaqmcqGHKjYOcqWGYbGCdaqhaaWcbaGaeiikaGIaeGymaeJaeiykaKcabaGaey4fIOcaaOGaeiikaGIaem4AaSMaeiykaKIaeyizImQaemOCai3aa0baaSqaaiabcIcaOiabikdaYiabcMcaPaqaaiabgEHiQaaakiabcIcaOiabdUgaRjabcMcaPiabgsMiJkabc6caUiabc6caUiabc6caUiabgsMiJkabdkhaYnaaDaaaleaacqGGOaakcqWGcbGqcqGGPaqkaeaacqGHxiIkaaGccqGGOaakcqWGRbWAcqGGPaqkcqGHKjYOcqaIXaqmaaa@539F@ . Then, the (1-α) two-sided percentile interval is given by [ r ( B × α / 2 ) ∗ ( k ) , r ( B × ( 1 − α / 2 ) ) ∗ ( k ) MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqWGYbGCdaqhaaWcbaGaeiikaGIaemOqaiKaey41aqlcciGae8xSdeMaei4la8IaeGOmaiJaeiykaKcabaGaey4fIOcaaOGaeiikaGIaem4AaSMaeiykaKIaeiilaWIaeeiiaaIaemOCai3aa0baaSqaaiabcIcaOiabdkeacjabgEna0kabcIcaOiabigdaXiabgkHiTiab=f7aHjabc+caViabikdaYiabcMcaPiabcMcaPaqaaiabgEHiQaaakiabcIcaOiabdUgaRjabcMcaPaaa@4DC6@ ] in this case [45]. If this percentile interval does not contain 0, then the null hypothesis is rejected at the significance level of α. Otherwise, the data fail to reject the null hypothesis at the significance level of α. Since the p-value is the smallest value of α for which the null hypothesis will be rejected based on the observation, the p-value for this test is estimated by the following:

p ⌢ ( k ) = 2 × min { p ⌢ + ( k ) , 1 − p ⌢ + ( k ) } , where  p ⌢ + ( k ) = ∑ i = 1 B I { r i ∗ ( k ) ≥ 0 } / B , MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaafaqabeqacaaabaGafmiCaaNbambacqGGOaakcqWGRbWAcqGGPaqkcqGH9aqpcqaIYaGmcqGHxdaTcyGGTbqBcqGGPbqAcqGGUbGBcqGG7bWEcuWGWbaCgaWeamaaBaaaleaacqGHRaWkaeqaaOGaeiikaGIaem4AaSMaeiykaKIaeiilaWIaeGymaeJaeyOeI0IafmiCaaNbambadaWgaaWcbaGaey4kaScabeaakiabcIcaOiabdUgaRjabcMcaPiabc2ha9jabcYcaSaqaaiabbEha3jabbIgaOjabbwgaLjabbkhaYjabbwgaLjabbccaGiqbdchaWzaataWaaSbaaSqaaiabgUcaRaqabaGccqGGOaakcqWGRbWAcqGGPaqkcqGH9aqpdaaeWbqaaiabdMeajjabcUha7jabdkhaYnaaDaaaleaacqWGPbqAaeaacqGHxiIkaaGccqGGOaakcqWGRbWAcqGGPaqkcqGHLjYScqaIWaamcqGG9bqFcqGGVaWlcqWGcbGqcqGGSaalaSqaaiabdMgaPjabg2da9iabigdaXaqaaiabdkeacbqdcqGHris5aaaaaaa@7106@

where I{·} is the indicator function whose value is one when the event is true and zero otherwise.

References

  1. Schena M, Shalon D, Davis RW, Brown PO: Quantitative monitoring of gene expression patterns with a complementary DNA microarray. Science 1995, 270: 467–470. 10.1126/science.270.5235.467

    Article  CAS  PubMed  Google Scholar 

  2. DeRisi JL, Iyer VR, Brown PO: Exploring the metabolic and genetic control of gene expression on a genomic scale. Science 1997, 278: 680–686. 10.1126/science.278.5338.680

    Article  CAS  PubMed  Google Scholar 

  3. Ren B, Robert F, Wyrick JJ, Aparicio O, Jennings EG, Simon I, Zeitlinger J, Schreiber J, Hannett N, Kanin E, Volkert TL, Wilson CJ, Bell SP, Young RA: Genome-wide location and function of DNA binding proteins. Science 2000, 290: 2306–2309. 10.1126/science.290.5500.2306

    Article  CAS  PubMed  Google Scholar 

  4. Iyer VR, Horak CE, Scafe CS, Botstein D, Snyder M, Brown PO: Genomic binding sites of the yeast cell-cycle transcription factors SBF and MBF. Nature 2001, 409: 533–538. 10.1038/35054095

    Article  CAS  PubMed  Google Scholar 

  5. Cho RJ, Campbell MJ, Winzeler EA, Steinmetz L, Conway A, Wodicka L, Wolfsberg TG, Gabrielian AE, Landsman D, Lockhart DJ, Davis RW: A genome-wide transcriptional analysis of the mitotic cell cycle. Mol Cell 1998, 2: 65–73. 10.1016/S1097-2765(00)80114-8

    Article  CAS  PubMed  Google Scholar 

  6. Chu S, DeRisi J, Eisen M, Mulholland J, Botstein D, Brown PO, Herskowitz I: The transcriptional program of sporulation in budding yeast. Science 1998, 282: 699–705. 10.1126/science.282.5389.699

    Article  CAS  PubMed  Google Scholar 

  7. 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: 3273–3297.

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  8. 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: 4241–4257.

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  9. Causton HC, Ren B, Koh SS, Harbison CT, Kanin E, Jennings EG, Lee T, True HL, Lander ES, Young RA: Remodeling of yeast genome expression in response to environmental changes. Mol Biol Cell 2001, 12: 323–337.

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  10. Eisen MB, Spellman PT, Brown PO, Botstein D: Cluster analysis and display of genome-wide expression patterns. Proc Natl Acad Sci USA 1998, 95: 14863–14868. 10.1073/pnas.95.25.14863

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  11. Tavazoie S, Hughes JD, Campbell MJ, Cho RJ, Church GM: Systematic determination of genetic network architecture. Nat Genet 1999, 22: 281–285. 10.1038/10343

    Article  CAS  PubMed  Google Scholar 

  12. Ihmels J, Friedlander G, Bergmann S, Sarig O, Ziv Y, Barkai N: Revealing modular organization in the yeast transcriptional network. Nat Genet 2002, 31: 370–377.

    CAS  PubMed  Google Scholar 

  13. Pilpel Y, Sudarsanam P, Church GM: Identifying regulatory networks by combinatorial analysis of promoter elements. Nat Genet 2001, 29: 153–159. 10.1038/ng724

    Article  CAS  PubMed  Google Scholar 

  14. Liang S, Fuhrman S, Somogyi R: REVEAL, a general reverse engineering algorithm for inference of genetic network architectures. Pac Symp Biocomput 1998, 3: 18–29.

    Google Scholar 

  15. Friedman N, Linial M, Nachman I, Pe'er D: Using Bayesian networks to analyze expression data. J Comput Biol 2000, 7: 601–620. 10.1089/106652700750050961

    Article  CAS  PubMed  Google Scholar 

  16. 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: 166–176.

    Article  CAS  PubMed  Google Scholar 

  17. Simon I, Barnett J, Hannett N, Harbison CT, Rinaldi NJ, Volkert TL, Wyrick JJ, Zeitlinger J, Gifford DK, Jaakkola TS, Young RA: Serial regulation of transcriptional regulators in the yeast cell cycle. Cell 2001, 106: 697–708. 10.1016/S0092-8674(01)00494-9

    Article  CAS  PubMed  Google Scholar 

  18. Lee TI, Rinaldi NJ, Robert F, Odom DT, Bar-Joseph Z, Gerber GK, Hannett NM, Harbison CT, Thompson CM, Simon I, Zeitlinger J, Jennings EG, Murray HL, Gordon DB, Ren B, Wyrick JJ, Tagne JB, Volkert TL, Fraenkel E, Gifford DK, Young RA: Transcriptional regulatory networks in Saccharomyces cerevisiae . Science 2002, 298: 799–804. 10.1126/science.1075090

    Article  CAS  PubMed  Google Scholar 

  19. Harbison CT, Gordon DB, Lee TI, Rinaldi NJ, Macisaac KD, Danford TW, Hannett NM, Tagne JB, Reynolds DB, Yoo J, Jennings EG, Zeitlinger J, Pokholok DK, Kellis M, Rolfe PA, Takusagawa KT, Lander ES, Gifford DK, Fraenkel E, Young RA: Transcriptional regulatory code of a eukaryotic genome. Nature 2004, 431: 99–104. 10.1038/nature02800

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  20. Liao JC, Boscolo R, Yang YL, Tran LM, Sabatti C, Roychowdhury VP: Network component analysis: reconstruction of regulatory signals in biological system. Proc Natl Acad Sci USA 2003, 100: 15522–15527. 10.1073/pnas.2136632100

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  21. Gao F, Foat BC, Bussemaker HJ: Defining transcriptional networks through integrative modeling of mRNA expression and transcription factor binding data. BMC Bioinformatics 2004, 5: 31. 10.1186/1471-2105-5-31

    Article  PubMed Central  PubMed  Google Scholar 

  22. Yu T, Li KC: Inference of transcriptional regulatory network by two-stage constrained space factor analysis. Bioinformatics 2005, 21: 4033–4038. 10.1093/bioinformatics/bti656

    Article  CAS  PubMed  Google Scholar 

  23. Reis BY, Butte AJ, Kohane IS: Approaching causality: discovering time-lag correlations in genetic expression data with static and dynamic relevance networks. RECOMB 2000, p5.

    Google Scholar 

  24. Kato M, Tsunoda T, Takagi T: Lag analysis of genetic networks in the cell cycle of budding yeast. Genome Inform 2001, 12: 266–267.

    CAS  Google Scholar 

  25. Arkin A, Shen PD, Ross J: A test case of correlation metric construction of a reaction pathway from measurements. Science 1997, 277: 1275–1279. 10.1126/science.277.5330.1275

    Article  CAS  Google Scholar 

  26. Schmitt WA Jr, Raab RM, Stephanopoulos G: Elucidation of gene interaction networks through time-lagged correlation analysis of transcriptional data. Genome Res 2004, 14: 1654–1663. 10.1101/gr.2439804

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  27. Banerjee N, Zhang MQ: Identifying cooperativity among transcription factors controlling the cell cycle in yeast. Nucleic Acids Res 2003, 31: 7024–7031. 10.1093/nar/gkg894

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  28. Zhou XJ, Kao MC, Huang H, Wong A, Nunez-Iglesias J, Primig M, Aparicio OM, Finch CE, Morgan TE, Wong WHZ: Functional annotation and network reconstruction through cross-platform integration of microarray data. Nat Biotechnol 2005, 23: 238–243. 10.1038/nbt1058

    Article  CAS  PubMed  Google Scholar 

  29. Bar-Joseph Z, Gerber GK, Lee TI, Rinaldi NJ, Yoo JY, Robert F, Gordon DB, Fraenkel E, Jaakkola TS, Young RA, Gifford DK: Computational discovery of gene modules and regulatory networks. Nat Biotechnol 2003, 21: 1337–1342. 10.1038/nbt890

    Article  CAS  PubMed  Google Scholar 

  30. Kato M, Hata N, Banerjee N, Futcher B, Zhang MQ: Identifying combinatorial regulation of transcription factors and binding motifs. Genome Biology 2004, 5: R56. 10.1186/gb-2004-5-8-r56

    Article  PubMed Central  PubMed  Google Scholar 

  31. Tsai HK, Hunag TW, Chou MY, Lu HS, Li WH: Method for identifying transcription factor binding sites in yeast. Bioinformatics 2006, 22: 1675–1681. 10.1093/bioinformatics/btl160

    Article  CAS  PubMed  Google Scholar 

  32. Wu WS, Li WH, Chen BS: Computational reconstruction of transcriptional regulatory modules of the yeast cell cycle. BMC Bioinformatics 2006, 7: 421. 10.1186/1471-2105-7-421

    Article  PubMed Central  PubMed  Google Scholar 

  33. Chen HC, Lee HC, Lin TY, Li WH, Chen BS: Quantitative characterization of the transcriptional regulatory network in the yeast cell cycle. Bioinformatics 2004, 20: 1914–1927. 10.1093/bioinformatics/bth178

    Article  CAS  PubMed  Google Scholar 

  34. Chen KC, Wang TY, Tseng HH, Huang CY, Kao CY: A stochastic differential equation model for quantifying transcriptional regulatory network in Saccharomyces cerevisiae . Bioinformatics 2005, 21: 2883–2890. 10.1093/bioinformatics/bti415

    Article  CAS  PubMed  Google Scholar 

  35. Chang WC, Li CW, Chen BS: Quantitative inference of dynamic pathways via microarray data. BMC Bioinformatics 2005, 6: 44. 10.1186/1471-2105-6-44

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  36. Bussemaker HJ, Li H, Siggia ED: Regulatory element detection using correlation with expression. Nat Genet 2001, 27: 167–171. 10.1038/84792

    Article  CAS  PubMed  Google Scholar 

  37. Yu H, Luscombe NM, Qian J, Gerstein M: Genomic analysis of gene expression relationships in transcriptional regulatory networks. Trends Genet 2003, 19: 422–427. 10.1016/S0168-9525(03)00175-6

    Article  CAS  PubMed  Google Scholar 

  38. Zhu Z, Pilpel Y, Church GM: Computational identification of transcription factor binding sites via a transcription-factor-centric clustering (TFCC) algorithm. J Mol Biol 2002, 318: 71–81. 10.1016/S0022-2836(02)00026-8

    Article  CAS  PubMed  Google Scholar 

  39. Lin LH, Lee HC, Li WH, Chen BS: Dynamic modeling and gene expression prediction for cis regulatory circuit by cross gene identification scheme. BMC Bioinformatics 2005, 6: 258. 10.1186/1471-2105-6-258

    Article  PubMed Central  PubMed  Google Scholar 

  40. Liping J, Tan KL: Identifying time-lagged gene clusters using gene expression data. Bioiformatics 2005, 21(4):509–516. 10.1093/bioinformatics/bti1058

    Article  Google Scholar 

  41. Qian J, Dolled-Filhart M, Lin J, Yu H, Gerstein M: Beyond synexpression relationships: local clustering of time-shifted and inverted gene expression profiles identifies new, biologically relevant interactions. J Mol Biol 2001, 314: 1053–1066. 10.1006/jmbi.2000.5219

    Article  CAS  PubMed  Google Scholar 

  42. Qian J, Lin J, Luscombe NM, Yu H, Gerstein M: Prediction of regulatory networks: genome-wide identification of transcription factor targets from gene expression data. Bioinformatics 2003, 19: 1917–1926. 10.1093/bioinformatics/btg347

    Article  CAS  PubMed  Google Scholar 

  43. Schumaker L: Spline functions: basic theory. New York: Wiley; 1981.

    Google Scholar 

  44. Benjamini Y, Hochberg Y: Controlling the false discovery rate: a practical and powerful approach to multiple testing. Journal of the Royal Statistical Society, Series B 1995, 57: 289–300.

    Google Scholar 

  45. Efron B, Tibshirani RJ: An introduction to the Bootstrap. London: Chapman Hall; 1993.

    Book  Google Scholar 

Download references

Acknowledgements

This study was supported by the National Science Council and Academia Sinica, Taiwan, AS-95-TP-A05.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wei-Sheng Wu.

Additional information

Authors' contributions

WSW developed the algorithm, performed the simulation and wrote the manuscript. WHL and BSC gave the research topic, provided essential guidance and revised the manuscript. All authors read and approved the final manuscript.

Electronic supplementary material

Authors’ original submitted files for images

Below are the links to the authors’ original submitted files for images.

Authors’ original file for figure 1

Authors’ original file for figure 2

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.

Reprints and permissions

About this article

Cite this article

Wu, WS., Li, WH. & Chen, BS. Identifying regulatory targets of cell cycle transcription factors using gene expression and ChIP-chip data. BMC Bioinformatics 8, 188 (2007). https://doi.org/10.1186/1471-2105-8-188

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1186/1471-2105-8-188

Keywords