 Research article
 Open access
 Published:
Genome wide identification of regulatory motifs in Bacillus subtilis
BMC Bioinformatics volumeÂ 4, ArticleÂ number:Â 18 (2003)
Abstract
Background
To explain the vastly different phenotypes exhibited by the same organism under different conditions, it is essential that we understand how the organism's genes are coordinately regulated. While there are many excellent tools for predicting sequences encoding proteins or RNA genes, few algorithms exist to predict regulatory sequences on a genome wide scale with no prior information.
Results
To identify motifs involved in the control of transcription, an algorithm was developed that searches upstream of operons for improbably frequent dimers. The algorithm was applied to the B. subtilis genome, which is predicted to encode for approximately 200 DNA binding proteins. The dimers found to be overrepresented could be clustered into 317 distinct groups, each thought to represent a class of motifs uniquely recognized by some transcription factor. For each cluster of dimers, a representative weight matrix was derived and scored over the regions upstream of the operons to predict the sites recognized by the cluster's factor, and a putative regulon of the operons immediately downstream of the sites was inferred. The distribution in number of operons per predicted regulon is comparable to that for well characterized transcription factors. The most highly overrepresented dimers matched Ïƒ^{A}, the Tbox, and Ïƒ^{W}sites. We have evidence to suggest that at least 52 of our clusters of dimers represent actual regulatory motifs, based on the groups' weight matrix matches to experimentally characterized sites, the functional similarity of the component operons of the groups' regulons, and the positional biases of the weight matrix matches. All predictions are assigned a significance value, and thresholds are set to avoid false positives. Where possible, we examine our false negatives, drawing examples from known regulatory motifs and regulons inferred from RNA expression data.
Conclusions
We have demonstrated that in the case of B. subtilis our algorithm allows for the genome wide identification of regulatory sites. As well as recovering known sites, we predict new sites of yet uncharacterized factors. Results can be viewed at http://www.physics.rockefeller.edu/~mwangi/.
Background
Bacterial genome annotation has generally been confined to the prediction of sequences encoding proteins and prominent families of RNA genes. The predicted ORF's are grouped into categories by comparing them (e.g. using BLAST) to hand curated proteins or motifs with already characterized functions. Information about protein interactions can be extracted by finding how genes group into operons [1] and searching for homologs to protein domains that reside on distinct proteins in one species and are joined into a single protein in another [2, 3].
The comparison between the genomes of the model metazoans (fly, worm, and plant) with the human genome has confirmed the widely held belief of evolutionary and developmental biologists that much of the diversity of life stems from changes in regulation and not the creation of novel proteins. For bacteria, there is much more horizontal gene transfer, and it is an unresolved question of how regulation of these genes is coordinated with the host. When it is realized that even for E. coli less than 20% of the operons have been thoroughly examined upstream for regulatory motifs and less than 1/4 of the 300 or more putative DNA binding proteins have known sites, it is apparent that the automatic methods for inferring regulatory motifs must approach those used for inferring protein coding sequences and function if the full potential of the 'genomic revolution' is to be realized.
The inference of improbably frequent motifs from a collection of sequences is a recognized branch of bioinformatics. Algorithms can be categorized by the search strategy used to find a motif and the model used to assess the probability of the frequency of the motif's occurrence. Most algorithms operate on the regulatory sequenes of clusters of genes with related function and return one or a few motifs [4â€“10]. The probability of the frequency of occurrence of a given motif in the set of regulatory sequences is usually assessed based on the contrast between the set of sequences and the rest of the genome. When the genomes of other related species are available, motif predictions can by interspecies comparisons sometimes be made on a gene by gene basis [11â€“14]. Computational methods, though imperfect, are an essential step in interpreting genome wide experiments and doing a preliminary screen for targets that merit further laboratory investigation.
In this article, we extend a strategy originally applied to E. coli [15] that considers the entire genome at once and finds all improbably frequent motifs in parallel. It uses an exhaustive search, so it misses nothing within the category of motifs it searches for. Probability is assessed internally since there is no plausible set of sequences to compare against. This approach has the obvious merits of presuming nothing about regulons, being quick to implement, and using all the available sequences that may share regulatory motifs. It has the obvious demerits of not using the protein annotations or information about coexpression such as available from microarray experiments. Instead, these resources are used to check the validity of the putative regulons predicted from the sequence alone.
In bacteria, a regulatory protein often recognizes and binds to a class of similar dimers, where a dimer W_{1}N_{ x }W_{2} consists of two specific words W_{1,2} separated by x nonspecific bases. If a dimer is observed to occur n times in a set of sequences, a pscore can be assigned to the frequency n by computing the probability of observing n or more instances of the dimer under a null model that assumes the instances of the words W_{1,2} are distributed in the sequences at random. For the pscore to be considered significant, it must fall below an appropriately chosen threshold. Since many regulatory proteins bind to dimers with identical or reverse complementary words W_{1,2}, these classes of dimers are given special consideration, and a different threshold is used than in the general case. Because secondary structure motifs also have dimer form, dimers with significant pscores do not always represent protein binding sites, e.g. the Tbox.
Essential to the success of our strategy is the way in which we cluster overrepresented dimers, derive weight matrices, and infer regulons. Dimers are clustered into distinct groups based on sequence similarity. Weight matrices for the clusters are derived from the actual sequences matched by the dimers and scored over the regions upstream of the operons to predict sites. The set of operons immediately downstream of the matches to a particular weight matrix are inferred to be a regulon. We find in Results that the number of predicted regulons as well as the number of operons per predicted regulon is in line with expectations. For only a sixth of our clusters of dimers could evidence for function be deduced from the available information for B. subtilis. We validated these clusters by comparing their weight matrix matches with known regulatory sites, examining the operons composing their regulons for common function (either manually using the detailed gene annotations or automatically using the COG categories), and inspecting their weight matrix matches for positional biases (with respect to translation start or predicted Ïƒ^{A}sites).
Algorithm
Our algorithm for identifying regulatory elements in prokaryote genomes is an extension of [15] and consists of the following steps.

1.
Identify operons and extract upstream sequences.

2.
Enumerate statistically overrepresented dimers of the form W_{1}N_{ x }W_{2} in upstream sequences.

3.
Cluster the dimers into similar groups.

4.
Construct for each cluster a weight matrix, derived from the matches in the upstream regions to the cluster's dimers.

