Skip to main content

fREDUCE: Detection of degenerate regulatory elements using correlation with expression



The precision of transcriptional regulation is made possible by the specificity of physical interactions between transcription factors and their cognate binding sites on DNA. A major challenge is to decipher transcription factor binding sites from sequence and functional genomic data using computational means. While current methods can detect strong binding sites, they are less sensitive to degenerate motifs.


We present fREDUCE, a computational method specialized for the detection of weak or degenerate binding motifs from gene expression or ChIP-chip data. fREDUCE is built upon the widely applied program REDUCE, which elicits motifs by global statistical correlation of motif counts with expression data. fREDUCE introduces several algorithmic refinements that allow efficient exhaustive searches of oligonucleotides with a specified number of degenerate IUPAC symbols. On yeast ChIP-chip benchmarks, fREDUCE correctly identified motifs and their degeneracies with accuracies greater than its predecessor REDUCE as well as other known motif-finding programs. We have also used fREDUCE to make novel motif predictions for transcription factors with poorly characterized binding sites.


We demonstrate that fREDUCE is a valuable tool for the prediction of degenerate transcription factor binding sites, especially from array datasets with weak signals that may elude other motif detection methods.


Transcriptional regulation is modulated by a complex network of interactions between regulatory proteins and their binding targets on DNA. To comprehensively understand gene regulation at a systems level, a primary goal is to decipher the "regulatory code" that consists of knowledge of all transcriptional regulators, their DNA binding profiles, and their regulatory targets [1]. Regulatory information can be inferred from the combined analysis of genomic sequence with an abundance of microarray based methods such as ChIP-chip (chromatin immunoprecipitation on microarray)[2, 3] and transcription factor perturbation experiments [4, 5]. However, highly reliable regulator specificies have been unattainable for many regulators probed by such genomic-scale methods [1] since weak signals from regulators are often very difficult to isolate from experimental noise.

Thus, from a computational standpoint, a major challenge is to develop techniques that can extract maximal regulator specificity information from imperfect data. A common strategy among computational tools developed for this purpose is to first obtain a small group of genes in which a given motif may be statistically over-represented, from which the motif can then be elicited using methods such as position weight matrix updating and word enumeration [610]. While highly effective in some cases, a potential drawback of this approach is that the process of isolating a subgroup of sequences, typically done using clustering, cutoffs, or functional categorization, can be arbitrary. The delineation of signal from background may be poor for noisy experimental data, where cutoffs can lead to significant loss of information. Other algorithms, such as dictionary- [11] or steganalysis-based [12] methods, do not rely on clustering but can benefit from subgroup selection.

A technique used by many motif-finding algorithms is to integrate expression data into the search process [1214]. For example, the algorithm REDUCE (Regulatory Element Detection Using Correlation with Expression) avoids subgroup selection in a natural way by genome-wide fitting of motif counts to expression data [15]. REDUCE is a deterministic method that first enumerates oligonucleotides and then identifies words whose occurrence in promoter sequences correlate most strongly with expression data. This procedure is applied iteratively to produce a set of oligonucleotides that produce the best simultaneous fit to the data. REDUCE requires only a single expression dataset and makes use of the entire genomic dataset (both signal and background) to assess the significance of individual motifs. This method, which has already been widely applied [1621], allows greater sensitivity to weak transcriptional signals and facilitates the discovery of combinatorial effects between regulators.

One weakness of REDUCE is that it can miss weak but biologically significant variants of the regulator site. Highly degenerate motifs whose individual variants fall below the detection threshold will be missed altogether. This is particularly the case for regulators in higher mammalian genomes, which can exhibit strong site to site variation in specificity. Thus, we have generalized the REDUCE approach to examine words containing degenerate IUPAC symbols representing multiple bases (i.e. S = C or G). However, a straightforward extension of REDUCE using exhaustive enumeration of degenerate motifs becomes impractical when the motif length or number of degenerate positions increase. Specifically, by including m IUPAC symbols in a word of length l the motif search space increases by a factor of l ! m ! ( l m ) ! ( 11 4 ) m MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaadaWcaaqaaiabdYgaSjabcgcaHaqaaiabd2gaTjabcgcaHiabcIcaOiabdYgaSjabgkHiTiabd2gaTjabcMcaPiabcgcaHaaadaqadaqaamaalaaabaGaeGymaeJaeGymaedabaGaeGinaqdaaaGaayjkaiaawMcaamaaCaaaleqabaGaemyBa0gaaaaa@3D40@ where 11 is the number of IUPAC symbols (excluding A,C,G,T). For example, the computational cost is increased by 340-fold for l = 10 and m = 2, and by 3500-fold for m = 3. Therefore, we have developed fast-REDUCE (fREDUCE), a significant re-implementation of the REDUCE algorithm that allows efficient searches of the extended space of degenerate motifs. We have applied fREDUCE to detect multiple motifs for transcription factor binding sites in yeast as well as human.



The original version of REDUCE identifies motifs by exhaustively correlating all oligonucleotides up to length l in promoter sequences with expression data. However, the direct computation of the Pearson correlation coefficient is computationally laborious and is not well suited for analyzing large spaces of degenerate oligonucleotides. fREDUCE uses the following strategy to efficiently compute the Pearson coefficients of the most significant degenerate motifs (Figure 1): 1) A list of degenerate motifs that can be derived from the sequence data is generated. 2) For each degenerate motif, we can quickly compute a "pseudo-Pearson" coefficient, an estimate of the actual Pearson coefficient. The pseudo-Pearson coefficient is guaranteed to be an upper-bound on the actual Pearson coefficient and is used as a filter to eliminate most (typically >99.9%) of the motif list. 3) Actual Pearson coefficients are computed and the top motif is found and 4) The contribution from the top motif is subtracted from the expression data to form a residual, which is used for subsequent rounds of motif searching.

Figure 1

The fREDUCE algorithm. A set of possible IUPAC strings are generated from the input sequence. For each IUPAC string, we compute a pseudo-Pearson coefficient, which is an estimate and upper bound on the true Pearson coefficient. After the vast majority of motifs are filtered out using the pseudo-Pearson value, we then compute true Pearson coefficients for the remaining motifs and select the top motif. The residual expression value is then used to iteratively derive subsequent motifs.

