- Methodology article
- Open Access
Using local gene expression similarities to discover regulatory binding site modules
BMC Bioinformatics volume 7, Article number: 505 (2006)
We present an approach designed to identify gene regulation patterns using sequence and expression data collected for Saccharomyces cerevisae. Our main goal is to relate the combinations of transcription factor binding sites (also referred to as binding site modules) identified in gene promoters to the expression of these genes. The novel aspects include local expression similarity clustering and an exact IF-THEN rule inference algorithm. We also provide a method of rule generalization to include genes with unknown expression profiles.
We have implemented the proposed framework and tested it on publicly available datasets from yeast S. cerevisae. The testing procedure consists of thorough statistical analyses of the groups of genes matching the rules we infer from expression data against known sets of co-regulated genes. For this purpose we have used published ChIP-Chip data and Gene Ontology annotations. In order to make these tests more objective we compare our results with recently published similar studies.
Results we obtain show that local expression similarity clustering greatly enhances overall quality of the derived rules, both in terms of enrichment of Gene Ontology functional annotation and coherence with ChIP-Chip binding data. Our approach thus provides reliable hypotheses on co-regulation that can be experimentally verified. An important feature of the method is its reliance only on widely accessible sequence and expression data. The same procedure can be easily applied to other microbial organisms.
As the shape of an organism's transcriptome is determined not only by the coding sequences of the genome but also by the mechanisms of gene regulation, massive efforts in sequencing require a similar follow up with the analysis of regulation systems. In recent years, technology has provided powerful tools to address this task, allowing for the accumulation of sequence, microarray, and functional data. Similar advancements are needed in the computational methods of data analysis.
The key role in transcriptional regulation of genes is played by a group of proteins called transcription factors (referred to as TFs) [1, 2]. Their main function is to bind to the DNA upstream of a gene and take part in initiating transcription. TFs bind to the upstream DNA sequence selectively, i.e. TFs recognize specific DNA sequence motifs. Another important property of TFs is that they often interact with each other to create functional protein complexes [2, 3]. Finding the connections between TFs as well as their respective binding sites and understanding the combinatorial nature of their interactions is currently an active field of research.
Our method aims at discovering binding site modules, i.e. functional sets of binding sites present in upstream regulatory regions of genes and used by several TFs in combination to regulate the expression of these genes. This task presents a considerable challenge because motif data are usually derived only from statistically significant over-representations of hypothetical binding sequences and therefore contain many false positives (i.e. occurrences of motifs that are not active in the cell in vivo). Also, a significant amount of noise in the expression data may lead to errors in identifying correlations among genes.
Several studies [3–7] have applied gene expression clustering to find groups of genes that may be co-regulated. However, some of the transcription factors are active only during certain parts of the cell cycle , and therefore genes that are co-regulated by those factors show strong expression correlations only over a subset of data points. Consequently, these modules may sometimes be undetectable by means of global expression clustering. Here we show how local expression clustering may overcome these shortcomings by means of an extensive comparison of the performance of local and global expression similarity in detecting biologically significant binding site modules.
Our method identifies regulatory binding site modules by means of analyzing their ability to predict gene expression. To this end we systematically examine all the combinations of binding sites suggested in the Hughes study . As input data we use the expression time-profiles of a large group of genes, and information on the presence or absence of binding site motifs in the promoters of all genes in the studied genome. Genome-wide expression data are readily available for many organisms, for example from public databases such as ArrayExpress  or Stanford Microarray Database . As for motif data, there are extensive databases such as Transfac  covering experimentally verified motifs for many model organisms. In cases where there is not enough motif data, putative motifs may be obtained using one of the well established motif finding tools (e.g. [12–20]).
In the present study we expand on the framework we have previously developed  by adding a capacity for analyzing local expression similarity. Furthermore, instead of the heuristic algorithm we have used earlier, we perform an exact and exhaustive search of the rule space. We strive for improvements in both sensitivity and coverage of our approach.
The overall methodology of the current study is schematically depicted in Figure 1 and consists of four steps (described in detail in the following sections and in Methods):
Clustering. Selecting all groups of genes that are co-expressed (in terms of Pearson correlation) limited to any sufficiently long period of time (for an example see Figure 2).
Merging. Combining motif data and clustering information into decision tables, one table per cluster (as in Figure 3), such that each cluster is a decision class in the respective table.
Rule induction. Finding all motif combinations capable of predicting the expression behavior of each cluster.
Generalization. Assigning genes that lack expression data to modules based on the presence of significant motifs in their promoters.
We assume that genes that are co-regulated by common transcription factors display strong correlation in their expression profiles. Some transcription factors, however, may bind only under certain conditions. Indeed, many genes from S. cerevisae demonstrate expression correlation only during parts of the cell cycle (see Figure 2). For these genes it is not possible to obtain clusters reflecting this property by using expression similarity over the entire expression profile. However, by introducing time windows and allowing for cluster overlaps, it is possible to group genes into clusters with tightly correlated local expression. The advantage of local expression correlations was earlier identified by Gasch et al. , who used a fuzzy k-means clustering to allow for multiple cluster assignments of some genes. Their method however was not designed to infer temporal properties of co-regulation. Time window analysis of expression profiles was then introduced by Lagreid et al. . The authors used expression analysis and machine learning methods to predict gene function (specifically GO biological process annotation of genes).
The notion of local analysis of expression profiles leads to a modified approach to profile clustering. We consider groups of genes that show very high correlation throughout a part of the expression profile. Specifically, we take into account all possible time spans of a given length (in our case ranging from 4 to 8 consecutive time points) and using a simple clustering algorithm (see Methods) we obtain all groups of genes with expression profiles correlated in any time window.
Merging expression and motif data
Once we compute all sets of locally co-expressed genes we relate that information to motif data. For each cluster, we create a decision table as shown in Figure 3 with genes from the cluster labeled IN and all other genes labeled OUT. In these tables, rows correspond to genes and columns correspond to binding site motifs. If a motif is present in the promoter of a gene, then we place a value of 1 in the proper row and column (otherwise the values are set to 0). The last column is the decision class, containing the value I N if the respective gene is a member of the considered cluster (or OUT otherwise).
As a learning model for describing putative regulatory binding site modules, we develop implication rules of the following form:
The left-hand side (LHS) of the rule requires a set of motifs to be present in the upstream regulatory region of a gene. The right-hand side (RHS) predicts that the expression of that gene over some data points (e.g. from second to tenth) will be similar (e.g. with correlation coefficient > 0.9) to the expression profile of the cluster representative (e.g. YLR197W). We say that a gene matches the left-hand side of the rule if its promoter contains all the motifs enlisted in that rule. Similarly, we state that a gene matches the right-hand side of the rule if its expression profile in the proper time window is correlated with the expression of the cluster representative with a coefficient greater than the given threshold.
We cannot claim that the rules we derive fully describe the complex nature of gene regulation. Rather, we aim at providing a simple model linking the available types of data, which oftentimes are marred by considerable levels of noise. Therefore, instead of interpreting the rules in the strict sense (i.e. the left-hand side matching the right-hand side exactly, with genes containing the specified motifs in their promoters forming the corresponding expression profile cluster), we look for rules satisfying two criteria we have introduced previously :
generality, i.e. each rule covers at least 5 genes,
accuracy, i.e. of all the genes matching the left-hand side of the rule, at least 2/3 of them match the right-hand side of the same rule.
For the task of rule induction, we use an exact algorithm based on suffix trees (see Methods).
We are interested in finding out whether the rules obtained from the procedure described in the previous section can be used to generate sound hypotheses on co-regulation of genes of unknown expression, i.e. could the information contained in the rules be extended to genes not included in the expression dataset? We investigate this question by searching for the previously identified binding site modules in the promoters of genes with unknown expression, and as a result create larger sets of putatively co-regulated genes. We can then evaluate these extended gene sets and compare with previous results.
We have tested our methodology on a cell cycle expression data set from S. cerevisae (see Data Material). Using a range of time windows (from 4 to 8 time points) and correlation thresholds (from 0.6 to 0.9) we obtained 3446 rules describing 337 unique binding site modules (several rules specifying the same binding site module were obtained from different time windows). These rules describe the regulation of approximately 1500 genes of the S. cerevisae genome. Even though our input dataset corresponds to the best-understood biological process of one of the most extensively described species, the knowledge of underlying biological processes is far from sufficient to enable direct evaluation of our rules. Indeed one would be hard pressed to find many reported examples of the effects of a particular combination of TFs on a given gene measured under specific conditions in the cell. Instead, we limit our evaluation to genomic-scale type comparisons with the available experimentally-derived datasets on gene regulation in S. cerevisae. We provide an extensive analysis of the statistical significance of our results in comparison with published studies concerning S. cerevisae cell cycle datasets. We also present two examples showing how rules obtained for particular time segments of the cell cycle can provide a more specific description of regulation: rules that could not be discovered without current improvements.
To assess the statistical significance of our results, we use the scoring procedure introduced in our earlier work . We test putatively co-regulated groups of genes for overrepresentation of annotations from Gene Ontology  and the actual binding of transcription factors in S. cerevisae  (details of the scoring methodology are described in the following sections). To allow for a more direct and complete comparison with the results of other methods [4, 24–26] we compute our scores for the groups of putatively co-regulated genes they provide. This was also done in an attempt to put all the available results on the same footing with respect to changes in GO annotations over time and with respect to the available experimental binding data. Although all authors use very similar methods of measuring statistical significance, we fully realize that the above may not be the only way to make such comparisons .
In the case of our own approach, evaluation with experimental binding data surprisingly produces better results for groups supplemented with genes not included in the expression dataset. We investigate this phenomenon further by using a second type of evaluation, a pairwise co-regulation coefficient (PCC). PCC is characterized by a different dependency on cluster size than the p-value based scores and thus provides an alternative way to evaluate results. The outcome of this evaluation procedure is presented in a separate section.
Evaluation with Gene Ontology
Genes sharing a common function are very often co-regulated. Many authors use the publicly available information on genes sharing function to assess their predictions of co-regulation [4, 6, 24–26]. Although very indirect, this may serve as a crude estimate of the biological significance of the rules we derive. Following this line of reasoning we use Gene Ontology , a human-curated set of biological terms (referenced to as GO terms) to annotate the function of genes. The terms are organized into three hierarchies (molecular function, cellular component and biological process) describing biological roles at different levels of detail.
In this work we employ the scoring procedure from Hvidsten et al.  introduced by Cho et al. . This procedure treats all sets of genes sharing common Gene Ontology annotations as sets of co-regulated genes. To this end we consider all GO terms at all levels in each hierarchy and treat all genes annotated with that term and its descendants as sharing annotation (see Methods for details).
Gene Ontology scores for our sets of rules (one set for each expression correlation threshold) are summarized in Table 1 and are compared with scores for previously published studies.
Evaluation with experimental binding data
In the case of S. cerevisae, there is a much more direct way to evaluate results than using Gene Ontology. Harbison et al.  published the results of ChIP-Chip experiments measuring p-values of the binding of 352 transcription factors to 6229 intergenic regions. For evaluation we consider genes with promoters that are bound by the same transcription factor as co-regulated by that TF (see Methods for details).
Table 2 presents the fractions of gene groups scored as significant. It is especially intriguing how greatly the scores are improved by the addition of genes without assigned expression profiles. The latter is generally not the case when evaluations are performed with GO. For comparison, in Table 2 we include the scores of other studies computed in the same manner.
One has to keep in mind that although ChIP-Chip data currently represents the most direct measurements of transcriptional regulation on a genomic scale, it is only a statistical measure of the TFs binding to promoter regions under some specific conditions. In reality, transcriptional regulation is a time-dependant process, with TFs dynamically binding and unbinding to DNA, and cannot be accurately described by a single "snapshot" as in ChIP-Chip data. Nonetheless we accept this simplification since no better data currently exist. It would be very interesting to include time-series ChIP-Chip data in our analysis once they become available.
Pairwise Co-regulation Coefficient (PCC)
Since our scoring is based on statistical significance of gene group overlap, it can be argued that the increase in the scores of generalized rules can be attributed to the increase in gene group size rather than to a better quality of rules. To investigate this, we need a different scoring methodology providing additional insight into rule quality for large groups of genes. To this aim we employ the pairwise co-regulation coefficient (PCC). For a given set of gene groups the PCC measures the fraction of gene pairs from the same group that are actually co-regulated (according to data from Harbison et al. , p < 0.01). Here, we choose to restrict our analysis to the experimental binding data as it provides a much more direct way of evaluating co-regulation than the GO annotation enrichment.
A PCC value can then be interpreted as follows: Assuming that we choose a random pair of genes annotated as co-regulated according to some prediction method (i.e. assigned to the same group of "putatively co-regulated" genes), what are the chances that they are actually co-regulated (i.e. have an experimentally verified common regulator)? Moreover, the PCC value has the nice property that all TFs that bind to at least two genes in the same module contribute to the score, and hence all possible subgroups of co-regulated genes are accounted for in one value.
Since the number of pairs increases proportionally to the square of the number of genes it is less likely for a large group to obtain a high PCC score than for a small one. This is due to the fact that the introduction of a new gene which is not co-regulated with the others to a group of size n will introduce n erroneous pairs that have to be accounted for in the score.
The results of this type of analysis and comparison with other studies are summarized in Table 3. To provide reference values for our results we have computed the PCC scores also for random sets of genes. We sampled 3 families of random gene sets generated to reflect the size and number of sets in the real data with the following results:
random sets of genes sharing common binding motifs (but not necessarily co-expressed) (PCC = 0.171, st.dev = 0.062),
random sets of co-expressed genes (not necessarily sharing common binding motifs) (PCC = 0.109, st.dev. = 0.020),
totally random sets of genes (PCC = 0.020, st.dev. = 0.019).
The PCC scores for our approach show that the increase in the size of the groups caused by the generalization of rules does not result in a notable change in the quality of the rules. Although this indicates that the surprising increase in p-value significance (Table 2) is largely due an increase in the number of genes for which the statistical test is conducted, the PCC scores indicate that generalization indeed can be used as a tool for predicting co-regulation of genes with unknown expression.
To quantify the predictive value of the system of rules as a whole, we have to measure the quality of the rules for all genes. Towards this aim we use the experimental binding data and compute the p-values of all rules as in the previous section. As a result of this procedure we obtain p-values for all the genes covered by the rules. Since the results of different studies cover different sets of genes, we have decided to present the data as a plot (see Figure 4), with the Y-axis representing p-values, and the X-axis all the genes sorted by the best p-value. We use the logarithmic scale in Y to emphasize the region around the significance threshold (0.01). The results for each method are represented by a line with each point (x, y) representing the number of genes (x) covered by the rules with a p-value of y or lower (i.e. more significant). If a gene is assigned to one rule only, the respective p-value can be interpreted as a predictive strength of the method for this particular gene. Because our method describes regulation in terms of overlapping modules it is more difficult, compared to the other approaches, to associate each gene with only one p-value. To demonstrate the full potential of the method we construct the plot in Fig. 4 using p-values of the best scoring rules for each gene. As a control we also show a similar plot using the p-values of the worst scoring rules (Fig. 5).
Given a set of rules, an attempt can be made at predicting regulation patterns for other genes in the system, in particular the ones for which no expression data are available. A simple procedure to follow is to select the rules matching the gene in question. Since our rules are labeled with binding site modules and expression profiles, they provide a hypothetical regulatory circuitry for that gene. A similar approach could be applied to results of other studies; however, not all of them mark their groups of putatively co-regulated genes with motifs and expression profiles.
We can see from the plot in Figure 4 that although our methodology (using rule generalization) does not have the highest coverage of all studies in general, it clearly performs best in the area of significant p-values (i.e. it covers more than 1200 genes with p-value < 0.01 whereas other methods cover less than 600 with the same p-value). It is important to note that if we do not include the genes with unknown expression in the analysis, the predictive value of our rules is reduced to a limited set of genes, comparable in size to those obtained with other methods (~300 genes with p-value < 0.01).
Since our method provides significantly more gene groups (i.e. rules) that other methods do, it may be argued that the real reason behind the high coverage we obtain is the large number of overlapping rules and the fact that we select the best rule for each gene. To this end we compare our results with two additional plots (in Figure 5):
Scores for the set of generalized rules, calculated by taking the worst rule instead of the best rule for each gene. As we can see from the figure, even if we deliberately choose the worst rule for all genes, we can still annotate over 600 genes with rules that are significant.
Scores for the set of generalized rules calculated by taking the best rule for each gene after randomly permuting all gene labels. This test clearly shows that even if we consider a large number of overlapping rules and select the best rules for each gene, we should not expect many genes to be covered by significant rules by chance.
In addition to genome wide analysis, it is interesting to take a look at some specific examples of rules, to examine if the information they provide is indeed biologically meaningful. In this paragraph we examine two putative binding modules.
The first combination of motifs, REB1, SWI5 and SCB, can be found overall in 19 rules, all of which are based on time windows comprising the 9th and 10th data points. Based on the original publication of the expression profiles  we can map these points to the M1/G phase boundary which is exactly the active time of the SWI5 factor (according to Saccharomyces Genome Database). It is interesting that this combination of motifs was not identified by our previous study . Such identification was not really possible, since the expression profile similarity is strong enough only in the part around the 10th time point (see Figure 6). This particular combination of motifs is also strongly supported by a highly significant p-value of 4 · 10-6 for the ChIP-Chip data.
Another interesting example combines motifs MCM1, SWI5 and ECB. This binding module is also not found in the previous study, where only combinations of MCM1' with SWI5 are reported. Again the reason behind missing this combination in the earlier work is the local nature of the expression correlation that cannot be identified in a global analysis (see Figure 7). However, applying local clustering identifies this module as significant in 71 rules, all of which are based only on time windows starting at the 2nd, 3rd or 4th time point. This is reasonable, since the ECB motif denotes early cell-cycle box. The module is also highly significant in terms of binding evaluation: p = 1.49·10-8.
The two examples presented here show that our approach based on local expression similarity can retrieve significant binding site modules that cannot be found by other methods based on global similarity. Furthermore, these modules were not only shown to be statistically significant (i.e. p < 10-6 using experimental binding data), but also biologically significant (i.e. verified by published experiments).
Discussion and conclusion
Recently, several studies have investigated the combinatorial nature of gene regulation. By analyzing expression coherence of genes containing pairs of binding site motifs in their promoters, Pilpel et al.  demonstrated that combination of binding sites provides a key to understanding regulation. Several later studies [24–26] employed the methodology of Bayesian networks to investigate the structure of regulatory combinations in S. cerevisae using expression data and promoter sequences. The aim of those studies was to identify a partition of the S. cerevisae genome into non-overlapping clusters of putatively co-regulated genes. Segal et al.  proposed using Bayesian models, where genes were assigned to clusters based on the presence of sets of motifs in their promoters. The authors employed the expectation maximization (EM) learning procedure to build a model that best matched the data. During optimization, both gene and motif sets were changed until convergence. As a result the authors obtained a rich probabilistic model describing combinatorial regulation. Beer and Tavazoie  took a slightly different approach by fixing the clustering and learning a Bayesian network to predict expression profiles. Again, a very complex model taking into account motif placement and orientation was obtained. However, by fixing the clustering (and removing clusters too small for accurate prediction) the authors decreased the number of model parameters which lead to better convergence of the learning process.
Previously  we have proposed a change to this paradigm. The idea was to induce rules connecting groups of binding sites (so-called binding site modules) with possibly overlapping clusters of genes characterized by similar expression profiles. The method aimed at finding general rules predicting similarity in expression from the occurrence of sequence motifs. Groups of putatively co-regulated genes could then be obtained by selecting genes matching the left-hand-side of the rules. We have shown that this less complex strategy obtained groups of genes that scored comparably well in relation to previous studies, both in terms of ontology annotations and binding verification. In the current study we present two significant improvements of the above approach: using local expression similarity in clustering of time series data and extending the framework to include genes for which no expression profile data have been reported.
We have also attempted a comprehensive comparison of all of the above mentioned computational methods to assess their biological significance. This is not an easy task since no definitive source of genome-wide data on true co-regulation exists. Beer et al.  evaluated their ability to predict genes belonging to expression clusters using the classical training-test set division of the genes in a cross validation setting. However, there is of course no guarantee that these clusters correspond to truly co-regulated genes. Furthermore, the studies we compare applied different clustering methods resulting in different clusterings. Consequently, there is no consistent way of deciding whether a prediction is correct across different studies, and hence it seems inappropriate to use the ability to predict expression as an evaluation criterion here. Instead, we argue that a better approach for evaluating the predicted co-regulated genes is to apply external data/knowledge not used to induce the models themselves.
Using experimental binding data and Gene Ontology annotations, we demonstrate improvements in both quality (Tables 1, 2, 3) and coverage (Figure 4) when using local similarity of expression profiles. Furthermore, we showed that expanding the modules to include genes without known expression profiles did not reduce the quality of the rules and thus we conclude that the approach indeed is capable of generalizing to these genes.
Obviously, also the evaluation data used in this study may be associated with some disadvantages. The ChIP-Chip data is inevitably linked to a specific biological context, and thus different contexts/cellular states would result in different binding data and consequently different evaluation scores in our study. The use of functional categories to search for binding site motifs  may also provide an unfortunate bias when evaluating different methods using Gene Ontology. However, to the best of our knowledge, these are the most appropriate data sets for evaluation that exist. And by comparing different studies using the same evaluation method and the same data, any unfortunate bias should at least be the same for all the methods. On the one hand, the relatively large range of performance observed for the methods we have compared indicates that the problem of finding binding site modules is far from solved. On the other hand, it is also an indication that at least some non-trivial correlations between TF binding and sequence motifs or between functional annotation and sequence motifs are being picked up by our approach. Finally, the use of different data in terms of experimental data (TF binding), and human-curated knowledge (Gene Ontology) strengthens our confidence in the biological significance of the presented evaluations.
Similar methodology, i.e. IF-THEN rules connecting TF modules with expression profiles, was used in a recently published study of Pham et al. . However, one difference is that we do not use Chromatin-Immunoprecipitation data [23, 31] for rule inference but only as an independent standard for method evaluation. This means that our method is also applicable to organisms for which no genome-wide ChIP-Chip results are available. The underlying difference in approach also prevents us from direct comparisons with the results of that study. It should be mentioned here that although the rule induction method is applicable to all types of expression datasets, the particular time window improvement evaluated in this study obviously requires time profile expression data. However, the idea of measuring expression similarity over subsets of conditions could still be fruitful in non-time profile expression data by using so-called bi-clustering to identify subsets of conditions .
Results of all the performed analyses (i.e. using both statistical significance and pairwise co-regulation coefficient calculations) support the conclusion that local correlation of expression time profiles combined with sequence motif information leads to more accurate predictions of binding site modules than was possible with other methods. It is also clear, provided that enough data are available to develop the initial modules, that the method generalizes well over the genes for which no expression data are available.
Gene clustering using local similarity of expression
For clustering the expression profiles, we have adopted the procedure successfully employed in our earlier work . However, two modifications were necessary:
We have changed the distance function from Euclidean distance to Pearson correlation, since it is better suited for comparison of partial expression profiles.
Since we are calculating the clustering for all possible time windows of sizes 4–8, we cannot afford to compute the clusters centered on every possible gene. Instead we iteratively exclude genes already assigned to a cluster from further processing. Although this makes the clustering potentially sensitive to the ordering of the genes, it is a necessary sacrifice to reduce the number of decision tables from which the rules are induced. Moreover, experiments with randomly reshuffled data have convinced us that, although different ordering of genes provides slightly different clusterings, it has no significant impact on the rules we obtain from the entire procedure.
The gene clustering algorithm allows for adjustable size and position of time windows, as well as adjustable correlation thresholds. Once those parameters are set, the algorithm starts with all genes and repeatedly
selects the first unassigned gene as a representative for the new cluster,
assigns all genes fulfilling the two criteria below to the newly created cluster:
the Pearson correlation coefficient calculated with respect to the representative gene is above the selected threshold
comparison is restricted to the time window of the specified size and starting point.
The procedure of rule induction is based on our previous approach  and modified as described below. Given a cluster of genes with expression correlated over a period of time we view the induction of rules as an instance of the classic decision problem. The set of all genes in the system constitutes the universe where the decision class corresponds to the membership in the cluster, and where the gene attributes are formed by a Boolean vector containing information on the presence or absence of each motif in the promoter. Given a decision table of this kind we can ask if there exists a combination of motifs allowing us to discern between the genes in the cluster and all other genes. Finding such combinations is NP-complete , so in Hvidsten et al.  we have employed the Rosetta software  based on the rough-set paradigm [35, 36], which uses some well-established heuristics to obtain a set of locally optimal results. The set of rules inferred by the Rosetta system is then filtered in order to retain only the rules that are both general enough (i.e. cover more than 5 genes) and sufficiently accurate (i.e. at least 2/3 of the genes matching the LHS of the rule must be present in the cluster).
In the case of the S. cerevisae genome, it was first observed by Lee et al.  that the number of transcription factor binding sites present in one promoter is on average very low (in our dataset it is approximately 6). We therefore assume that the number of motifs to be considered for each cluster is small enough to successfully employ an exhaustive search yielding all possible results. Since we ignore the ordering and the number of motifs in the promoter, we consider all TF motifs to be symbols of a finite alphabet and treat binding site modules as words over this alphabet. For each gene set considered we construct a suffix tree including all words (sets of motifs) occurring in the promoters of genes in the set. We can quickly annotate each branch of that tree with the number of occurrences of the corresponding word. With this technique, we can safely avoid visiting the tree branches with coverage lower than required and eliminate unnecessary computations. By using an exact and exhaustive algorithm instead of a heuristic, we have obtained a broader set of modules with better quality. The development of the software dedicated for this task significantly increased the efficiency of rule induction.
S. cerevisae cell cycle expression time series data were taken from Cho et al. . The dataset contains expression profiles of 6601 genes at 17 time points, of which 2501 were selected for our analysis according to the following criteria:
no missing values were allowed at any of the time points,
divergently transcribed genes were excluded (i.e. two genes sharing the same promoter region).
Motif dataset was taken from Hughes et al. . It consists of the occurrences of 47 binding site motifs in 5652 promoters found by the AlignACE motif finding program.
For evaluation with experimentally observed binding we used data from ChIP-Chip experiments published by Harbison et al. . It contains evidence of binding for 352 transcription factors at 6229 intergenic regions. We take only binding occurrences reporting a p-value < 0.01 . We have also performed the same evaluation using an earlier dataset  (with very similar results) and the results can be found on our supplementary materials website.
For Gene Ontology evaluation, we used the newest (as of April 2005) GO-DAG and annotations: GO version 1.419 and annotations Revision: 1.1109. All above-mentioned GO data can be downloaded from .
Measuring statistical significance
To measure the statistical significance of our rules we use Bonferroni corrected p-values. Let us assume that we have a rule R and a family of gene sets constituting our reference (i.e. sets of genes bound by the same transcription factors or sets of genes sharing common annotations in Gene Ontology). For every rule R, we consider its overlap with all sets f ∈ i.e. the set of genes from f matching the left-hand-side (LHS) of R. Then the p-value we calculate for the rule R and the set f is the probability of obtaining such overlap by chance, which can be computed from the hyper-geometric distribution:
where x is the size of the overlap, N is the number of all genes, n is the number of genes matching the left-hand side of the rule R and k = |f|.
For each rule we calculate a p-value against many sets (i.e. annotations, transcription factors). Since we only require that each rule has a low p-value for one of the sets, we apply the Bonferroni correction, which is a standard procedure to account for testing multiple hypotheses. We state that a rule R covering n out of N genes is statistically significant against if it has a Bonferroni corrected p-value of less than 0.01, i.e.
where x(R, f) calculates the number of genes from the set f covered by the left-hand side of the rule R. The Bonferroni correction only accounts for the multiple hypotheses tested for each individual rule. One could in addition include a similar correction for the fact that we induce a relativity large number of rules. However, here we opt for reporting the fraction of significant rules, which in all cases is much larger than what would be expected by chance (i.e. at the significance level 0.01 one would expect only 1% of the rules to be significant by chance).
In the case of Gene Ontology evaluation, for each rule we consider each part of the ontology separately (molecular function, cellular component, and biological process), and define as all annotations in that part of the ontology. In the case of ChIP-Chip data, we first consider all the TFs bound to any of the genes matching the rule, and then define as all the sets of genes bound by each of those transcription factors. For Gene Ontology, we copied all annotations made for any gene matching the rule upwards to all more general nodes in the ontology. We then considered to be all sets of genes annotated by any of these nodes.
Supplementary information for this article (full set of rules, additional charts and tables) can be found on our website . We have also made a web interface for querying rules induced from the S. cerevisae cell-cycle. Through this interface one can search for rules including any particular gene or binding site.
Holstege FC, Jennings EG, Wyrick JJ, Lee TI, Hengartner CJ, Green MR, Golub TR, Lander ES, Young RA: Dissecting the regulatory circuitry of a eukaryotic genome. Cell 1998, 95(5):717–728. 10.1016/S0092-8674(00)81641-4
Tsonis P: Anatomy of gene regulation. Garland Publishing; 2003.
Pilpel Y, Sudarsanam P, Church GM: Identifying regulatory networks by combinatorial analysis of promoter elements. Nat Genet 2001, 29(2):153–9. 10.1038/ng724
Hvidsten T, Wilczyński B, Kryshtafovych A, Tiuryn J, Komorowski J, Fidelis K: Discovering regulatory binding site modules using rule-based learning. Genome Research 2005, 15(6):856–866. 10.1101/gr.3760605
Vilo J, Brazma A, Jonassen I, Robinson A, Ukkonen E: Mining for putative regulatory elements in the yeast genome using gene expression data. Proc Int Conf Intell Syst Mol Biol 2000, (8):384–94.
Segal E, Wang H, Koller D: Discovering Molecular Pathways from Protein Interaction and Gene Expression Data. Bioinformatics 2003., 19(Suppl 1):
Gasch AP, Eisen MB: Exploring the conditional coregulation of yeast gene expression through fuzzy k-means clustering. Genome Biol 2002, 3(11):RESEARCH0059. 10.1186/gb-2002-3-11-research0059
Hughes JD, Estep PW, Tavazoie S, Church GM: Computational identification of cis-regulatory elements associated with groups of functionally related genes in Saccharomyces cerevisiae. J Mol Biol 2000, 296(5):1205–1214. 10.1006/jmbi.2000.3519
Parkinson H, Sarkans U, Shojatalab M, Abeygunawardena N, Contrino S, Coulson R, Farne A, Lara GG, Holloway E, Kapushesky M, Lilja P, Mukherjee G, Oezcimen A, Rayner T, Rocca-Serra P, Sharma A, Sansone S, Brazma A: ArrayExpress – a public repository for microarray gene expression data at the EBI. Nucleic Acids Res 2005, (33 Database):553–555.
Ball CA, Awad IAB, Demeter J, Gollub J, Hebert JM, Hernandez-Boussard T, Jin H, Matese JC, Nitzberg M, Wymore F, Zachariah ZK, Brown PO, Sherlock G: The Stanford Microarray Database accommodates additional microarray platforms and data formats. Nucleic Acids Res 2005, (33 Database):580–582.
Matys V, Fricke E, Geffers R, Gossling E, Haubrock M, Hehl R, Hornischer K, Karas D, Kel AE, Kel-Margoulis OV, Kloos DU, Land S, Lewicki-Potapov B, Michael H, Munch R, Reuter I, Rotert S, Saxel H, Scheer M, Thiele S, Wingender E: TRANSFAC: transcriptional regulation, from patterns to profiles. Nucleic Acids Res 2003, 31: 374–378. 10.1093/nar/gkg108
Tompa M, Li N, Bailey TL, Church GM, De Moor B, Eskin E, Favorov AV, Frith MC, Fu Y, Kent WJ, Makeev VJ, Mironov AA, Noble WS, Pavesi G, Pesole G, Regnier M, Simonis N, Sinha S, Thijs G, van Helden J, Vandenbogaert M, Weng Z, Workman C, Ye C, Zhu Z: Assessing computational tools for the discovery of transcription factor binding sites. Nat Biotechnol 2005, 23: 137–144. 10.1038/nbt1053
Pavesi G, Mereghetti P, Mauri G, Pesole G: Weeder Web: discovery of transcription factor binding sites in a set of sequences from co-regulated genes. Nucleic Acids Res 2004, (32 Web Server):199–203.
Eskin E, Pevzner PA: Finding composite regulatory patterns in DNA sequences. Bioinformatics 2002, 18(Suppl 1):354–363.
Workman CT, Stormo GD: ANN-Spec: a method for discovering transcription factor binding sites with improved specificity. Pac Symp Biocomput 2000, 467–478.
Hertz GZ, Stormo GD: Identifying DNA and protein patterns with statistically significant alignments of multiple sequences. Bioinformatics 1999, 15(7–8):563–577. 10.1093/bioinformatics/15.7.563
Bailey TL, Elkan C: Fitting a mixture model by expectation maximization to discover motifs in biopolymers. Proc Int Conf Intell Syst Mol Biol 1994, 2: 28–36.
Roth FP, Hughes JD, Estep PW, Church GM: Finding DNA regulatory motifs within unaligned noncoding sequences clustered by whole-genome mRNA quantitation. Nat Biotechnol 1998, 16(10):939–45. 10.1038/nbt1098-939
Mahony S, Golden A, Smith TJ, Benos PV: Improved detection of DNA motifs using a self-organized clustering of familial binding profiles. Bioinformatics 2005, 21(Suppl 1):283–291. 10.1093/bioinformatics/bti1025
Hertzberg L, Zuk O, Getz G, Domany E: Finding motifs in promoter regions. J Comput Biol 2005, 12(3):314–330. 10.1089/cmb.2005.12.314
Lagreid A, Hvidsten TR, Midelfart H, Komorowski J, Sandvik AK: Predicting gene ontology biological process from temporal gene expression patterns. Genome Res 2003, 13(5):965–979. 10.1101/gr.1144503
Ashburner M, Ball CA, Blake JA, Botstein D, Butler H, Cherry JM, Davis AP, Dolinski K, Dwight SS, Eppig JT, Harris MA, Hill DP, Issel-Tarver L, Kasarskis A, Lewis S, Matese JC, Richardson JE, Ringwald M, Rubin GM, Sherlock G: Gene ontology: tool for the unification of biology. The Gene Ontology Consortium. Nat Genet 2000, 25: 25–9. 10.1038/75556
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(7004):99–104. 10.1038/nature02800
Beer MA, Tavazoie S: Predicting gene expression from sequence. Cell 2004, 117(2):185–198. 10.1016/S0092-8674(04)00304-6
Segal E, Shapira M, Regev A, Pe'er D, Botstein D, Koller D, Friedman N: Module networks: identifying regulatory modules and their condition-specific regulators from gene expression data. Nat Genet 2003, 34(2):166–76.
Segal E, Yelensky R, Koller D: Genome-wide Discovery of Transcriptional Modules from DNA Sequence and Gene Expression. Bioinformatics 2003, 19(Suppl 1):273–282. 10.1093/bioinformatics/btg1038
Khatri P, Draghici S: Ontological analysis of gene expression data: current tools, limitations, and open problems. Bioinformatics 2005, 21(18):3587–3595. 10.1093/bioinformatics/bti565
Cho RJ, Huang M, Campbell MJ, Dong H, Steinmetz L, Sapinoso L, Hampton G, Elledge SJ, Davis RW, Lockhart DJ: Transcriptional regulation and function during the human cell cycle. Nat Genet 2001, 27: 48–54.
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
Pham TH, Clemente JC, Satou K, Ho TB: Computational discovery of transcriptional regulatory rules. Bioinformatics 2005, 21(Suppl 2):iil01-ii107.
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(5594):799–804. 10.1126/science.1075090
Cheng Y, Church GM: Biclustering of expression data. Proc Int Conf Intell Syst Mol Biol 2000, 8: 93–103.
Hyafil L, Rivest RL: Constructing optimal binary decision trees is NP-complete. Inf Process Lett 1976.
Komorowski J, Øhrn A, Skowron A: The ROSETTA Rough Set Software System. In Handbook of Data Mining and Knowledge Discovery. Edited by: Klosgen W, Zytkow J. Oxford University Press; 2002.
Pawlak Z: Rough sets. International Journal of Computer and Information Sciences 1982, 11: 341–356. 10.1007/BF01001956
Pawlak Z: Rough sets : theoretical aspects of reasoning about data. Theory and decision library. Series D, System theory, knowledge engineering, and problem solving. Volume 9. Dordrecht; Boston: Kluwer Academic Publishers; 1991.
Yeast Cell Cycle supplementary[http://bioputer.mimuw.edu.pl/~bartek/CellCycle/.]
This work was supported by the Lawrence Livermore National Laboratory Directed R&D (03-ERD-049 to KF), by the Polish Committee for Scientific Research (grants No 3 T11F 021 28 and 3 T11F 022 29 to BW/JT), and by the Knut and Alice Wallenberg Foundation and the Swedish Foundation for Strategic Research (to TH/JK). We would like to thank especially the authors of [3, 6, 18, 22, 25, 26, 29] for making the results of their work publicly available. Thanks to Alice Lesser for reading the manuscript.
BW, TH, and KF conceptualized the project. BW implemented the local similarity clustering and rule inference framework, performed computations and wrote the original draft of the manuscript. TH developed and performed evaluations using Gene Ontology. All authors participated in the design of the study and contributed with critical remarks and ideas to improve the content of the manuscript.
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.
About this article
Cite this article
Wilczyński, B., Hvidsten, T.R., Kryshtafovych, A. et al. Using local gene expression similarities to discover regulatory binding site modules. BMC Bioinformatics 7, 505 (2006) doi:10.1186/1471-2105-7-505
- Gene Ontology
- Decision Table
- Rule Induction
- Suffix Tree
- Gene Ontology Annotation