5.
Predict regulatory elements by using standard information theory to score the upstream sequences against the weight matrices.
For B. subtilis, the rate limiting steps 2 and 3 take ~1/2 and ~3 hr respectively to execute on a 500 MHz Pentium II workstation. Our predicted regulatory sites can be viewed at the URL http://www.physics.rockefeller.edu/~mwangi/.
Putative operons and upstream sequences
We group adjacent ORF's on the same strand into putative operons if (a) the two ORF's are separated by no more than m bases or (b) the two ORF's are both not hypothetical, are separated by no more than n bases, and have names differing only in their last letters, which would suggest that the ORF's protein products have related functions. Tests involving E. coli K12 suggest that the optimal values of m and n are m = 32 and n = 130. At these values, we correctly predict ~70% of the ~400 operons in E. coli K12 listed in RegulonDB [16] as having some supporting experimental evidence. To construct the set of upstream sequences most likely to contain regulatory elements, we extract from immediately upstream of the translation start sites of our predicted operons a maximum of 300 bases, limited so as not to include any coding sequence (ORF) on either strand. The upper limit of 300 is chosen because it includes almost all the known regulatory sites in E. coli K12 [17]. Using the REPuter program [18], we discard all exact repeats of length 16 or more bases from the upstream contiguous sequences to eliminate potential insertion sequences and transposons. From the set of fragments generated by the removal of the repeats, we discard any fragment with less than 50 bases to obtain our final set of upstream sequences. Of the 471289 bases of upstream sequence in B. subtilis, 98.3% remained after the removal of the repeats, and 95.9% remained after imposing the minimum fragment length of 50.
Enumeration of dimers
We search in the upstream sequences for statistically overrepresented dimers of the form W_{1}N_{ x }W_{2} with word strings W_{1} and W_{2} of a, c, g, and t of lengths 4â€“5 and a spacing x in the range 3â€“30. When we include words with length 3 or less, we find it virtually impossible to cluster the overrepresented dimers, probably because dimers with short word lengths occur frequently in the whole genome and can be part of regulatory elements recognized by different transcription factors. When we use words with length 6 or greater, the large sample space of dimers searched for necessitates that we be exceedingly stringent with our thresholds for significance, so only the most improbably infrequent motifs are detected. Since the conserved portions of the consensus sequences of known regulatory elements are rarely observed to be separated by more than ~20 bases [19], it is natural to constrain x to the interval 3â€“30. To enumerate the dimers, we tabulate the positions of all words W in our set U of upstream sequences in a three dimensional table, the entries of which are indexed by the string W and the sequence S in U that contains the occurrence of W. We then use the table to count the number of occurrences n(D) of the dimer D = W_{1}N_{ x }W_{2} in U. Denoting the length of a word or dimer M as L(M), the expected number of occurrences of D under the null hypothesis that the occurrences of W_{1} and W_{2} are uncorrelated is
where n(W) is the total number of occurrences of a word W in U and L_{ eff }(M) = Î£_{SâˆˆU}[L(S)  L(M) + 1] is the number of independent positions in U that a motif M can be placed. The probability P of observing n(D) or more occurrences of D under our null hypothesis is then given by the Poisson distribution:
A dimer is considered overrepresented if
P < 1/N_{ D } (3)
where N_{ D }is the number of dimers considered, that is (4^{4} + 4^{5})^{2}Â·31 ~ 50,000,000. Because the binding sites of transcription factors are frequently symmetric (e.g. acctN_{5}acct) or reverse complement symmetric (e.g. ccctN_{5}aggg) [19], we score these separately using N_{ D }= (4^{4} + 4^{5})Â·31 ~ 40,000. Under our null model, no dimer would satisfy Eq. 3 by chance. However, our null model is inaccurate for sequences consisting of long stretches of the same nucleotide (A or T being the most common cases in practice) since a sequence like AAAAAAN_{ x }TTTTTT can for x <y contain multiple instances of the dimer AAAAN_{ y }TTTT displaced relative to each other by one base. In contradiction to our null model, the occurrences of the words AAAA and TTTT are manifestly correlated, leading to extra instances of the dimer AAAAN_{ y }TTTT and an overestimation of the significance of the frequency of the dimer's occurrence. To circumvent the problem, we ignore all words that consist of only the same nucleotide and so miss motifs like AAAAN_{5}TTTT recognized by ComK. It is however important to note that the frequency of occurrence of a dimer like TAAAAN_{5}TTTTA is properly assessed since the problem is not the abundance of any particular nucleotide in a dimer but the translational symmetry that results when each word is a continuous uninterrupted string of the same nucleotide. We therefore believe that our statistical model is misrepresenting a negligible number of motifs even in the poly A/T rich genome of B. subtilis.
Clustering of dimers
Since many of our overrepresented dimers represent different but overlapping versions of the conserved cores of the binding sites of the same factor, it is necessary for us to cluster our overrepresented dimers into distinct groups. For example, the following two dimers
ttgaNNNNNNNNNNNNNNNNNNNNataat
tgccNNNNNNNNNNNNNNNNNNtata
in B. subtilis should belong to the same group since they are both related to the consensus sequence TTGACAN_{17}TATAAT recognized by the sigma factor Ïƒ^{A}[20].
To cluster our dimers, we first compute for each pair of dimers D_{1} and D_{2} a pairwise similarity score S(D_{1}, D_{2}). We define the score of an alignment of D_{1} and D_{2} to be a sum over the pairs of overlapping bases: matches are scored as +1, mismatches as 1, and N paired with anything scores as 0. We define S(D_{1}, D_{2}) to be the maximum score produced by all possible alignments between D_{1} and D_{2} subject to the constraint that the left (and similarly right) words in the two dimers must partially overlap by at least 2 bases. When the aforementioned constraint cannot be satisfied, we define S(D_{1}, D_{2}) = 0. Hence, for the above two dimers, S(D_{1}, D_{2}) = 5  1.
Define a pairwise dissimilarity score between D_{1} and D_{2} as D(D_{1}, D_{2}) = max_{D1},D_{2}S(D_{1}, D_{2})  S(D_{1}, D_{2}). Now, define a graph G_{0} = (V, E_{0}) with vertices V representing our dimers and edges E_{0} having lengths D(D_{1}, D_{2}). In such a graph, highly similar dimers would tend to form spatially compact clusters. In practice, these compact clusters tend to be connected by long chains of edges since through a series of substitutions, insertions, and deletions a dimer D can be transformed into a highly dissimilar dimer D'. Because of these long chains of edges, many clustering algorithms have difficulty properly delineating the compact clusters. For example, as the agglomerative algorithm CAST [21] constructs clusters starting with our individual dimers, it fails to merge many highly similar groups together, probably because the algorithm has a difficult time deciding which groups the dimers on the long chains of edges belong to. In the divisive SPC algorithm [22], our dimers are represented as spins in a Pott's model, and clusters are mapped out using a spinspin correlation function. As the temperature is raised, the increase in thermal energy disrupts the correlation between many of the dimers in the compact clusters before it disrupts the correlations over the long chains of edges between the clusters, leading to many highly similar groups often each consisting of one dimer. We devised an algorithm, the weakestlinkclustering (WLC) algorithm, to specifically seek out and severe the long chains of edges to generate compact clusters.
Starting with G_{0} = (V, E_{0}), our WLC algorithm in each iteration generates from a graph G_{i1}= (V, E_{i1}) a new graph G_{ i }= (V, E_{ i }). Our clusters of dimers are defined as the connected components of the current graph G_{ i }. To generate G_{ i }, we compute all the shortest finite paths in G_{i1}between all pairs of dimers (D_{1}, D_{2}) âˆˆ V. Multiple paths may run across a given edge (D_{1}, D_{2}) âˆˆ E_{i1}. Let P(D_{1}, D_{2}) be the mean length of these paths. The weakest link in G_{i1}is defined as the edge (D_{1}, D_{2}) âˆˆ E_{i1}, D_{1} â‰ D_{2}, at which P(D_{1}, D_{2}) is a maximum. When P(D_{1}, D_{2}) is a maximum at multiple edges, then the edge to be designated the weakest link is chosen at random. Irrespective of the exact edge chosen to be the weakest link, the edge will undoubtedly be part of one of the aforementioned long chains of edges in G_{0}. To generate compact clusters of dimers, our algorithm severs the weakest link in G_{i1}to produce G_{ i }.
Define the intracluster affinity A(C) of a connected component C = (V_{ c }, E_{ c }) as
Note that the sum of similarity scores S(D_{1}, D_{2}) in the numerator is performed over all pairs of dimers in C (or equivalently edges in E_{0}) regardless of whether or not the dimers are currently connected by an edge in C. A(C) is therefore the average pairwise similarity score of dimers in C. Every time two new connected components C_{1} and C_{2} are formed by severing a weakest link in a connected component P, our algorithm computes the ratio
of the mean of the infracluster affinities of the child clusters C_{1} and C_{2} to the intracluster affinity of the parent cluster P. Hence, our algorithm produces a series of R values until the trivial state of every dimer being in its own cluster is reached.
The optimal number of clusters can be inferred from a plot of R versus the number of clusters, e.g. Figure 1. R declines rapidly as the highly noncompact clusters are severed and plateaus when a succession of clusters are encountered that exhibit the same degree of compactness from parent to children. R can then increase, e.g. around 370 clusters in Figure 1, when formerly compact clusters are fragmented into yet better children. To make our clusters as generic as possible, we choose the cluster number to be the in the first plateau in R.
Weight matrices
For each cluster of dimers generated by our WLC algorithm, we extract from our upstream sequences all unique segments that match any dimer. Using a multiple alignment of the dimers in the cluster, we align the segments and pad each to the left and right with up to ~5 bases from the genome to create a column of equal length segments. We compute a matrix n_{i,Î±}that gives the number of occurrences of the base Î± in the i^{th}column of the alignment. We prune the matrix n_{i,Î±}by performing a chisquared test over a window of length l_{ c }= 3 columns running over the length of the matrix. For a given position of the window, we compute the probability [23] that the observed matrix entries were obtained by sampling the background distribution of frequencies , and of the bases a, c, g, and t respectively in our upstream sequences. When the probability exceeds 1%, we block out the middle column in the window and do not use it to score sequences against the matrix. Although the outer low significance columns are eliminated from the matrix, the inner blocked out columns are retained to preserve the spacing. The final matrix typically has a dimeric pattern, but monomeric, trimeric, and even more complex patterns are occasionally observed.
To predict regulatory sites, we in accordance with a scoring scheme by Berg and von Hippel [24] first convert the pruned matrix n_{i,Î±}to a weight or surrogate binding energy matrix w_{i,Î±}. For an unblocked column i, w_{i,Î±}= log_{10} (f_{i,Î±}/) where f_{i,Î±}= (n_{i,Î±}+ 1) /Î£_{Î±} (n_{i,Î±}+ 1) is the relative frequency of the base alpha in the i^{th}column with a pseudo count of 1 added due to the Bayesian estimate. For a blocked column i, w_{i,Î±}= 0.
The consensus sequence for a weight matrix is computed according to the prescription outlined in [25]. Denote the total number of counts Î£_{Î±} n_{i,Î±}recorded in the i^{th}column of the matrix n_{i,Î±}by N. If n_{i,Î±}/N > 0.5 for some base Î± and n_{i,Î±}> 2Â·n_{i,Î²}for all bases Î² â‰ Î±, then the i^{th}site in the sequence is assigned the consensus Î±. Otherwise, if (n_{i,Î±}+ n_{i,Î²})/N > 0.75 for some pair of bases Î± and Î², then the site is assigned the coconsensus [Î±/Î²]. If neither criterion is satisfied or if the column i was blocked out because it did not satisfy the chisquared test, the site is assigned a N.
Predicting regulatory sites
The score of a sequence b_{1}b_{2}...b_{ l }to a weight matrix w_{i,Î±}is defined by the sum , which correlates with the binding affinity of the factor to the DNA sequence [24]. When a weight matrix is scored over many distinct segments, the histogram of scores s can usually be approximated by some normal distribution N(s; m, Ïƒ) with mean m and variance Ïƒ^{2}. Hence, we characterize a weight matrix by the mean m_{ s }and variance of the scores of the matrix to the N defining segments used to compute the matrix and by the mean m and variance Ïƒ^{2} of the scores of the matrix against all the distinct segments of length l in our upstream sequences. The more separated N(s; m_{ s }, Ïƒ_{ s }) and N(s; m, Ïƒ) are, the better the matrix can distinguish potential sites from background sequences. The sites predicted by a weight matrix are those with a score larger than a cutoff s_{0}. The false positive rate is given by N(s; m, Ïƒ) and the false negative rate by N(s; m_{ s }, Ïƒ_{ s }). Since a decrease in the false positive rate can only occur at the expense of an increase in the false negative rate, care must be taken in choosing s_{0}. We choose s_{0} to be max{m_{ s } z_{ self }Ïƒ_{ s }, m + z_{ back }Ïƒ}, with the two parameters z_{ self }and z_{ back }, called the critical self and background zscores respectively, typically having the values 1 and 3 to ensure a false positive hit rate no greater than 0.2%.
Running time
The rate limiting steps of our algorithm are the exhaustive search for and the clustering of the overrepresented dimers. The exhaustive search executes in O(N_{ D }+ L_{ U }L_{ D }) time where N_{ D }is the number of dimers searched for, L_{ U }is the combined length of the upstream sequences, and L_{ D }is the sum of the different word lengths considered (e.g. 9 if word lengths 4 and 5 are considerd). To reach the trivial state that every dimer is in its own cluster, our current implementation of our WLC algorithm executes in O(E^{2}Vlog_{2}V+EV^{3}) time on the graph G = (V, E) and uses a breadth first search to identify the connected components and Dijkstra's algorithm to compute the shortest paths between all overrepresented dimers. The stated running time of our WLC algorithm however should be interpreted as an upperbound that can in certain instances be a gross overestimate depending on the precise topology of the graph G.
Web site
Our website http://www.physics.rockefeller.edu/~mwangi/ presently lists our regulatory site predictions for B. subtilis and several other species. For each, we list