Performance Assessment with Yeast ChIP-chip

To assess the performance of fREDUCE, we applied the algorithm to 352 ChIP-chip experiments from Harbison et. al. [1] involving 203 known and putative transcription factors in the budding yeast S. cerevisiae. For each ChIP-chip experiment, we correlated the normalized array data to the corresponding yeast intergenic sequences, eliciting motifs of up to length 8 and containing up to 2 IUPAC degenerate symbols. In order to verify the correctness of our predictions, we compared these results to a benchmarking set consisting of 65 high confidence motif logos assembled from the predictions of six separate motif finding algorithms [1]. For 47 of 65 benchmarks fREDUCE produced an IUPAC motif that was identical to the annotated motif, including correct degeneracies (Table 1). In comparison, we ran AlignACE [22, 23] on the same 65 ChIP-chip experiments. Using the same filtering and comparison criteria, we found that AlignACE detected the annotated motif for only 36 of 65 regulators. We also compared the performance of fREDUCE with those of the other 5 motif finding algorithms used to assemble the benchmark motifs (Figure 2). Even though the benchmark motifs are likely to be biased toward the six programs from which they were originally found, fREDUCE still stood out as having the best individual performance.

Table 1 fREDUCE motif predictions from yeast ChIP-chip
Figure 2

Comparison of fREDUCE to six other algorithms on 65 yeast ChIP-chip benchmarks. AlignACE* indicates results of running AlignACE from scratch, while the performance of other methods were compiled from the Harbison et. al supporting website.

We also examined the performance of fREDUCE on 38 regulators for which Harbison et. al. detected motifs with lower confidence [see Supplementary Tables]. Noting that many of these 38 predicted motifs could contain inaccuracies, fREDUCE matched 7 of these predictions while alignACE matched 3.

Comparision to the original REDUCE and to MatrixREDUCE

To assess the ability of fREDUCE to correctly capture motif degeneracies, we systematically compared the predictions made by fREDUCE to those made by its predecessor REDUCE on the subset of benchmark motifs containing significant degeneracy. Of 15 degenerate benchmark motifs, fREDUCE assigned IUPAC degenerate symbols identically to the benchmark in 11 cases (Figure 3). In the 4 remaining cases (HAP1, MSN2, STB5 and SUM1) fREDUCE made a prediction which is consistent with the benchmark motif while having a different degeneracy (e.g. CGGkGwTA vs. CGGwsTTA for STB5). In all of these cases, fREDUCE assigns the degenerate motif a more significant p-value than the corresponding non-degenerate motif. We note that in some cases motif degeneracies can be detected by the original REDUCE as separate motif predictions. This is especially true for regulators with strong signal (AFT2, CIN5, FHL1, GCN4, SFP1 and YAP7). However, in 5 cases degeneracies successfully predicted by fREDUCE were not detectable at all by REDUCE (CAD1, PHO4, SNT2, TEC1 and YAP1). This is typically characteristic of regulators with weaker signal.

Figure 3

fREDUCE predictions in comparison to non-degenerate predictions made by REDUCE. Benchmark logos and their corresponding motifs are shown for reference. P-values are shown as -log10 values.

We also compared the performance of fREDUCE to MatrixREDUCE, a recently introduced REDUCE-variant that refines motifs elicited by REDUCE into Position Specific Affinity Matrices (PSAM) [24, 25]. MatrixREDUCE matched 43 of the 65 benchmarks as well as 6 of 38 motifs in the lower confidence set [see Additional file 1]. In the high confidence set, six predictions were specific to fREDUCE (HAP4, HSF1, INO4, LEU3, NFG1 and THI2) while two were specific to MatrixREDUCE (MCM1, SIP4). Specific predictions from the lower confidence set included ROX1, SWI5, UME1 for fREDUCE and PUT3, RLM1 for MatrixREDUCE. Overall, fREDUCE has a slightly stronger joint performance with 9 uniquely correct predictions from the two sets versus MatrixREDUCE's 4. In the former cases, MatrixREDUCE did not seem to begin with the correct seed, suggesting that an enumeration strategy is beneficial for some regulators. In the latter cases, fREDUCE does not find the correct motif because the long and fuzzy nature of these motifs makes them too costly for enumeration. We note that some of these differences are dependent on run parameters; with the parameters we have used MatrixREDUCE took an order of magnitude longer to run on average than fREDUCE (data not shown).

Prediction of novel motifs from yeast ChIP-chip

Next we looked to see whether fREDUCE was capable of detecting novel motifs for transcription factors with uncharacterized specificities. Of the remaining transcription factors in the ChIP-chip study with no benchmark logo, we found 24 cases where fREDUCE made nontrivial (not repetitive poly-dA/dT sequences) motif predictions with p-values under 10-3 (Table 2). In all of these cases, there has been little to no experimental information available regarding the specificity, and existing computation methods have yielded little additional insight. Nevertheless, in a few cases we found evidence in the literature which supports the novel motif predictions we have made with fREDUCE. For example, the binding site of ARO80, a regulator of the aromatic amino acid structural genes, has been characterized in two genes as being tandem repeats of the sequences TAACCG and TTGCCG [26]. From the ChIP-chip data, fREDUCE elicited the motif GATAACCG with high significance (p = 10-41) as well as the degenerate motif T(A/G)CCG(A/C) (p = 10-5.6), which is similar to both of the characterized repeat elements and reflects their degeneracies. We also considered the regulator MTH1, which negatively regulates the glucose sensing signal transduction pathway by interacting with the transcriptional repressor Rgt1p [27]. Although it is unknown whether Mth1p has intrinsic DNA sequence specificity, Rgt1p has been shown to have the specificity CGGANNA [28]. fREDUCE found the matching motif GGAGRA (p = 10-3.57), which is compatible with the notion that Mth1p binds to DNA in association with Rgt1p.

Table 2 fREDUCEpredictions for regulators with poorly characterized specificities

Motif Elicitation in Human Hepatocytes