1.
the regulon defined by each weight matrix with the operons' annotations,

2.
each upstream region with the predicted regulatory sites,

3.
all matrices with significant number of multiple matches in a upstream region,

4.
pairs of our matrices that frequently cooccur in the same upstream region,

5.
the observed and expected distributions of positions of a matrix's matches relative to translation start,

6.
the observed and expected distributions of positions of a matrix's matches relative to our best primary sigma factor binding site predictions,

7.
input files for the DNA sequence viewer and annotation tool ARTEMIS [26].
Results
Nomenclature
To simplify terminology, we will use the term 'operon' in what follows to denote our putative operons predicted as described in "Putative operons and upstream sequences." Since a particular weight matrix is thought to represent sites uniquely recognized by some transcription factor, the term 'regulon' will be used for the group of operons having a match to the matrix directly upstream, i.e. direct targets of the factor.
Overview
We applied our algorithm to the well studied gram positive bacteria B. subtilis. We grouped the 4100 prokaryote's ORF's into 2729 putative operons and found after the removal of poly a/t patterns 732 overrepresented dimers with both words between 4â€“5 in length and a spacer between 3 and 30. In the list of our 10 most significant dimers in Table 1, the four dimers ttgaN_{20}ataat, ttgaN_{19}tata, ttgaN_{21}taat, and ttgacN_{19}ataat all correspond to the consensus sequence TTGACAN_{17}TATAAT recognized by the primary sigma factor Ïƒ^{A}[20], the two dimers ggtggN_{3}cgcg and agggtN_{4}ccgcg correspond to the Tbox [27] with a known consensus sequence AANNAGGGTGGTACCGCGNN involved in the alternate transcription termination regulation of the aminoacyltRNA synthetases, and the consensus sequence TGAAACN_{16}CGTA recognized by the antimicrobial resistance sigma factor Ïƒ^{W}[20] is represented by the dimer gaaacN_{16}cgta.
Figure 1 shows the ratio R (Eq. 5) of the mean child to parent intracluster affinity versus the number of clusters when we clustered the 732 overrepresented dimers. There was a plausible plateau at 350 clusters, 97 of which contained 2 or more dimers. We found that 317 of the 350 clusters matched 3 or more sequences and converted these clusters to weight matrices for further study. Of the 317 matrices, we were able to identify 52, listed in Table 2, that met at least one of our criteria for significance. Of the 52 matrices, 10 represent experimentally characterized regulatory factors, 30 have regulons that contain a disproportionate number of operons with related functions, and 32 have matches exhibiting some positional bias. A total of 28 of the matrices listed in Table 2 were derived from a cluster of two or more dimers. To further demonstrate our algorithm, we also searched for longer symmetric dimers with word lengths 6 that could overlap coding sequence and applied our algorithm to the subset of sequences upstream of operons identified to be coexpressed in various studies.
Regulon sizes
To validate our methods, we began with a collection of transcription factors with experimentally characterized recognition sites collected in the DBTBS database [28] and by Helmann [29]. We restricted our attention to the 34 factors each with at least two sites, giving 600 sites in total. In the histograms of regulon sizes in Figure 2, size is reported in terms of number of operons. In (a), a regulon of a factor is defined as the set of our predicted operons that have immediately upstream a site documented in the DBTBS database to be recognized by the factor. Similarly, a regulon of a weight matrix in (b) or (c) consists of the operons that have immediately upstream a match to the matrix. A matrix in (b) for a factor was computed from the sites listed in the DBTBS database for the factor. For factors like Ïƒ^{A}and DegU that recognize dimers with variable spacing x, we computed separately a matrix for each spacing x. The matrices in (c) are our 317 matrices derived from our clusters of overrepresented dimers. As noted in the caption, a number of matrices have regulons containing more than 400 operons. Some of these matrices, like those for Ïƒ^{G}and Ïƒ^{K}, were derived from experimental sites exhibiting little consensus. Others represent factors like ComK that recognize ubiquitous motifs like AAAAN_{5}TTTT, which may not all be functional. An exception is the matrix for the factor SpoOA with 824 operons in its regulon. SpoOA is the master regulator of sporulation and may have many targets [30].
The expressions in "Predicting regulatory sites" for the rates of false negative and positive predictions for a weight matrix's matches assumed a Gaussian distribution of values. We used the 600 DBTBS sites to test the expressions by computing for each factor's weight matrix in Figure 2(b) the percentage of its sites and the percentage of sites annotated for another factor that the weight matrix matched. The false negative rate can be deduced from the former percentage, and the false positive rate is given directly by the latter. The results agree well with the Gaussian assumption.
More than half of the regulons for our matrices in Figure 2(c) contain 10 or fewer operons. The five largest regulons with sizes 1141, 903, 518, 320, and 281 belong to the matrices WM1, WM5, WM29, WM4, and WM90 with consensus sequences N_{7}TTGAN_{19}TATAATAN_{6}, N_{5} [A/T]TTT [A/T]N_{5}AAAT[A/T][A/T]N_{5},NAAATTAN_{6}[A/T]N_{4}TAATTTNN,N_{4}[A/T]AAATT[A/T]N_{6}A[A/T]TT[A/T]N_{5}, and N[C/T]TTAC[A/T]N_{16}GTAA[A/G]NN respectively. Since WM1 represents the primary sigma factor Ïƒ^{A}, it is not surprising that its regulon contains nearly half of all our predicted operons. The matrices WM5, WM29, and WM4, representing ubiquitous poly a/t patterns, may correspond to UAS and UP elements [31]. The matrices that correlate well with the known factors Ïƒ^{B}, Ïƒ^{W}, Tbox, Ïƒ^{L}, LexA, TnrA, and CcpA (see next section) have regulons containing 8, 16, 24, 5, 29, 111, and 54 of our operons respectively. It is clear from our literature search that we underestimate the number of operons directly targeted by Ïƒ^{B}and Ïƒ^{W}. To date, at least 35 operons have been shown experimentally to be transcribed from Ïƒ^{B}dependent promoters [32]. Moreover, various genetic and reverse genetic approaches and array technologies suggest that over 200 genes are Ïƒ^{B}dependent, although some indirectly [33]. Using consensus search, runoff transcription followed by macroarray analysis, and transcriptional profiling, [34] identified 30 Ïƒ^{W}dependent promoters. Our underestimates of the Ïƒ^{B}and Ïƒ^{w}regulons can be attributed to the high specificity of our weight matrices and highlight a weakness in our algorithm. Our Ïƒ^{B}matrix was derived from a cluster of only one dimer, and our Ïƒ^{W}matrix was derived from a cluster of 7 dimers with no mismatches. Although the factors' recognition consensuses are very well reflected by the dimers in these clusters, no dimers representing allowed variations to these consensuses in both sequence and spacer met our criterion for overrepresentation, so our Ïƒ^{B}and Ïƒ^{w}clusters and hence their derivative matrices were too specific and matched only the strongest of sites. To remedy this weakness, we would have to search not for overrepresented dimers but overrepresented classes of dimers with mismatches and variable spacers. Notwithstanding this, the sizes of our other matrix regulons compare favorably with those documented in the literature. Of the 21 aminoacyltRNA synthetase operons, 14 are known to be regulated by the Tbox [35]. Reference [20] estimates that the Ïƒ^{L}regulon contains 6 operons, and according to [36], some 20 operons are direct targets of LexA. We could not find any recent estimates of the sizes of the TnrA and CcpA regulons. Both factors are believed to regulate many genes [37, 38], and CcpA according to the DBTBS database is believed to directly target at least 34 sites. Excluding WM5, WM29, and WM4, our 317 matrices predict on average 3.5 sites per upstream region. On our web site, we mark simultaneously all predictions from our 317 matrices and the matrices derived from the experimental sites.
Weight matrices correlating with known factors
To correlate our 317 weight matrices with known factors; we scored them over the 600 DBTBS and Helmann sites. The number e of sites for a factor f expected to match a matrix w is
where N_{ s }is the number of sites listed for the factor, l_{ i }is the length of the i^{th}site s_{ i }, l_{ w }is the number of columns in w, and p_{ w }is the probability that a randomly chosen segment of length l_{ w }will match w. The probability P(w, f) of observing by chance that n of the sites s_{ i }bound by f contain a segment that matches w is then given by the Poisson distribution. For P(w,f) to be significant, we insisted that it be less than 10^{4}, roughly the inverse of the total number of matrices times factors being compared.
If P(w, f) happened to meet this cutoff, we manually checked that it was the most conserved positions in the experimental sites for a factor that matched our matrix. By these criteria, we could correlate at least one of our matrices with one of seven factors (Ïƒ^{A}, Ïƒ^{B}, Ïƒ^{W}, Ïƒ^{L}, LexA, TnrA, and CcpA) in our collection of 34 factors, a 21% success rate. We missed the factors ComA, CtsR, Fnr, HrcA, RocR, YqhN, and Zur even though these factors are quite specific. In most cases, it is because the dimers that are part of the conserved core of the binding sites of the factor did not satisfy criterion Eq. 3. When we only considered dimers with word lengths 4, the number of dimers considered decreased ~16fold in the general case (~4fold in the symmetric cases), and we found that under the new less stringent criteria given by Eq. 3 that at least one of our matrices correlated with one of nine factors (Ïƒ^{A}, Ïƒ^{B}, Ïƒ^{W}, LexA, CcpA, ComA, Fnr, GltC, and GltR) or ~26% of the factors in our collection. Unfortunately, we missed the factors Ïƒ^{L}and TnrA since their representative dimers all contain length 5 words.
For Ïƒ^{A}, we can compare our predictions with those of Reference [39]. Using a hidden Markov model (HMM) fitted to known Ïƒ^{A}sites that allowed for variable spacing between the 35 and 10 elements, [39] predicted 881 Ïƒ^{A}sites in our upstream sequences, 625 with a spacer 17 captured by our weight matrix WM1. Our matrix WM1 has 1580 matches upstream of 1141 operons, of which 413 agree with one of the 625 from [39]. Moreover, WM1 matched with no training 109 out of the 132 sites listed in [29]. It is unclear if we are seriously overpredicting since [39] estimates that their HMM misses 30% of real sites, and some of our WM1 matches could represent other spacings, which would be expected to yield a disproportionately large number of false positives. Our prediction that ~40% of our operons directly depend on the dominant sigma factor does not seem excessive. Our WM1 matches also have a very strong positional bias (see below).
Noticeably absent from our list are matrices that represent the very specific HrcA and Fur factors. HrcA binds to the CIRCE elements TTAGCACTCN_{9}GAGTGCTAA [40] directly upstream of the genes hrcA and groES. Although Fur recognizes the 15 bp consensus TGAtAATNATTaTCA, many of the 20 operons known to be targeted by Fur are regulated by two overlapping Fur sites with the classic 19 bp consensus GATAATGATNATCATTATC [41]. One of the two CIRCE elements (that upstream of the groE operon) overlaps coding sequence and so was not in our search space of upstream sequences. We examined all dimers with word lengths 4â€“5 and spacing 1â€“11 that matched the given 15 and 19 bp Fur consensuses. The most significant dimer taatNNttatc occurred 15 times in our search space of upstream sequences with a probability log_{10}P = 3.6. Although the Fur sites display a high degree of conservation along their length, it appears that due to variations at individual sites no dimer met our criterion for overrepresentation. For example, the dimer tgataN_{5}tatca only occurs twice in the 21 known Fur sites listed in Figure 4 in [41] because of variations at the fourth and twelfth sites highlighted in lowercase in the consensus TGAtAATNATTaTCA. This illustrates a known shortcoming of our method, which ignores dimers that, though not significant individually, are significant as a cluster. Because words like taat and ttatc occur frequently, note that the significance of the occurrence of the dimer taatNNttatc is much lower than might be expected. Under a null model ignoring nucleotide correlations, the dimer taatNNttatc would in our search space of ~0.5 Mb be expected to be seen ~1/4^{9} Â·500000 ~ 2 times. Hence, the probability of seeing the dimer 15 times would by Poisson statistics be ~2^{15}/15!Â·e^{2} ~10^{9}.
Observing that both the HrcA and Fur consensuses are long and reverse complement symmetric, we decided to search for overrepresented symmetric and reverse complement symmetric dimers with word lengths 6 and spacers 1â€“30. We also augmented our search space to 300 bp upstream of each operon irrespective of whether this includes coding sequence. We clustered the 64 dimers we found into 35 clusters. Our third largest cluster had two dimers gcactcN_{9}gagtgc and tagcacN_{13}gtgcta that matched the CIRCE element and an additional two dimers acacgcN_{7}gcgtg and aagctcN_{13}gagctt that may define a broader recognition consensus for HrcA. There were no plausible matches to the Fur consensuses.
Known sets of coregulated genes
Drawing from microarray studies, known regulons, CHipCHip studies, etc., we compiled 39 sets, each containing genes believed to be targeted by some factor either directly or indirectly. The list of factors considered includes seven sigma factors (D, E, F, G, K, and X [20] and H [42]), the twocomponent systems DegU, ComA, and PhoP [43], 24 other twocomponent systems [44], AbrB [28], Fur [41], PucR [45], and PurR [46]. In what follows, we work with our operons predicted as discussed in "Putative operons and upstream sequences." If in a set a gene in one of our operons is listed to be a target of a factor, then the entire operon is considered to be a target.
For each of our 39 sets except those for the sigma factors, we asked which if any of our weight matrices had a regulon containing a disproportionate number of the set's operons. A weight matrix identified in this way could correspond either to the master factor believed to coregulate the set's genes or some downstream factor activated later in the regulatory cascade. The probability that one of our regulons and one of the 32 sets considered share n operons by chance can be assessed using Poisson statistics. A probability cutoff of < 10^{4} is used appropriate to our sample size of 32Â·317. None of our weight matrices were found to have a regulon containing a disproportionate number of the targets listed in a set. (Of the 3 (18) operons identified as being regulated by the twocomponent system YccGYccH (YclKYclJ), 2 (2) were contained in the regulon for our matrix WM298 (WM259) with a size 27 (5) for a significance of ~10^{3} (~10^{3}). We report these twocomponent systems in Table 2 because we think they might be real.)
To see why we did so poorly, we examined in more detail the 69 operons listed in the microarray study [43] to be targeted by DegU. Only 2 of these operons could be found among the 13 listed in the DBTBS database to be part of the DegU regulon. This suggests that the microarray study produced a considerable number of false negatives. It is possible that many of the targets listed in the study are indirect targets controlled by a cascade of regulatory factors and that no single factor directly binds to enough sites for its recognition consensus to be identifiable in our whole genome wide analysis.
For 13 of the factors we considered (sigma D, E, F, G, X, and H, DegU, PhoP, AbrB, Fur, PucR, and PurR), the recognition consensuses are known. For each factor, we applied our algorithm to the regions upstream of the operons listed in our sets to be coregulated by the factor. Since for each of these factors only 5â€“70 operons are listed to be targets, we had to search for only length 2â€“3 words in order to have reasonable counts. For 2/5 of the factors, at least one of our three topmost significant dimers matched the known consensus. For gene sets this small, other methods however may be preferable (see Discussion).
Regulons identified by operon functions
A detailed manual examination reveals that the constituent operons of many of the regulons of our 317 weight matrices have highly related functions. For instance, the two operons prsA and sipA in the regulon for WM171 are both part of the Sec dependent protein export machinery [47]. In addition, the regulon for WM304 of size four contains at least three transporters, and the regulons for WM290 and WM47 contain a disproportionate number of genes involved in DNA synthesis and repair.
To attach a putative function to our 317 matrices automatically, we made use of ~20 COG functional categories assigned to the ORF's in the protein table (PTT) file for B. subtilis [48]. We defined the category of one of our operons to be the category of the first gene and inspected each of our matrix regulons for overrepresented categories by using Poisson statistics to assess the number of operons belonging to any category. For significance, we used a probability threshold of 0.01, roughly the inverse of the number of regulons considered. (The probability threshold 0.001, corresponding to the inverse of the number of reguloncategory pairs considered, would be too stringent since the overrepresentation of a particular category in one of our regulons often excludes the overrepresentation of another category.) The 21 of our matrices whose regulons contain an overrepresented category are listed in Table 2 along with their significance scores. For a category to be overrepresented in a given matrix regulon, note that the majority of the operons in the regulon need not belong to the category, just a disproportionately large number. Since many of the genes in B. subtilis have yet to be assigned a COG and since many regulons might contain operons belonging to a diverse set of categories, this form of automatic functional scoring is rather haphazard. Indeed, only one of the matrices WM304 that we identified manually (using the more extensive information available at http://genolist.pasteur.fr/SubtiList/[49]) came up in our automatic screen. When we searched the regulons consisting of our operons immediately downstream of the experimental verified sites listed in the DBTBS database and by Helmann, the regulons for 5 out of the 11 sigma factors and 6 out of the 23 other transcription factors contained an overrepresented category.
Weight matrices with positional bias
When we score our matrices over the whole genome, the matches to some of our matrices exhibit clear positional biases. Not only do many of these matches prefer to fall in noncoding as opposed to coding sequence, which can be expected since the matrices themselves are derived from noncoding sequence, but the matches tend to cluster into various intervals upstream of the translation starts. Of particular interest are the positions of the matches to our matrix WM1 representing Ïƒ^{A}, for these matches define the transcription start sites and thus can be used to determine whether a putative site is bound to by either an activator or a repressor. We defined a regulatory subset R of the noncoding sequence to be the regions upstream of the translation starts of divergently transcribed operons. Hence, for each divergent pair of operons, there are two sequences in R. We restricted the sequences to be each a maximum of 300 bases, and when the interoperon distance was < 600 bases, we included the middle overlapping segment (with the appropriate orientation) in both sequences. Because the Ïƒ^{A}matrix is far from reverse complement symmetric, this ostensible double counting is not a problem. For comparison, we defined an analogous nonregulatory subset NR of the noncoding sequence to be the sequences downstream of the translation stop codons of pairs of convergently transcribed operons. Although the numbers of segements in the two sets are neary equal, there are 175500 independent ways of placing a WM1 match in R versus 49500 in NR. Hence, the regions between divergent operons are longer than between convergent operons. Still, there are 806 matches to WM1 in R versus 99 in NR. Hence, the density of matches is 2.2 greater in the regulatory set.
In addition to the greater number of matches, the actual distribution of matches in the regulatory set deviated more from random (see Figure 3). For each set, we defined the random distribution as that expected if each position for a WM1 match in the sequences was equally likely. We then normalized the distribution so that the total number of matches was equal to that observed and binned the counts to obtain the histogram in Figure 3. The deviation between the actual and random distributions was scored with the Kolmogorov Smirnov test [23]. For the interval [70, 40), there is a 5x greater probability of occurrence of a WM1 match in R versus NR and 6x greater than for coding sequence (after accounting for the different number of samples). We also looked at all analogous sequences between tandemly transcribed operons, comparing the conventional upstream regulatory region of the downstream operon (R) with the same size region immediately downstream of the upstream operon (NR). We scored WM1 over the latter region in the opposite sense to transcription to distinguish from perhaps distant sites regulating the downstream operon. Once again, the WM1 matches exhibited a clear positional bias for matching segments in the regulatory set, in particular the [70, 40) interval. However, the difference between the two sets was less substantial: there was only a 3x greater probability of occurrence of a WM1 match in R versus NR in the interval [70, 40).
We tested the matches to the remainder of our 317 matrices for positional biases. For each matrix, we compared the distribution of the matrix's matches in our search space of upstream regions defined in Algorithm with a random distribution defined as the distribution expected if each position for a match were equally likely. Eighteen matrices had biased distributions at a significance level P < 0.01 as assessed by the Kolmogorov Smirnov test. The six most significant distributions discounting WM1 are shown in Figure 4. The matches for one of the 18 matrices, WM14, tend to occur in the same upstream sequences as the Tbox. The c/g richness and the reverse complement symmetry of WM14's consensus 3CGGC11GCCG3 suggest that the motif is capable of forming a stem loop structure that may interact with the alternate structures formed by the Tbox.
A more ambitious test, since it relies on the quality of our Ïƒ^{A}predictions, distinguishes matrices representing activators and repressors by their matches' positions relative to the Ïƒ^{A}predictions. The position of a matrix match relative to a WM1 match in the same upstream region in our search space is measured center to center. The position 1 indicates that the center of the matrix match is 1 base upstream of the center of the WM1 match. Relative to the center of the Ïƒ^{70} site in E. coli, the centers of activator sites are concentrated upstream in the 20 to 70 interval, and the centers of repressor sites tend to fall downstream of the 20 position [17]. At a significance level P < 0.01, the matches of 13 matrices (excluding those representing Ïƒ^{A}) exhibited biases relative to our WM1 matches (see Table 2). The six most significant cases are shown in Figure 5, and only WM46 appears to be a repressor. In the case of WM46, the positional bias may come simply from the similarity of the 5' end of WM46, TATA, with the 3' end of WM1 with consensus N_{7}TTGAN_{19}TATAATAN_{6}. Nevertheless, if WM46 represents an actual factor, it would act as a repressor.
The matches to WM22 did not exhibit a positional bias with respect to our WM1 matches, even though WM22 is a good representative of the canonical repressor LexA (of the 35 matches to WM22, 18 agreed with one of the 30 experimentally verified LexA sites in [36]). In our set of upstream sequences, only 9 of the 35 WM22 matches have a WM1 match to compare with in the same sequence, suggesting that the Ïƒ^{A}recognition sites are weak for LexA regulated genes. When a comparison can be made, the centers of the WM22 matches tend to fall upstream of the WM1 matches, which is consistent with the observation that LexA sometimes prevents transcription initiation by binding upstream of the RNA polymerase binding element to inhibit the interaction of the RNA polymerase Î±subunit with the a/t rich UP element [36]. A histogram of the positions, again measured center to center, of the 30 experimentally verified LexA sites relative to the known sigma site has the most weight in the upstream interval [40,20).
We also checked the weight matrices derived from the experimentally verified recognition sites for the 23 nonsigma factors in the DBTBS database. No matrix had matches exhibiting a positional bias with respect to our WM1 matches at a significance level P < 0.01. In a number of cases (e.g. AraR, RocR, CtsR, and HrcA), the total number of matches is small and thus does not define a significant distribution; in other cases (e.g. CcpA, DegU, SpoOA, and TnrA), the regulators act as both activators and repressors; finally, for the factors with more than 400 matches in Figure 2(b), we expect that many of the matches are false positives for reasons stated above.
Other applications
Pathogenicity islands (PAI's) [50] transferred between bacteria present interesting cases for study, for it is not clear if and how the PAI's are coordinately regulated with the host genome. Any cross regulation that exists may not have any profound significance but could occur by chance and not be deleterious. A well studied case is the PAI SPI1 in S. typhimurium LT2 [51], which encodes two transcription factors HilA and InvF [52] that regulate genes within the island. When we applied our algorithm to the entire S. typhimurium LT2 genome, we did find a marginal match to the HilA recognition consensus but the statistics were poor. There were numerous matrices though that recognized sites within and outside the island, suggesting that the pathogenicity genes are coregulated with the remainder of the genome. We also ran our algorithm on just the SPI1 island itself but found nothing overrepresented that matched the known HilA and InvF recognition consensuses.
Discussion
There are a number of motif finding algorithms (Consensus [4], Gibbs [5], MEME [6]) that construct a weight matrix directly and are suitable for locating similar patterns in groups of tens of operons. They are thus the best tools for which to process gene clusters obtained from microarrays. (For bacterial applications, their sensitivity is much improved if they fit to dimer patterns with symmetry.) They evaluate significance by reference to a model of random bases (which is far from the truth, even if poly A/T sequences are excluded) and may not converge to the optimal pattern. They also do not use information from beyond the genes being analyzed. Reference [7] search for overrepresented monomers of length 6 in a target set. Significance is assessed by contrasting the counts in the target set to the counts genome wide. They are then faced with an assembly problem for the various 6mers that scored significant and the possibility that a degenerate pattern is significant even when none of the words that overlap it are.
There are a number of algorithms that exploit the dimer symmetry of bacterial motifs [8, 10, 9]. They differ in how they assign significance. Reference [8] searches for dimers of world length 3 in a subset of sequences and assesses the frequency of occurrence by either contrasting the subset with the genome or using actual word counts and computing a probability from Poisson statistics based on the spacing, as we do. They do not attempt to cluster the word pairs thereby obtained nor do they attempt genome wide applications. Reference [9] compute significance from a Markov Model applied to the entire dimer. They score degenerate patterns defined by IUPAC symbols and resolve overlapping motifs with a greedy algorithm [53].
Our algorithm is a direct extension of [15], who worked with E. coli. Our principal technical innovations involved the clustering of the dimers, the construction of weight matrices from sites, and the detailed manner in which we validated our predictions using the available B. subtilis information. When applied to E. coli, our clustering procedure gave about half the number of clusters as in the earlier paper (if clusters containing one dimer are counted) and generally reduced the number of nearly equivalent weight matrices. When we computed weight matrices, we did not use low information matrix columns in subsequent scans with the matrix across the genome. This eliminated a certain amount of noise and generally gave us putative regulons of comparable size to the more sophisticated inference method developed by [54].
When we compared our results with the DBTBS and Helmann databases, we hit a smaller fraction (~21%) of the known recognition sites than in the parallel study for E. coli, probably because for many factors only a few sites with a poorly defined consensus are listed. We did do better with sigma sites, and our most significant dimers corresponded to the consensus recognized by Ïƒ^{A}, the functional homologue of the primary sigma factor Ïƒ^{70} in E. coli. Although Ïƒ^{A}and Ïƒ^{70} recognize the same consensus, failure to recover the Ïƒ^{70} matrix in [15] was not due to difference in method but rather the inherent greater variability of the E. coli sites. In contrast to some weight matrix scans in E. coli that generalized from experimental sites, e.g. [19], most of our dimers generated matrices (with the exception of the poly A/T dimers) that gave very reasonable regulon sizes. Our surrogate Ïƒ^{A}matrix, WM1, had a regulon of size 1141 and matched 109 out of 132 experimental sites documented by Helmann with the same spacing. Evidence that a matrix represents an actual regulatory factor could be deduced for a total of 52 of our 317 weight matrices using either matches to known sites, correlations in operons functions, or biases in matches' positions. For comparison, the B. subtilis genome is predicted to encode for 200 DNA binding proteins [55]. Some of our predictions may correspond to translation control motifs, which sometimes operate though conserved stems in the mRNA. We tended to set our significance thresholds high so as to minimize false positives. For these reasons, we missed specific factors such as ComA, CtsR, and Fnr. In counting dimers, we insisted that any prediction have a probability < 10^{7} of occurring by chance given our statistical model, i.e. there is about one random prediction among the set of 10^{7} dimers we searched through. A less stringent cutoff could be used for symmetric and reverse complement symmetric dimers since there are fewer cases to examine.
The most serious shortcoming of our algorithm is that it enumerates and scores ACGT words rather than more degenerate patterns. Thus a fairly specific pattern such as the Fur box TGAtAATNATTaTCA, with a variable site in the center of each word, does not yield any single dimer that passes our cutoffs for significance. Another shortcoming is our relatively crude method of predicting operons. A more sophisticated method could be used, like the ones outlined in [56] and [57]. A more fundamental problem is that a transcription factor can distinguish its preferred binding sites in the genome even when it is impossible to discern these sites by searching for statistical overrepresentation [58]. Interspecies comparisons are an obvious source of additional sequence information, and one can envision a generalization of our counting procedure to handle multiple genomes. Other extensions would use sequence information along with expression or annotation data to assign higher weight to marginal sites falling within a cofunctional gene group.
Contributions
Both authors contributed to the refinement and implementation of the algorithm and the analysis of the results.
References
Sahel B, Bork P, Huang MA: The identification of functional modules from the genomic association of genes. Proc Natl Acad Sci USA 2002, 99: 5890â€“5895. 10.1073/pnas.092632599
Marcotte EM, Pellegrini M, Thompson MJ, Yeates TO, Eisenberg D: A combined algorithm for genomewide prediction of protein function. Nature 1999, 402: 83â€“86. 10.1038/47048
Enright A, Iliopoulos I, Kyrpides NC, Ouzounis CA: Protein interaction maps for complete genomes based on gene fusion events. Nature 1999, 402: 86â€“90.
Hertz GZ, Stormo GD: Identification of consensus patterns in unaligned DNA and protein sequences: a largedeviation statistical basis for penalizing gaps. Proceedings of the Third International Conference on Bioinformatics and Genome Research 1995, 201â€“216.
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.
Bailey TL, Elkan C: Fitting a mixture model by expectation maximization to discover motifs in biopolymers. Proceedings of the Second International Conference on Intelligent Systems for Molecular Biology 1994, 28â€“36.
van Helden J, Andre B, Colladovides J: Extracting regulatory sites from the upstream region of yeast genes by computational analysis of oligonucleotide frequencies. J Mol Biol 1998, 281: 827â€“42. 10.1006/jmbi.1998.1947
van Helden J, Andre B, Colladovides J: Discovering regulatory elements in noncoding sequences by analysis of spaced dyads. J Mol Biol 2000, 28: 1808â€“1818.
Sinha S, Tompa M: A statistical method for finding transcription factor binding sites. Proceedings of 8th International Conference on Intelligent Systems for Molecular Biology 2000, 344â€“54.
Vanet A, Marsan L, Labigne A, Sagot M: Inferring regulatory elements from a whole genome. An analysis of Helicobacter pylori sigma(80) family of promoter signals. J Mol Biol 2000, 297: 335â€“353. 10.1006/jmbi.2000.3576
Gelfand MS., Koonin EV, Mironov AA: Prediction of transcription regulatory sites in Archaea by a comparative genomic approach. Nucl Acids Res 2000, 28: 695â€“705. 10.1093/nar/28.3.695
Rajewsky N, Socci ND, Zapotocky M, Siggia ED: The evolution of DNA regulatory regions for proteogamma bacteria by interspecies comparisons. Genome Res 2002, 12: 298â€“308. 10.1101/gr.207502. Article published online before print in January 2002
McCue LA, Thompson W, Carmack CS, Lawrence CE: Factors influencing the identification of transcription factor binding sites by crossspecies comparison. Genome Res 2002, 12: 1523â€“32. 10.1101/gr.323602
Blanchette M, Schwikowski B, Tompa M: An exact algorithm to identify motifs in orthologous sequences from multiple species. Proc Int Conf Intell Syst Mol Biol 2000, 8: 37â€“45.
Li H, Rhodius V, Gross C, Siggia ED: Identification of the Binding Sites of Regulatory Proteins in Bacterial Genomes. Proc Natl Acad Sci (US) 2002, 99: 11772â€“7. 10.1073/pnas.112341999
Huerta AM, Salgado H, Thieffry D, ColladoVides J: RegulonDB: a database on transcriptional regulation in Escherichia coli. Nucleic Acids Res 1998, 26: 55â€“59. [http://www.cifn.unam.mx/Computational_Genomics/regulondb/] 10.1093/nar/26.1.55
Gralla JD, ColladoVides J: Organization and function of transcription regulatory elements. In: Escherichia coli and Salmonella: Cellular and Molecular Biology 2 Edition (Edited by: Neidhardt FC). Washington, D.C., ASM Press 1996, 1232â€“1245.
Kurtz S, Schleiermacher C: REPuter â€“ Fast Computation of Maximal Repeats in Complete Genomes. Bioinformatics 1999, 15: 426â€“7. 10.1093/bioinformatics/15.5.426
Robison K, McGuire AM, Church GM: A comprehensive library of DNAbinding site matrices for 55 proteins applied to the complete Escherichia coli K12 genome. J Mol Bio 1998, 284: 241â€“254. 10.1006/jmbi.1998.2160
Helmann JD, Moran CP: RNA Polymerase and Sigma Factors. In: Bacillus subtilis and its Closest Relatives: From Genes to Cells (Edited by: Sonenshein AL). Washington, D.C., ASM Press 2002, 289â€“312.
BenDor A, Shamir R, Yakhini Z: Clustering gene expression patterns. J Comp Biol 1999, 6: 281â€“97. 10.1089/106652799318274
Blatt M, Wiseman S, Domany E: Superparamagnetic clustering of data. Physical Review Letters 1996, 76: 3251. 10.1103/PhysRevLett.76.3251
Press WH, Teukolsky SA, Vetterling WT, Flannery BP: Numerical Recipes in C. Cambridge, Cambridge University Press 1992.
Berg OG, von Hippel PH: Selection of DNA binding sites by regulatory proteins. Statisticalmechanical theory and application to operators and promoters. J Mol Biol 1987, 193: 723â€“50.
Cavener DR: Comparison of the consensus sequence flanking translational start sites in Drosophila and vertebrates. Nucl Acids Res 1987, 15: 1353â€“1361.
Rutherford K, Parkhill J, Crook J, Horsnell T, Rice P, Rajandream MA, Barrell B: Artemis: sequence visualisation and annotation. Bioinformatics 2000, 16: 944â€“945. 10.1093/bioinformatics/16.10.944
Grundy FJ, Henkin TM: Synthesis of Serine, Glycine, Cysteine, and Methionine. In: Bacillus subtilis and its Closest Relatives.From Genes to Cells (Edited by: Sonenshein AL). Washington, D.C., ASM Press 2002, 245â€“248.
Ishii T, Yoshida K, Terai G, Fujita Y, Nakai K: DBTBS: A database of Bacillus subtilis promoters and transcription factors. Nucleic Acids Res 2001, 29: 278â€“280. 10.1093/nar/29.1.278
Helmann JD: Compilation and analysis of Bacillus subtilis sigma Adependent promoter sequences: evidence for extended contact between RNA polymerase and upstream promoter DNA. Nucleic Acids Res 1995, 23: 2351â€“60.
Piggot PJ, Losick RL: Sporulation Genes and Intercompartmental Regulation. In: Bacillus subtilis and its Closest Relatives: From Genes to Cells (Edited by: Sonenshein AL). Washington, D.C., ASM Press 2002, 483â€“484.
Ellinger T, Behnke D, Knaus R, Bujard H, Gralla JD: Contextdependent effects of upstream Atracts. Stimulation or inhibition of Escherichia coli promoter function. J Mol Biol 1994, 239: 466â€“75. 10.1006/jmbi.1994.1389
Price CW: General Stress Response. In: Bacillus subtilis and its Closest Relatives: From Genes to Cells (Edited by: Sonenshein AL). Washington, D.C., ASM Press 2002, 369.
Cao M, Kobel PA, Moreshedi MM, Wu MFW, Paddon C, Helmann JD: Defining the Bacillus subtilis Ïƒ^{w}Regulon: A Comparative Analysis of Promoter Consensus Search, Runoff Transcription/Macroarray Analysis (ROMA), and Transcriptional Profiling Approaches. J Mol Biol 2002, 316: 443â€“457. 10.1006/jmbi.2001.5372
Henkin T: Ribosomes, Protein Synthesis Factors, and tRNA Synthetases. In: Bacillus subtilis and its Closest Relatives: From Genes to Cells (Edited by: Sonenshein AL). Washington, D.C., ASM Press 2002, 319.
Dubnau D, Lovett CM: Tranformation and Recombination. In: Bacillus subtilis and its Closest Relatives: From Genes to Cells (Edited by: Sonenshein AL). Washington, D.C., ASM Press 2002, 463â€“465.
Fisher SH: Regulation of nitrogen metabolism in Bacillus subtilis: vive la difference! Mol Microbiol 1999, 32: 223â€“232. 10.1046/j.13652958.1999.01333.x
Yoshida K, Kobayashi K, Miwa Y, Kang CM, Matsunaga M, Yamaguchi H, Tojo S, Yamamoto M, Nishi R, Ogasawara N: Combined transcriptome and proteome analysis as a powerful approach to study genes under glucose repression in Bacillus subtilis. Nucleic Acids Res 2001, 29: 683â€“92. 10.1093/nar/29.3.683
Jarmer H, Larsen TS, Krogh A, Saxild HH, Brunak S, Knudsen S: Sigma A recognition sites in the Bacillus subtilis genome. Mircobiology 2001, 147: 2417â€“2424.
Schulz A, Schumann W: hrcA, the first gene of the Bacillus subtilis dnaK operon encodes a negative regulator of class I heat shock genes. J Bacteriol 1996, 178: 1088â€“93.
Baichoo N, Wang T, Ye R, Helmann JD: Global analysis of the Bacillus subtilis Fur regulon and the iron starvation stimulon. Molecular Microbiology 2002, 45: 1613â€“1629. 10.1046/j.13652958.2002.03113.x
Britton RA, Eichenberger P, GonzalezPastor JE, Fawcett P, Monson R, Losick R, Grossman AD: GenomeWide Analysis of the StationaryPhase Sigma Factor (SigmaH) Regulon of Bacillus subtilis. Journal of Bacteriology 2002, 184: 4881â€“4890. 10.1128/JB.184.17.48814890.2002
Ogura M, Yamaguchi H, Yoshida Ki, Fujita Y, Ogasawara N, Tanaka T, Fujita Y: DNA microarray analysis of Bacillus subtilis DegU, ComA and PhoP regulons: an approach to comprehensive analysis of B. subtilis twocomponent regulatory systems. Nucleic Acids Res 2001, 29: 3804â€“13. 10.1093/nar/29.18.3804
Kobayashi K, Ogura M, Yamaguchi H, Yoshida K, Ogasawara N, Tanaka T, Fujita Y: Comprehensive DNA microarray analysis of Bacillus subtilis twocomponent regulatory systems. J Bacteriol 2001, 183: 7365â€“70. 10.1128/JB.183.24.73657370.2001
Beier L, Nygaard P, Jarmer H, Saxild H: Transcription Analysis of the Bacillus subtilis PucR Regulon and Identification of a cisActing Sequence Required for PucRRegulated Expression of Genes Involved in Purine Catabolism. Journal of Bacteriology 2002, 184: 3232â€“3241. 10.1128/JB.184.12.32323241.2002
Saxild H, Brunstedt K, Nielsen K, Jarmer H, Nygaard P: Definition of the Bacillus subtilis PurR Operator Using Genetic and Bioinformatic Tools and Expansion of the PurR Regulon with glyA, guaC, pbuG, xptpbuX, yqhZfolD, and pbuO. Journal of Bacteriology 2001, 183: 6175â€“6183. 10.1128/JB.183.21.61756183.2001
Van Diji JM, Bolhuis A, Tjalsma H, Jongbloed JD, Jong A, Bron S: Protein Transport Pathways in Bacillus subtilis: a GenomeBased Road Map. In: Bacillus subtilis and its Closest Relatives: From Genes to Cells (Edited by: Sonenshein AL). Washington, D.C., ASM Press 2002, 345â€“347.
Tatusov RL, Natale DA, Garkavtsev IV, Tatusova TA, Shankavaram UT, Rao BS, Kiryutin B, Galperin MY, Fedorova ND, Koonin EV: The COG database: new developments in phylogenetic classification of proteins from complete genomes. Nucleic Acids Res 2001, 9: 22â€“8. 10.1093/nar/29.1.22
Moszer I, Glaser P, Danchin A: SubtiList: a relational database for the Bacillus subtilis genome. Microbiology 1995, 141: 261â€“268.
Hacker J, Kaper JB: Pathogenicity Islands and the Evolution of Microbes. Annu Rev Microbiol 2000, 54: 641â€“79. 10.1146/annurev.micro.54.1.641
Marcus SL, Brumell JH, Pfeifer CG, Finlay BB: Salmonella pathogenicity islands: big virulence in small packages. Microbes and Infection 2000, 2: 145â€“156. 10.1016/S12864579(00)002732
Eichelberg K, Galan JE: Differential Regulation of Salmonella typhimurium Type III Secreted Proteins by Pathogenicity Island1 (SPI1)Encoded Transcriptional Activators InvF and HilA. Infection and Immunity 2000, 67: 4099â€“4105.
Blanchette M, Sinha S: Separating real motifs from their artifacts. Bioinformatics 2001, 17(Suppl 1):S30â€“8.
Sengupta AM, Djordjievic M, Shraiman BI: Specificity and robustness in transcription control networks. Proc Natl Acad Sci USA 2002, 99: 2072â€“7. 10.1073/pnas.022388499
Kunst F, Ogasawara N, Moszer I, Albertini AM, Alloni G, Azevedo V, Bertero MG, Bessieres P, Bolotin A, Borchert S, et al.: The complete genome sequence of grampositive bacterium Bacillus subtilis. Nature 1997, 390: 249â€“256. 10.1038/36786
MorenoHagelsieb G, ColladoVides J: A powerful nonhomology method for the prediction of operons in prokaryotes. Bioinformatics 2002, 18: S329â€“36. 10.1093/bioinformatics/18.2.329
Ermolaeva MD, White O, Salzberg SL: Prediction of operons in microbial genomes. Nucleic Acids Res 2001, 29: 1216â€“21. 10.1093/nar/29.5.1216
Nimwegen E, Zavolan M, Rajewsky N, Siggia ED: Probabilistic clustering of sequences: Inferring new bacterial regulons by comparative genomics. Proc Natl Acad Sci USA 2002, 99: 7323â€“8. 10.1073/pnas.112690399
Tobisch S, Zuhike D, Bernhardt J, Stulke J, Hecker M: Role of CcpA in regulation of the central pathways of carbon catabolism in Bacillus subtilis. J Bacterial 1999, 181: 6996â€“7004.
Fukuoka T, Moriya S, Yoshikawa H, Ogasawara N: Purification and characterization of an initiation protein for chromosomal replication, DnaA, in Bacillus subtilis. J Biochem (Tokoyo) 1990, 107: 732â€“9.
Acknowledgments
Support for this project was provided by NSF grant DMR 0129848 and by a Natural Sciences and Engineering Research Council (NSERC) of Canada doctoral Julie Payette fellowship to M.M. John Helmann and Tarek Msadek provided guidance on the B. subtilis literature.
Author information
Authors and Affiliations
Corresponding author
Authorsâ€™ original submitted files for images
Below are the links to the authorsâ€™ original submitted files for images.
Rights and permissions
About this article
Cite this article
Mwangi, M.M., Siggia, E.D. Genome wide identification of regulatory motifs in Bacillus subtilis. BMC Bioinformatics 4, 18 (2003). https://doi.org/10.1186/14712105418
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/14712105418