In higher eukaryotes, motifs tend to be more degenerate and dispersed among longer intergenic regions. A common benchmark set used to evaluate the performance of computational algorithms in higher eukaryotes is the liver specific dataset [29]. Krivan et. al compiled a set of experimentally defined regulatory elements upstream of genes that were expressed exclusively in liver or in a small number of tissues including liver. From this set of genes, they found that hepatocyte-specific gene expression is mainly regulated by a small set of transcription factors (TFs), including HNF-1, HNF-3, HNF-4, and C/EBP. HNF-1, HNF-4, and C/EBP are known to be transcriptional activators based on TRANSFAC [30] annotation.

We ran fREDUCE on human adult hepatocyte expression data to capture binding sites of liver-specific transcription factors. fREDUCE captured both the forward and reverse complement of the HNF-4 binding site as well as two key degeneracies in the motif core as published in Krivan et. al. (Figure 4). HNF-4 is known to be linked to gene expression in mature liver [29], which is consistent with the expression data set used in our analysis. In contrast, REDUCE was not able to capture the known binding sites, which is most likely due to the degeneracy involved in the known consensus. These results show the potential of using fREDUCE to identify regulatory elements in higher eukaryotes, including human.

Figure 4

fREDUCE elicitation of the HNF-4 binding site from human hepatocyte expression data.


Despite the availability of powerful techniques such as ChIP-chip, the binding specificities of many transcription factors remain uncharacterized. This can be due to several reasons, including 1) regulators that have few genomic targets 2) regulators which interact weakly or indirectly with their targets and 3) regulators which bind to their maximal set of targets only under very specific environmental cues, which may be hard to find experimentally. fREDUCE offers increased sensitivity in these cases because it 1) uses the entire array data set for correlation and 2) searches all possible degeneracies. While fREDUCE is in some respects similar to motif regressor [14] and matrixREDUCE, a key distinction is that fREDUCE detects degenerate motifs de novo by exhaustive enumeration. In contrast, matrixREDUCE refines degeneracies from non-degenerate seeds and motif regressor selects among candidate matrices using correlation with expression. Thus, fREDUCE may be advantageous when motifs are difficult to detect in a non-degenerate form or are missed in the candidate set.

By comparison to 65 benchmark logos in yeast, we see that fREDUCE is comparable to or greater in detection power versus algorithms like AlignACE for strong motifs that are relatively easy to detect. Even in these cases, fREDUCE outperforms the original REDUCE algorithm by accurately predicting known degeneracies. The most advantageous use of fREDUCE, however, is for the detection of weak motifs which may lie at the border of detection. It is difficult to verify the correctness of many of the motifs elicited in these cases because of their poor characterization. Nevertheless, we have found two cases where fREDUCE was sensitive to subtle signals: ARO80, for which sites are highly degenerate, and MTH1, which may have a weak signal due an indirect interaction with DNA. We have also shown that fREDUCE is capable of capturing the HNF-4 binding site in hepatocytes, demonstrating that this algorithm is generally applicable to the detection of degenerate motifs in mammalian cells.


We have presented the motif prediction algorithm fREDUCE, a refined variation of REDUCE specialized for the detection of degenerate motifs. The two primary strengths of fREDUCE are 1) it maximizes data utilization by fitting all expression data and 2) it searches motif degeneracies in a comprehensive and unbiased way. We have shown that fREDUCE is an improvement upon the existing REDUCE algorithm for degenerate binding profiles and that it can outperform existing motif finding methods on yeast ChIP-chip benchmarks. Furthermore, fREDUCE is able to detect degenerate signals in yeast and human. Thus, fREDUCE should be a valuable computation tool for the detection of subtle motifs.



The pearson correlation between expression values and counts of a possibly degenerate motif D is given by:

P ( D ) = i = 1 G ( E i E ¯ ) ( n i D n D ¯ ) i = 1 G ( E i 2 E ¯ 2 ) i = 1 G ( n i D n i D n ¯ 2 ) MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqWGqbaucqGGOaakcqWGebarcqGGPaqkcqGH9aqpdaWcaaqaamaaqahabaGaeiikaGIaemyrau0aaSbaaSqaaiabdMgaPbqabaGccqGHsisldaqdaaqaaiabdweafbaacqGGPaqkcqGGOaakaSqaaiabdMgaPjabg2da9iabigdaXaqaaiabdEeahbqdcqGHris5aOGaemOBa42aa0baaSqaaiabdMgaPbqaaiabdseaebaakiabgkHiTmaanaaabaGaemOBa42aaWbaaSqabeaacqWGebaraaaaaOGaeiykaKcabaWaaOaaaeaadaaeWbqaaiabcIcaOiabdweafnaaDaaaleaacqWGPbqAaeaacqaIYaGmaaGccqGHsisldaqdaaqaaiabdweafbaadaahaaWcbeqaaiabikdaYaaakiabcMcaPaWcbaGaemyAaKMaeyypa0JaeGymaedabaGaem4raCeaniabggHiLdaaleqaaOGaeyOiGC7aaOaaaeaadaaeWbqaaiabcIcaOiabd6gaUnaaDaaaleaacqWGPbqAaeaacqWGebaraaGccqWGUbGBdaqhaaWcbaGaemyAaKgabaGaemiraqeaaOGaeyOeI0IafmOBa4MbaebadaahaaWcbeqaaiabikdaYaaakiabcMcaPaWcbaGaemyAaKMaeyypa0JaeGymaedabaGaem4raCeaniabggHiLdaaleqaaaaaaaa@6D1F@

Where i is an index over genes, E i is the expression of gene i, n i Dis the number of motif counts matching D in sequence i, n ¯ MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWGUbGBgaqeaaaa@2E29@ is the average of n i Dover all genes and G is the total number of genes. Let g i be the normalized gene expression: g i = E i E ¯ i = 1 G ( E i 2 E ¯ 2 ) MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqWGNbWzdaWgaaWcbaGaemyAaKgabeaakiabg2da9maalaaabaGaemyrau0aaSbaaSqaaiabdMgaPbqabaGccqGHsisldaqdaaqaaiabdweafbaaaeaadaGcaaqaamaaqahabaGaeiikaGIaemyrau0aa0baaSqaaiabdMgaPbqaaiabikdaYaaakiabgkHiTmaanaaabaGaemyraueaaaWcbaGaemyAaKMaeyypa0JaeGymaedabaGaem4raCeaniabggHiLdGcdaahaaWcbeqaaiabikdaYaaakiabcMcaPaWcbeaaaaaaaa@44B1@ , so that i = 1 G g i = 0 MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaadaaeWbqaaiabdEgaNnaaBaaaleaacqWGPbqAaeqaaOGaeyypa0JaeGimaadaleaacqWGPbqAcqGH9aqpcqaIXaqmaeaacqWGhbWra0GaeyyeIuoaaaa@3832@ and i = 1 G g i 2 = 1 MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaadaaeWbqaaiabdEgaNnaaDaaaleaacqWGPbqAaeaacqaIYaGmaaGccqGH9aqpcqaIXaqmaSqaaiabdMgaPjabg2da9iabigdaXaqaaiabdEeahbqdcqGHris5aaaa@3927@ . Then the Pearson coefficient reduces to:

P ( D ) = i = 1 G g i n i D i = 1 G ( n i D n i D n ¯ 2 ) MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqWGqbaucqGGOaakcqWGebarcqGGPaqkcqGH9aqpdaWcaaqaamaaqahabaGaem4zaC2aaSbaaSqaaiabdMgaPbqabaaabaGaemyAaKMaeyypa0JaeGymaedabaGaem4raCeaniabggHiLdGccqWGUbGBdaqhaaWcbaGaemyAaKgabaGaemiraqeaaaGcbaWaaOaaaeaadaaeWbqaaiabcIcaOiabd6gaUnaaDaaaleaacqWGPbqAaeaacqWGebaraaGccqWGUbGBdaqhaaWcbaGaemyAaKgabaGaemiraqeaaOGaeyOeI0IafmOBa4MbaebadaahaaWcbeqaaiabikdaYaaakiabcMcaPaWcbaGaemyAaKMaeyypa0JaeGymaedabaGaem4raCeaniabggHiLdaaleqaaaaaaaa@5357@

Since n i D = S n i S MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqWGUbGBdaqhaaWcbaGaemyAaKgabaGaemiraqeaaOGaeyypa0ZaaabuaeaacqWGUbGBdaqhaaWcbaGaemyAaKgabaGaem4uamfaaaqaaiabdofatbqab0GaeyyeIuoaaaa@391D@ , where the sum is over all non-degenerate nucleotide motifs S that match D, we can pre-compute and store a table of i = 1 G g i n i S MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaadaaeWbqaaiabdEgaNnaaBaaaleaacqWGPbqAaeqaaaqaaiabdMgaPjabg2da9iabigdaXaqaaiabdEeahbqdcqGHris5aOGaemOBa42aa0baaSqaaiabdMgaPbqaaiabdofatbaaaaa@3A4F@ for all S and readily construct the numerator of P(D) for any D. However, the denominator is not linear in n i Dand cannot be expressed as a sum over S. Nevertheless we can compute a pseudo-Pearson coefficient:

P ˜ ( D ) = i = 1 G g i n i D n ˜ 2 G n ¯ 2 MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWGqbaugaacaiabcIcaOiabdseaejabcMcaPiabg2da9maalaaabaWaaabCaeaacqWGNbWzdaWgaaWcbaGaemyAaKgabeaaaeaacqWGPbqAcqGH9aqpcqaIXaqmaeaacqWGhbWra0GaeyyeIuoakiabd6gaUnaaDaaaleaacqWGPbqAaeaacqWGebaraaaakeaadaGcaaqaaiqbd6gaUzaaiaWaaWbaaSqabeaacqaIYaGmaaGccqGHsislcqWGhbWrcuWGUbGBgaqeamaaCaaaleqabaGaeGOmaidaaaqabaaaaaaa@4699@

where n ˜ 2 = S i = 1 G n i S n i S MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWGUbGBgaacamaaCaaaleqabaGaeGOmaidaaOGaeyypa0ZaaabuaeaadaaeWbqaaiabd6gaUnaaDaaaleaacqWGPbqAaeaacqWGtbWuaaGccqWGUbGBdaqhaaWcbaGaemyAaKgabaGaem4uamfaaaqaaiabdMgaPjabg2da9iabigdaXaqaaiabdEeahbqdcqGHris5aaWcbaGaem4uamfabeqdcqGHris5aaaa@4282@ can be constructed as a sum over S.

Since i = 1 G n i D n i D = i = 1 G ( S 1 n i S 1 ) ( S 2 n i S 2 ) = S 1 S 2 i = 1 G n i S 1 n i S 2 n ˜ 2 MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaadaaeWbqaaiabd6gaUnaaDaaaleaacqWGPbqAaeaacqWGebaraaGccqWGUbGBdaqhaaWcbaGaemyAaKgabaGaemiraqeaaOGaeyypa0ZaaabCaeaadaqadaqaamaaqafabaGaemOBa42aa0baaSqaaiabdMgaPbqaaiabdofatnaaBaaameaacqaIXaqmaeqaaaaaaSqaaiabdofatnaaBaaameaacqaIXaqmaeqaaaWcbeqdcqGHris5aaGccaGLOaGaayzkaaWaaeWaaeaadaaeqbqaaiabd6gaUnaaDaaaleaacqWGPbqAaeaacqWGtbWudaWgaaadbaGaeGOmaidabeaaaaaaleaacqWGtbWudaWgaaadbaGaeGOmaidabeaaaSqab0GaeyyeIuoaaOGaayjkaiaawMcaaiabg2da9aWcbaGaemyAaKMaeyypa0JaeGymaedabaGaem4raCeaniabggHiLdGcdaaeqbqaamaaqafabaWaaabCaeaacqWGUbGBdaqhaaWcbaGaemyAaKgabaGaem4uam1aaSbaaWqaaiabigdaXaqabaaaaOGaemOBa42aa0baaSqaaiabdMgaPbqaaiabdofatnaaBaaameaacqaIYaGmaeqaaaaaaSqaaiabdMgaPjabg2da9iabigdaXaqaaiabdEeahbqdcqGHris5aaWcbaGaem4uam1aaSbaaWqaaiabikdaYaqabaaaleqaniabggHiLdaaleaacqWGtbWudaWgaaadbaGaeGymaedabeaaaSqab0GaeyyeIuoakiabgwMiZkqbd6gaUzaaiaWaaWbaaSqabeaacqaIYaGmaaaabaGaemyAaKMaeyypa0JaeGymaedabaGaem4raCeaniabggHiLdaaaa@792C@ , we have | P ( D ) | | P ˜ ( D ) | MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaadaabdaqaaiabdcfaqjabcIcaOiabdseaejabcMcaPaGaay5bSlaawIa7aiabgsMiJoaaemaabaGafmiuaaLbaGaacqGGOaakcqWGebarcqGGPaqkaiaawEa7caGLiWoaaaa@3C8C@ . Hence the magnitude of pseudo-Pearson coefficient is an upper bound for the magnitude of the actual Pearson coefficient, allowing rapid screening of all degenerate motifs. Actual Pearson values can then be computed for a small subset of motifs with pseudo-Pearson values above a given threshold. This scheme is effective except for motifs where n ˜ 2 < G n ¯ 2 MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWGUbGBgaacamaaCaaaleqabaGaeGOmaidaaOGaeyipaWJaem4raCKafmOBa4MbaebadaahaaWcbeqaaiabikdaYaaaaaa@3400@ , in which case the Pearson coefficient must be computed directly. Thus, fREDUCE will give a computational advantage as long as the average motif count n ¯ MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWGUbGBgaqeaaaa@2E29@ is less than one.

Specifically, fREDUCE uses the following procedure:

  1. (1)

    For each oligonucleotide string S of length L that appears in the sequence, we pre-compute the quantities and n 2 ¯ S = i = 1 G n i S n i S MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaadaqdaaqaaiabd6gaUnaaCaaaleqabaGaeGOmaidaaaaakmaaCaaaleqabaGaem4uamfaaOGaeyypa0ZaaabCaeaacqWGUbGBdaqhaaWcbaGaemyAaKgabaGaem4uamfaaOGaemOBa42aa0baaSqaaiabdMgaPbqaaiabdofatbaaaeaacqWGPbqAcqGH9aqpcqaIXaqmaeaacqWGhbWra0GaeyyeIuoaaaa@4098@

  2. (2)

    We generate a list of all possible nucleotides containing up to l degeneracies matching the set of S.

  3. (3)

    We rapidly compute corresponding quantities for all degenerate strings D matching S: , and n ˜ 2 = S i = 1 G n i S n i S = S n 2 ¯ S MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWGUbGBgaacamaaCaaaleqabaGaeGOmaidaaOGaeyypa0ZaaabuaeaadaaeWbqaaiabd6gaUnaaDaaaleaacqWGPbqAaeaacqWGtbWuaaGccqWGUbGBdaqhaaWcbaGaemyAaKgabaGaem4uamfaaaqaaiabdMgaPjabg2da9iabigdaXaqaaiabdEeahbqdcqGHris5aaWcbaGaem4uamfabeqdcqGHris5aOGaeyypa0Zaaabuaeaadaqdaaqaaiabd6gaUnaaCaaaleqabaGaeGOmaidaaaaakmaaCaaaleqabaGaem4uamfaaaqaaiabdofatbqab0GaeyyeIuoaaaa@4AD4@ and use them to construct the pseudo-Pearson coefficient p D / n ˜ 2 G n ¯ 2 MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqWGWbaCdaWgaaWcbaGaemiraqeabeaakiabc+caVmaakaaabaGafmOBa4MbaGaadaahaaWcbeqaaiabikdaYaaakiabgkHiTiabdEeahjqbd6gaUzaaraWaaWbaaSqabeaacqaIYaGmaaaabeaaaaa@378F@ . We save only those motifs whose pseudo-Pearson coefficients exceed a threshold corresponding to the p-value cutoff for its motif class. For the motifs whose pseudo-Pearson coefficients cannot be calculated directly (because n ˜ 2 G n ¯ 2 MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWGUbGBgaacamaaCaaaleqabaGaeGOmaidaaOGaeyizImQaem4raCKafmOBa4MbaebadaahaaWcbeqaaiabikdaYaaaaaa@34B1@ ), we compute the true Pearson.

  4. (4)

    We sort the remaining motifs in decreasing order of the magnitudes of their pseudo-Pearson and compute true Pearson coefficients in this order. We stop computing when the magnitude of the pseudo-Pearson value of the current motif in the list falls below the magnitude of the true Pearson coefficient of the top motif.

  5. (5)

    Finally, we compute the residual gene expression g ˜ i = g i P ( D ) n i D MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacuWGNbWzgaacamaaBaaaleaacqWGPbqAaeqaaOGaeyypa0Jaem4zaC2aaSbaaSqaaiabdMgaPbqabaGccqGHsislcqWGqbaucqGGOaakcqWGebarcqGGPaqkcqWGUbGBdaqhaaWcbaGaemyAaKgabaGaemiraqeaaaaa@3C68@ , that is, the expression data after the effect of motif D has been taken into account. After a renormalization, the residual is used to carry out subsequent rounds of motif finding.

To estimate the statistical significance of motifs, we note that since |P(D)|<<1, its distribution is well approximated by a Normal distribution. We convert P(D) into a z-score:

Z ( D ) = P ( D ) G 2 1 P ( D ) 2 MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqWGAbGwcqGGOaakcqWGebarcqGGPaqkcqGH9aqpcqWGqbaucqGGOaakcqWGebarcqGGPaqkdaGcaaqaamaalaaabaGaem4raCKaeyOeI0IaeGOmaidabaGaeGymaeJaeyOeI0IaemiuaaLaeiikaGIaemiraqKaeiykaKYaaWbaaSqabeaacqaIYaGmaaaaaaqabaaaaa@3F9C@

This z-score is used to derive the p-value [15]:

p v a l u e = 2 2 π Z ( D ) e t 2 2 d t MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqWGWbaCcqWG2bGDcqWGHbqycqWGSbaBcqWG1bqDcqWGLbqzcqGH9aqpdaWcaaqaaiabikdaYaqaamaakaaabaGaeGOmaidcciGae8hWdahaleqaaaaakmaapehabaGaemyzau2aaWbaaSqabeaadaWcaaqaaiabgkHiTiabdsha0naaCaaameqabaGaeGOmaidaaaWcbaGaeGOmaidaaaaakiabdsgaKjabdsha0bWcbaGaemOwaOLaeiikaGIaemiraqKaeiykaKcabaGaeyOhIukaniabgUIiYdaaaa@4A90@

To correct for multiple testing, we first apply a Bonferroni correction factor of ( L m ) D m 4 L m MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaadaqadaqaauaabeqaceaaaeaacqWGmbataeaacqWGTbqBaaaacaGLOaGaayzkaaGaemiraq0aaWbaaSqabeaacqWGTbqBaaGccqaI0aandaahaaWcbeqaaiabdYeamjabgkHiTiabd2gaTbaaaaa@3805@ to each motif of length L containing m IUPAC symbols. This factor corresponds to the total number of motifs in the class of L and m, where D = 11 or 15 depending on whether 3-fold IUPAC symbols are included. We then apply a second correction factor for the total number of motif classes examined for a particular run. For example, with the settings (L = 7 and m = 1) we would examine all motifs in the classes (6,0), (6,1), (7,0) and (7,1) giving a second correction factor of 4 for each motif (we require a minimum motif length of 6). This weighted method of correction has the advantage of accounting for the fact that motif classes with larger values of L and m tend to give higher numbers of false positives.

fREDUCE performance testing

We ran fREDUCE on the REB1_YPD ChIP-chip data from Harbison et. al. for varying L and m on an 2.40 GHz Intel Xeon processor [see Additional file 2]. In all runs, the known Reb1p binding site CGGGTAA or close variants appeared as the top motif (data not shown).

Motif Detection from Yeast ChIP-chip

We applied fREDUCE to 354 yeast ChIP-chip experiments involving 203 known and putative transcription factors [1]. Each experiment was analyzed with fREDUCE using the corresponding set of yeast intergenic sequences, searching all motifs up to length 8 containing up to 2 two-fold IUPAC degenerate symbols. We filtered the set of motifs found for each fREDUCE run by three criteria. First, since yeast intergenic sequences have relatively low G/C content, we eliminated motifs which only contained the letters A/T/W as such motifs tend to have inflated correlation coefficients. From the remaining list of motifs, we chose the top three most significant motifs for further comparison. Accounting for the fact that we are eliciting motifs from several hundred experiments, we also discarded motifs with corrected p-values less significant than 10-2. If the given transcription factor was associated with ChIP-chip data under multiple environmental conditions, then filtered motifs from all conditions were combined and the top three chosen. The final motifs for each transcription factor were compared to reference motifs predicted by Harbinson et. al. based on a composite of several motif finding algorithms [1]. There were a total of 102 reference motifs from the authors' website [31], 65 of which were considered high confidence. Each reference motif was compared to their corresponding fREDUCE predictions using a sliding window string comparison. Predicted motifs are considered a match if there is at least one window where all IUPAC characters are consistent between both strings. Motif predictions made for transcription factors with no reference motifs were compared to literature.

Comparison to non-degenerate REDUCE

From the 65 high confidence benchmarks, we selected cases where the annotated motif had at least one IUPAC character. In 15 of these cases, both fREDUCE and REDUCE made correct, if not correctly degenerate predictions. In 11 of these 15 cases fREDUCE made the correct IUPAC assignments. For each of these 11 cases, we considered whether the degeneracy can be assembled from non-degenerate motifs with p < 0.01 predicted by REDUCE.

Comparison to other motif-finding algorithms

We obtained the alignACE package and ran all ChIP-chip data with the default parameters using probes with p-values below 0.001. The output alignment was converted into an IUPAC string using the method described by Cavener et. al. [32] and the resulting motifs were compared to reference motifs in the same way as the fREDUCE motif predictions. Details of alignACE motifs found and comparisons to alignACE motifs from Harbison et. al. are available in Supp. Table 1. We also obtained MatrixREDUCE [33] and ran all ChIP-chip data against the provided yeast sequence file Y5_600_Bst.fa. Default parameters were used except that we set max_motif = 10 for consistency with our fREDUCE runs. For the other five algorithms, we tallied the total number of references to each algorithm from the list of matrices on Harbison et al. supporting website [34].

Motif Detection from Human Liver Tissue

  1. 158

    custom made Affymetrix gene expression arrays for 79 different human tissues (2 replicates each) were obtained from Novartis in a publicly available database [35, 36]. The arrays were normalized using gcrma [37, 38] and the probes were annotated using Ensembl gene annotation [39] for human build 35. To study adult liver specific gene expression, we first normalized expression values for each liver tissue replicate against the average expression of all other tissues (excluding the 2 liver tissue experiments) The expression value of each gene in liver tissue experiments is represented as the following z-score:

Where n is the liver tissue experiment replicate number, g is the index over genes, Engliver is the expression value of gene g in replicate n, μother is the mean expression value of gene g in non-liver tissue experiments, and σother is the standard deviation of gene g in non-liver tissue experiments.

Human genomic sequences (build 35) were extracted 1000 bp upstream from the transcriptional start site (TSS) if known, or from the initiation codon, based on Ensembl v35 [40]. The repeat masked promoter sequences were mapped to corresponding z-scores, which represent gene expression. This resulted in a final set of 11,710 paired z-scores and promoter sequences for input into fREDUCE. We then ran fREDUCE on the z-scores for each replicate of the liver tissue on the basis that a higher z-score translates to higher expression in liver tissues compared to the other tissues. Two different sets of parameters were run on each replicate as follows: length 8 with 0 IUPAC symbols and length 8 with 2 IUPAC symbols.

Availability and Requirements

Source code and example usage are included in the release file fREDUCE-1.1.tar.gz [see Additional file 3].



chromatin immunoprecipitation on microarray


regulatory element detection using correlation with expression


fast regulatory element detection using correlation with expression.


  1. 1.

    Harbison CT, Gordon DB, Lee TI, Rinaldi NJ, Macisaac KD, Danford TW, Hannett NM, Tagne JB, Reynolds DB, Yoo J, et al.: Transcriptional regulatory code of a eukaryotic genome. Nature 2004, 431: 99–104. 10.1038/nature02800

    PubMed Central  CAS  Article  PubMed  Google Scholar 

  2. 2.

    Lee TI, Rinaldi NJ, Robert F, Odom DT, Bar-Joseph Z, Gerber GK, Hannett NM, Harbison CT, Thompson CM, Simon I, et al.: Transcriptional regulatory networks in Saccharomyces cerevisiae. Science 2002, 298: 799–804. 10.1126/science.1075090

    CAS  Article  PubMed  Google Scholar 

  3. 3.

    Ren B, Robert F, Wyrick JJ, Aparicio O, Jennings EG, Simon I, Zeitlinger J, Schreiber J, Hannett N, Kanin E, et al.: Genome-wide location and function of DNA binding proteins. Science 2000, 290: 2306–2309. 10.1126/science.290.5500.2306

    CAS  Article  PubMed  Google Scholar 

  4. 4.

    Hughes TR, Marton MJ, Jones AR, Roberts CJ, Stoughton R, Armour CD, Bennett HA, Coffey E, Dai H, He YD, et al.: Functional discovery via a compendium of expression profiles. Cell 2000, 102: 109–126. 10.1016/S0092-8674(00)00015-5

    CAS  Article  PubMed  Google Scholar 

  5. 5.

    Wang W, Cherry JM, Botstein D, Li H: A systematic approach to reconstructing transcription networks in Saccharomycescerevisiae. Proc Natl Acad Sci USA 2002, 99: 16893–16898. 10.1073/pnas.252638199

    PubMed Central  CAS  Article  PubMed  Google Scholar 

  6. 6.

    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.

    CAS  PubMed  Google Scholar 

  7. 7.

    Lawrence CE, Altschul SF, Boguski MS, Liu JS, Neuwald AF, Wootton JC: Detecting subtle sequence signals: a Gibbs sampling strategy for multiple alignment. Science 1993, 262: 208–214. 10.1126/science.8211139

    CAS  Article  PubMed  Google Scholar 

  8. 8.

    Liu X, Brutlag DL, Liu JS: BioProspector: discovering conserved DNA motifs in upstream regulatory regions of co-expressed genes. Pac Symp Biocomput 2001, 127–138.

    Google Scholar 

  9. 9.

    van Helden J, Andre B, Collado-Vides J: Extracting regulatory sites from the upstream region of yeast genes by computational analysis of oligonucleotide frequencies. J Mol Biol 1998, 281: 827–842. 10.1006/jmbi.1998.1947

    CAS  Article  PubMed  Google Scholar 

  10. 10.

    Wang T, Stormo GD: Combining phylogenetic data with co-regulated genes to identify regulatory motifs. Bioinformatics 2003, 19: 2369–2380. 10.1093/bioinformatics/btg329

    CAS  Article  PubMed  Google Scholar 

  11. 11.

    Bussemaker HJ, Li H, Siggia ED: Building a dictionary for genomes: identification of presumptive regulatory sites by statistical analysis. Proc Natl Acad Sci USA 2000, 97: 10096–10100. 10.1073/pnas.180265397

    PubMed Central  CAS  Article  PubMed  Google Scholar 

  12. 12.

    Wang G, Zhang W: A steganalysis-based approach to comprehensive identification and characterization of functional regulatory elements. Genome Biol 2006, 7: R49. 10.1186/gb-2006-7-6-r49

    PubMed Central  Article  PubMed  Google Scholar 

  13. 13.

    Beer MA, Tavazoie S: Predicting gene expression from sequence. Cell 2004, 117: 185–198. 10.1016/S0092-8674(04)00304-6

    CAS  Article  PubMed  Google Scholar 

  14. 14.

    Conlon EM, Liu XS, Lieb JD, Liu JS: Integrating regulatory motif discovery and genome-wide expression analysis. Proc Natl Acad Sci USA 2003, 100: 3339–3344. 10.1073/pnas.0630591100

    PubMed Central  CAS  Article  PubMed  Google Scholar 

  15. 15.

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

    CAS  Article  PubMed  Google Scholar 

  16. 16.

    Kim Guisbert K, Duncan K, Li H, Guthrie C: Functional specificity of shuttling hnRNPs revealed by genome-wide analysis of their RNA binding profiles. RNA 2005, 11: 383–393. 10.1261/rna.7234205

    PubMed Central  Article  PubMed  Google Scholar 

  17. 17.

    Klebes A, Sustar A, Kechris K, Li H, Schubiger G, Kornberg TB: Regulation of cellular plasticity in Drosophila imaginal disc cells by the Polycomb group, trithorax group and lama genes. Development 2005, 132: 3753–3765. 10.1242/dev.01927

    CAS  Article  PubMed  Google Scholar 

  18. 18.

    Koerkamp MG, Rep M, Bussemaker HJ, Hardy GP, Mul A, Piekarska K, Szigyarto CA, De Mattos JM, Tabak HF: Dissection of transient oxidative stress response in Saccharomyces cerevisiae by using DNA microarrays. Mol Biol Cell 2002, 13: 2783–2794. 10.1091/mbc.E02-02-0075

    PubMed Central  CAS  Article  PubMed  Google Scholar 

  19. 19.

    Orian A, van Steensel B, Delrow J, Bussemaker HJ, Li L, Sawado T, Williams E, Loo LW, Cowley SM, Yost C, et al.: Genomic binding by the Drosophila Myc, Max, Mad/Mnt transcription factor network. Genes Dev 2003, 17: 1101–1114. 10.1101/gad.1066903

    PubMed Central  CAS  Article  PubMed  Google Scholar 

  20. 20.

    van Steensel B, Delrow J, Bussemaker HJ: Genomewide analysis of Drosophila GAGA factor target genes reveals context-dependent DNA binding. Proc Natl Acad Sci USA 2003, 100: 2580–2585. 10.1073/pnas.0438000100

    PubMed Central  CAS  Article  PubMed  Google Scholar 

  21. 21.

    Wang W, Cherry JM, Nochomovitz Y, Jolly E, Botstein D, Li H: Inference of combinatorial regulation in yeast transcriptional networks: a case study of sporulation. Proc Natl Acad Sci USA 2005, 102: 1998–2003. 10.1073/pnas.0405537102

    PubMed Central  CAS  Article  PubMed  Google Scholar 

  22. 22.

    AlignACE Homepage[]

  23. 23.

    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: 939–945. 10.1038/nbt1098-939

    CAS  Article  PubMed  Google Scholar 

  24. 24.

    Foat BC, Houshmandi SS, Olivas WM, Bussemaker HJ: Profiling condition-specific, genome-wide regulation of mRNA stability in yeast. Proc Natl Acad Sci USA 2005, 102: 17675–17680. 10.1073/pnas.0503803102

    PubMed Central  CAS  Article  PubMed  Google Scholar 

  25. 25.

    Foat BC, Morozov AV, Bussemaker HJ: Statistical mechanical modeling of genome-wide transcription factor occupancy data by MatrixREDUCE. Bioinformatics 2006, 22: e141–149. 10.1093/bioinformatics/btl223

    CAS  Article  PubMed  Google Scholar 

  26. 26.

    De Rijcke M, Seneca S, Punyammalee B, Glansdorff N, Crabeel M: Characterization of the DNA target site for the yeast ARGR regulatory complex, a sequence able to mediate repression or induction by arginine. Mol Cell Biol 1992, 12: 68–81.

    PubMed Central  CAS  Article  PubMed  Google Scholar 

  27. 27.

    Lakshmanan J, Mosley AL, Ozcan S: Repression of transcription by Rgt1 in the absence of glucose requires Std1 and Mth1. Curr Genet 2003, 44: 19–25. 10.1007/s00294-003-0423-2

    CAS  Article  PubMed  Google Scholar 

  28. 28.

    Kim JH, Polish J, Johnston M: Specificity and regulation of DNA binding by the yeast glucose transporter gene repressor Rgt1. Mol Cell Biol 2003, 23: 5208–5216. 10.1128/MCB.23.15.5208-5216.2003

    PubMed Central  CAS  Article  PubMed  Google Scholar 

  29. 29.

    Krivan W, Wasserman WW: A predictive model for regulatory sequences directing liver-specific transcription. Genome Res 2001, 11: 1559–1566. 10.1101/gr.180601

    PubMed Central  CAS  Article  PubMed  Google Scholar 

  30. 30.

    Matys V, Fricke E, Geffers R, Gossling E, Haubrock M, Hehl R, Hornischer K, Karas D, Kel AE, Kel-Margoulis OV, et al.: TRANSFAC: transcriptional regulation, from patterns to profiles. Nucleic Acids Res 2003, 31: 374–378. 10.1093/nar/gkg108

    PubMed Central  CAS  Article  PubMed  Google Scholar 

  31. 31.

    Final Motifs[]

  32. 32.

    Cavener DR: Comparison of the consensus sequence flanking translational start sites in Drosophila and vertebrates. Nucleic Acids Res 1987, 15: 1353–1361. 10.1093/nar/15.4.1353

    PubMed Central  CAS  Article  PubMed  Google Scholar 

  33. 33.

    MatrixREDUCE Homepage[]

  34. 34.

    The Fraenkel Lab – Harbison et al. Final Motif Logos[]

  35. 35.

    Su AI, Wiltshire T, Batalov S, Lapp H, Ching KA, Block D, Zhang J, Soden R, Hayakawa M, Kreiman G, et al.: A gene atlas of the mouse and human protein-encoding transcriptomes. Proc Natl Acad Sci USA 2004, 101: 6062–6067. 10.1073/pnas.0400782101

    PubMed Central  CAS  Article  PubMed  Google Scholar 

  36. 36.

    GNF SymAtlas[]

  37. 37.

    Wu Z, Irizarry RA: Preprocessing of oligonucleotide array data. Nat Biotechnol 2004, 22: 656–658. author reply 658 author reply 658 10.1038/nbt0604-656b

    CAS  Article  PubMed  Google Scholar 

  38. 38.

    A Model Based Background Adjustment for Oligonucleotide Expression Arrays[]

  39. 39.

    Hubbard T, Andrews D, Caccamo M, Cameron G, Chen Y, Clamp M, Clarke L, Coates G, Cox T, Cunningham F, et al.: Ensembl 2005. Nucleic Acids Res 2005, 33: D447–453. 10.1093/nar/gki138

    PubMed Central  CAS  Article  PubMed  Google Scholar 

  40. 40.

    Curwen V, Eyras E, Andrews TD, Clarke L, Mongin E, Searle SM, Clamp M: The Ensembl automatic gene annotation system. Genome Res 2004, 14: 942–950. 10.1101/gr.1858004

    PubMed Central  CAS  Article  PubMed  Google Scholar 

Download references


We would like to thank Jim Shima from the Conklin lab for providing the normalized and annotated Novartis human tissue dataset. This work is funded by predoctoral fellowships from the California Institute of Quantitative Biology (RW) and the National Science Foundation (CC). Funding for HL is provided by NIH (GM70808) and the David and Lucille Packard Fellowship.

Author information



Corresponding authors

Correspondence to Hao Li or Shoudan Liang.

Additional information

Competing interests

The author(s) declares that there are no competing interests.

Authors' contributions

RW carried out the ChIP-chip calculations and drafted the manuscript. CC carried out the hepatocyte calculations and helped with the manuscript. JZ implemented the web interface. SL & HL conceived of the algorithm. SL implemented the algorithm. HL supervised algorithm development and data analysis. All authors read and approved the final manuscript.

Electronic supplementary material


Additional file 1: Supplementary Tables. Tables showing the details of motif comparisons of fREDUCE against AlighACE and MatrixREDUCE are included here. (DOC 344 KB)


Additional file 2: Supplementary Figure 1. fREDUCE performance scaling as the motif length and number of degeneracies allowed is varied. (PPT 36 KB)

Additional file 3: fREDUCE-1.1.tar.gz. fREDUCE source (GZ 785 KB)

Authors’ original submitted files for images

Rights and permissions

Open Access This article is published under license to BioMed Central Ltd. This is an Open Access article is distributed under the terms of the Creative Commons Attribution License ( ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and Permissions

About this article

Cite this article

Wu, R.Z., Chaivorapol, C., Zheng, J. et al. fREDUCE: Detection of degenerate regulatory elements using correlation with expression. BMC Bioinformatics 8, 399 (2007).

Download citation


  • Transcription Factor Binding Site
  • Motif Detection
  • Motif Prediction
  • Motif Finding Algorithm
  • Reference Motif