- We are sorry, but NCBI web applications do not support your browser and may not function properly. More information

- Journal List
- Bioinformatics
- PMC3106196

# Improved similarity scores for comparing motifs

^{1,}

^{*}Timothy Bailey,

^{2}Charles E. Grant,

^{3}William Stafford Noble,

^{3,}

^{4}and Uri Keich

^{1,}

^{*}

^{1}School of Mathematics and Statistics, The University of Sydney, Sydney, NSW Australia,

^{2}Institute for Molecular Bioscience, The University of Queensland, Brisbane, QLD, Australia,

^{3}Department of Genome Sciences and

^{4}Department of Computer Science and Engineering, University of Washington, Seattle, WA, USA

## Abstract

**Motivation:** A question that often comes up after applying a motif finder to a set of co-regulated DNA sequences is whether the reported putative motif is similar to any known motif. While several tools have been designed for this task, Habib *et al.* pointed out that the scores that are commonly used for measuring similarity between motifs do not distinguish between a good alignment of two informative columns (say, all-A) and one of two uninformative columns. This observation explains why tools such as Tomtom occasionally return an alignment of uninformative columns which is clearly spurious. To address this problem, Habib *et al.* suggested a new score [Bayesian Likelihood 2-Component (BLiC)] which uses a Bayesian information criterion to penalize matches that are also similar to the background distribution.

**Results:** We show that the BLiC score exhibits other, highly undesirable properties, and we offer instead a general approach to adjust any motif similarity score so as to reduce the number of reported spurious alignments of uninformative columns. We implement our method in Tomtom and show that, without significantly compromising Tomtom's retrieval accuracy or its runtime, we can drastically reduce the number of uninformative alignments.

**Availability and Implementation:** The modified Tomtom is available as part of the MEME Suite at http://meme.nbcr.net.

**Contact:** ua.ude.dysu.shtam@iru; ua.ude.dysu.shtam@akanat.e

**Supplementary Information:** Supplementary data are available at *Bioinformatics* online.

## 1 INTRODUCTION

Research into gene regulation has motivated significant interest in the bioinformatics community in the computational problem of motif finding (Das and Dai, 2007). Consequently, numerous tools have been developed to identify motifs given a set of co-regulated sequences (Tompa *et al.*, 2005).

More recently, the growth of motif databases such as JASPAR (Portales-Casamar *et al.*, 2010), TRANSFAC (Wingender *et al.*, 2000) and a protein-binding microarray (PBM) motif database (Newburger and Bulyk, 2009) spurred the development of new tools designed to allow researchers to test whether the motif returned by a motif finder is ‘significantly similar’ to a known motif [e.g. STAMP, Mahony and Benos (2007) and Tomtom, Gupta *et al.* (2007)]. Such motif search tools may be viewed as ‘BLAST for motifs’, and their utility includes identification of newly detected motifs and automatic clustering of transcription factor into motif families.

Motif search tools can potentially represent each motif in a variety of ways. The most detailed representation consists simply of the complete list of known binding sites. While useful in some cases, this representation is difficult to work with. At the other extreme is the consensus sequence representation, which often glosses over important subtleties of the motif. Motif database search tools, therefore, typically use a position weight matrix (PWM) representation of the motif. The PWM is typically a 4*× l* matrix where *l* is the length of the motif and the (*i*, *j*) entry of the matrix contains either the frequency or, alternatively, the count of letter *i* at position/column *j*.

After selecting a motif representation, one of the first steps in designing a motif database search tool is the choice of a distance or similarity function between motifs. To the best of our knowledge, all current tools use a linear similarity function which sums up the similarities between the aligned columns of the two motifs. Gupta *et al.* (2007) performed a comprehensive study comparing the most popular column similarity functions. Their finding was that while generally there are very small differences between most of these functions, the Euclidean distance (ED, Section 7.1 in Supplementary Material) consistently gives slightly better results than the other measures.

Habib *et al.* (2008) made the important observation that ED, as well as most other scores that are commonly used for measuring similarity between motifs, does not distinguish between alignments of columns with identical composition. For example, the ED score assigns the same perfect score to the two pairs of column alignments in Figures 1A and Figures 1B. Due to the linearity of the score, it follows that the alignments in Figures 1C and Figures 1D also share the same score, even though one is clearly more informative than the other. This is not merely a theoretical issue. Indeed, we have observed that Tomtom occasionally includes clearly spurious alignments of uninformative columns in its reported list of significant alignments (Fig. 2). While uninformative alignments^{1} are not the common case, they do persistently show up, even when using curated databases that often trim leading and trailing stretches of uninformative columns. Indeed, Supplementary Figure S5 shows that such stretches are present in the commonly used motif databases.

*et al.*, 2004), where the height of each letter is proportional to the nucleotide frequency;

**...**

*P*-value 0.00014,

*q*-value 0.0068) when

**...**

Habib *et al.* (2008) suggested addressing this problem through a novel column similarity score they termed Bayesian Likelihood 2-Component (BLiC). The BLiC score takes into account the similarity of the columns' nucleotide composition as well as their dissimilarity to the background distribution, thereby penalizing alignments of columns that are too similar to the background distribution (Section 2). Although the BLiC score is effective at removing spurious alignments of uninformative columns, we show below that BLiC exhibits a strong bias toward motifs with a high number of instances. This means that the BLiC score will assign a high score to a match to essentially any ‘deep’ database motif (one comprised of a high number of instances) irrespective of the query motif. Note that unlike ED, the BLiC score takes into account the number of instances or sites that comprise the motif.

The aforementioned bias makes the BLiC score unsuitable as a general purpose column similarity score. While one could design several *ad hoc* post-processing methods to try and remove uninformative alignments, we aimed instead to design a more principled way, in the spirit of Habib *et al.*, to address this problem.

We can tackle this problem at two levels. The first is when choosing the best alignment between a pair of motifs: can we modify popular column similarity scores such as ED so that they will prefer the alignment in Figure 1D over the alignment in Figure 1C The second is when assigning statistical significance to the chosen alignment. Because real motifs often contain short stretches of uninformative columns (Xing and Karp, 2004), a more sophisticated model than the independent and identically distributed (iid) model employed by Tomtom might better capture and penalize alignments of uninformative columns.

In the remainder of this article, we examine the combined and individual effects these two approaches have on reducing the number of uninformative alignments, keeping in mind that we wish to avoid compromising the retrieval accuracy. Our results show that our approach all but eliminates uninformative alignments while maintaining a retrieval accuracy that is on par with the original Tomtom.

## 2 WHAT IS WRONG WITH BLIC?

The BLiC score was introduced in Habib *et al.* (2008) to address the inability of scores like ED to distinguish between a good alignment of informative columns and a good alignment of uninformative columns. BLiC measures the similarity between the ‘query’ column *Q* and the ‘target’ column *T* as

where , and are posterior mean estimates (using a Dirichlet prior or a mixture of Dirichlet priors) of the nucleotide distribution for the query, target and combined columns, respectively, and *B* refers to the background distribution.

The first component of the BLiC score measures the likelihood that the observed counts of the two columns are generated by a common distribution rather than two distinct distributions and is thus a similarity measure in the spirit of other such scores. The second component penalizes the alignment of uninformative columns as it compares the likelihood that the two columns were generated by a common distribution with the likelihood they were generated by the background distribution. Unfortunately, as we show next, this second component of the BLiC score creates a distinct bias toward motifs composed of a large number of sites.

Let *N*_{Qa} be the count of nucleotide *a* in column *Q* and let *N*_{Q} be the number of sites of the query motif, i.e. *N*_{Q} *= ∑*_{a}*N*_{Qa}, where is the four-letter alphabet (similar definitions apply to *T*). Then, with *π*_{a} denoting the background distribution of *a* we have,

In Section 1 of the Supplementary Material, we argue that as *N*_{T}*→∞*, assuming does not converge to the background distribution π, *S*_{2}*→∞*, whereas *|S*_{1}*|* remains bounded. This means that the BLiC score prefers target motifs with large *N*_{T} *regardless* of the query motif. A graphical representation of this phenomenon is presented in Supplementary Figure S1. The following experiment demonstrates that this bias is not just a hypothetical mathematical curiosity.

We implemented the BLiC score in Tomtom and selected the first motif in TRANSFAC to search against all the motifs in the TRANSFAC database (including the query motif). Tomtom reports a list of matches ranked according to the significance of the alignment score. The alignments are schematically presented using motif logos (Schneider and Stephens, 1990). The top three hits in TRANSFAC are shown in Figure 3. For ED, the top hit is, as expected, the query motif itself. However, the top three hits using the BLiC score do not look remotely like the corresponding query motif. As it happens, the top three hits for the BLiC score have a large number of sites associated with them. The analysis above, as well as further examples below, demonstrate that the BLiC score suffers from a significantly compromised retrieval accuracy. This detrimental effect is particularly pronounced when querying a database which has a few deep motifs such as TRANSFAC. Thus, while the BLiC score is effective at reducing the number of uninformative alignments, it is not suitable as a general similarity score. This motivates our following, alternative, approach to reducing spurious uninformative alignments that does not materially compromise the retrieval accuracy.

**...**

## 3 ALIGNMENT SELECTION

How can we prevent Tomtom from selecting the alignment portrayed in Figure 1C The current prevailing alignment scoring scheme is linear, that is, the alignment is scored as the sum of the similarity scores of the aligned columns. More explicitly, let *Σ*_{S}(**Q**, **T**, *α*) denote the similarity score of the *ungapped* alignment α between the query motif **Q** and the target motif **T** using the column similarity score *S*. Then

where *Q*_{i}, *T*_{i} are the columns of **Q**, **T**, the alignment α is identified with the offset between *Q*_{1} and *T*_{1}, *|Q|* is the width or length of the query and *S* is conveniently defined as 0 when *i+α*[1, *|T|*].

Because the score is linear in the number of aligned columns, it needs to be normalized before we can compare alignments. Tomtom normalizes the alignment score by computing its ‘offset *P*-value’. The latter is an alignment specific *P*-value, which is the probability that a random alignment of the same length will have a better score. Random here refers to an iid model for the target motif columns:

where ** R** is a random motif whose columns

*R*

_{i}are drawn with replacement from , the reservoir of all target columns (note that we only need to draw the aligned number of columns). After normalizing the alignment scores, Tomtom selects the one with the optimal, i.e. minimal, offset

*P*-value.

While this approach in general yields a very high retrieval accuracy (Gupta *et al.*, 2007), when it comes to filtering uninformative alignments as in Figure 1C, the approach cannot overcome the fact that most scoring schemes give this alignment a maximal score. One way to address this problem is to look at the unaligned part of the motif, a segment which is typically ignored by existing tools, including Tomtom. Specifically, we would like to assign scores to unaligned columns in such a way that unaligned informative columns would contribute less than unaligned uninformative columns. Such a scheme would prefer the alignment in Figure 1D over the one in Figure 1C.

In (2) we used the convention *S*(*Q*_{i}, )*: =* 0 so that only aligned columns get scored. Instead of that, we now propose to define a ‘complete’ version of *S*, denoted as *S*_{c} as follows. *S*_{c} agrees with *S* on aligned columns; however, *S*_{c}(*Q*_{i}, )*: = m*_{i}, where *m*_{i} is the median of the set {*S*(*Q*_{i}, *T*) *: T*}, i.e. *m*_{i} is the median score of randomly aligning a target column to *Q*_{i}. By assigning the average null score to any unaligned columns, we place all alignments scores on the same scale since all the query columns are considered for each alignment.

Moreover, recall that most column similarity scores such as ED assign the same perfect score to columns with identical composition, regardless of whether they are informative or not. It follows that for a typical target database max{*S*(*U*, *T*) *: T*} = max{*S*(*A*, *T*) *: T*}, where *U* is an uninformative uniform column and *A* is a maximally informative all-A column. At the same time, these similarity scores also typically satisfy *S*(*A*, *X*) < *S*(*U*, *X*), where *X* is an all-*X* column for *X*{*C*, *G*, *T*}, and it follows that min {*S*(*U*, *T*) *: T*} > min {*S*(*A*, *T*) : *T*}. This explains why in practice *m*_{i} is higher when *Q*_{i} *= U* than when *Q*_{i} *= A* (Table 1 and Supplementary Fig. S6). Therefore, this new approach effectively assigns a lower score to an unaligned informative column than to an unaligned uninformative column, guaranteeing that our modified score will rank the alignment in Figure 1D higher than the one in Figure 1C.

The discussion above motivated and introduced our new scoring scheme. However, for computational convenience, it is beneficial to introduce the following twist on our last score. Note that is constant for a given query. Hence, if we subtract μ from our newly defined alignment score, we get an *equivalent* score: the ranking of the alignments of the database motifs to the given query is not affected by a constant shift. This new score is formally quite similar to the standard score in (2) and is therefore significantly easier to incorporate into Tomtom. We refer to it as the ‘complete score’.

When presented this way, our new score once again ignores unaligned columns. However, note that now the median null score of an aligned query column is 0 so this modified scheme is consistent with our original score motivated above.

Note that the complete score is a transformation of a column similarity score, rather than a score per se, so for example, ‘complete-ED’ stands for (3) with ED for *S*.

## 4 SIGNIFICANCE ASSESSMENT

Having normalized the alignment score, we now need to assign an overall statistical significance to the score of the optimal alignment between the given query and target motifs. As mentioned above, Tomtom relies on an iid column model to compute the offset *P*-values for each alignment. Tomtom then makes the approximating assumption that the scores, and therefore the offset *P*-values, of different alignments are independent. Under this assumption, the optimal offset *P*-value is essentially distributed as a minimum of uniformly distributed random variables whose distribution is readily available (Tomtom refers to this overall *P*-value of the minimal offset *P*-value as the ‘motif *P*-value’).

Making the same pair of assumptions, we compute an overall query–target *P*-value for the optimal alignment score (3) as outlined next. First, mapping the scores to a lattice, we compute the distribution of the latticed null alignment similarity score for each alignment using the same dynamic programming (DP) mechanism that Tomtom uses to compute its offset *P*-values. Recall that, unlike Tomtom, we select the best alignment based on its (complete) score rather than its offset *P*-value.^{2} Therefore, at the second step we need to compute the distribution of the maximal of all possible latticed alignment scores. Of course, the different alignment scores are not uniformly distributed; however, adopting the independent alignment assumption that Tomtom is making, we can still find the distribution of this maximum using a straightforward DP approach (see Section 3 in Supplementary Material for discussion of the accuracy of the DP-computed *P*-values). This method allows us to assign a *P*-value to the optimal complete alignment score in a process that is not significantly slower than the current one employed by Tomtom.^{3}

Motivated by our goal of reducing uninformative alignments, we also introduce a hidden Markov model (HMM) of a target motif that is more appropriate than the iid model for capturing the tendency of uninformative columns to cluster. The topology of the Markov chain is specified in Figure 4. A key feature of this model is the partition of the columns to ones with high versus low information content (Stormo, 2000). Accordingly, each of the HMM states consistently emits either informative or uninformative columns.

**...**

The LL and TL states are designed to capture the occasional leading or trailing stretches of uninformative columns. Because the transitions between the states are learned from a reference motif database,^{4} the reference database, from which the distributions of column scores are estimated, is identified with the target database but this can be loosened here. the transitions can capture phenomena such as leading, trailing or internal stretches of uninformative columns (LL/TL/L).

STAMP (Mahony and Benos, 2007) uses a somewhat similar model, originally introduced by Sandelin and Wasserman (2004), to estimate the significance of the match between motifs. There are two notable differences between the latter and our HMM. First, Sandelin and Wasserman only model the first and last columns rather than leading and trailing stretches. Second, their model is an iid mixture model so it cannot model dependencies between columns which are crucial to the modeling of clusters of uninformative columns. See also Piipari *et al.* (2010) for a related, albeit more complex, approach.

In our analysis, we used a cutoff of 0.5 to determine whether a column has a high or low information content. Using this cutoff, we could unambiguously label each motif in the reference database, i.e. infer the hidden states. Thus, training becomes trivial: we used a simple maximum likelihood estimation for estimating the transition probabilities, while the column emission distributions were set to the observed empirical distributions of each state. In other words, new columns emitted from state *X* are sampled from the set of reference motif columns that were annotated as emitted from state *X*.

Once trained, we use our HMM to estimate the significance of an optimal query–target match through a Monte Carlo (MC) sampling scheme. Explicitly, we use the HMM to generate *N* random motifs of *exact* length *|T|* (target motif length), and we find the optimal alignment score for each. This procedure gives us a sample of size *N* from the null distribution of the optimal query–target match score (conditioned on the given query as well as on the target length). If *N* is sufficiently large, then the derived empirical distribution can be used to assign a *P*-value for the observed match score.

Note that while generating a null target motif of a specified length can be done through rejection—reject any path that does not end at state T at step *|T|+*2—a more efficient sampling can be achieved by conditioning on the last event (0, ). See Section 2 in Supplementary Material for more details.

## 5 RESULTS

In this section, we compare the performance of various combinations of methods for selecting an optimal query–target alignment with methods for assigning an overall motif *P*-value. Each such ‘target function’ (alignment-selection and motif *P*-value evaluation) is assessed with respect to two criteria: reduction of uninformative alignments and retrieval accuracy. We begin with the former criterion.

### 5.1 Reduction of uninformative alignments

To keep our benchmarks realistic, we chose to study the number of uninformative alignments in the context of a real motif database: the mouse PBM database consisting of 386 motifs (Newburger and Bulyk, 2009). In summary, for each target function we noted the percentage of uninformative alignments among all significant alignments reported when the mouse PBM database was queried against itself.

We define an alignment as uninformative if all the aligned columns of both the query and the target have an information content less than 0.5. An alignment is called significant if its *P*-value is less than a pre-determined false positive rate (FPR). In Supplementary Figure S4, we compare the performance of several target functions by plotting the percentage of uninformative alignments out of all significant alignments as we vary the significance threshold.
Table 2 provides a similar comparison of the ability of several target functions to filter out uninformative alignments only with the significance threshold fixed at the canonical FPR of 0.05.

The results show that there is a drastic reduction in the percentage of uninformative alignments when the optimal alignment is selected using complete scores, regardless of which column similarity score or overall *P*-value method is used. This effect is most readily observable in Table 2, where we can see a reduction in uninformative alignments from 22.9% for Tomtom using ED to nearly zero uninformative alignments for any complete score.

How much reduction do we get by replacing Tomtom's iid target null model with the more complex HMM? To gauge that we kept the ED similarity score but used MC sampling from the HMM to estimate the offset, or alignment specific, *P*-values. Then, selecting the alignment with the optimal *P*-value we estimated the overall *P*-value again using MC sampling from the HMM. The result shows that while the HMM generates a substantial reduction in the percentage of uninformative alignments (down from 22.9% to 13.7%), it is far less striking than the reduction obtained by using any of the complete scores.

The performance of the ALLR score merits some discussion as it is significantly more effective at filtering out uninformative alignments (6.2%) than any of the other column similarity scores Tomtom offers. Consistently, ALLR is the only such non-complete column similarity score which *can* differentiate between perfect alignments of informative and of uninformative columns. Still, when ALLR is compared with any of the complete scores, including a complete-ALLR, the results show that there is room for further reduction in the number of uninformative alignments. This observation is not only a benchmark issue. The same uninformative alignment depicted in Figure 2 comes up as significant when using the ALLR, but is not reported as such if either complete-ED or complete-ALLR are used.

### 5.2 Retrieval accuracy results

To study the retrieval accuracy of the various combinations that make our target functions, we adopted a framework inspired by the ones used in Habib *et al.* (2008) and in Gupta *et al.* (2007). The general idea is to repeatedly sample motifs from the database to create a query database and then quantify, using each of the studied target functions, how many queries are correctly paired with the target motif from which they were sampled.

While the details of our experimental setup are given below, Table 2 summarizes the retrieval accuracy of all the target functions we consider. The table shows that all the methods yield a very high mean AUC (area under the receiver operating characteristic, or ROC, curve), so there is little to choose from in that sense. This observation is consistent with the results reported in Gupta *et al.* (2007). Having said that, we note that all the methods that use MC sampling to estimate the *P*-values have a slightly lower mean AUC. This is most evident in the decline of mean AUC when using MC sampling versus the DP computation to estimate the *P*-values of alignments selected using complete-ED: mean AUC of 0.9791 and 0.9994, respectively (rows 8 and 9). See more on this in Section 6.

The specific experimental design is as follows. We randomly select from the mouse PBM database 80 motifs which will serve as templates for generating randomized queries of the same width *w* as that of the template motif. Each randomized query is generated by first setting the number of sites, *N*, to 5, then 10 and then 20. Then, each of the *w* columns of the template motif PWM is associated with a Dirichlet distribution on ^{4} parameterized by the vector obtained from multiplying the column's frequencies by *N*. We then sample each column of the randomized query from the corresponding Dirichlet distribution.

We further add variation to these motifs by varying the ‘coverage’ of the sites. Specifically, we either take the full site or remove up to 0.3*w* columns from a randomly chosen end of the motif. The number of columns to be removed and which end to remove it from are chosen uniformly. Finally, we add additional noise to some of the query motifs by either adding an informative column for motifs with full sites or adding 1 or 3 uninformative columns at an end of a motif that was not previously truncated. This process yields a total of 1680 motifs to query against the target of the mouse PBM database.

For each query motif, we rank the target motifs according to the overall *P*-value of their match to the query. The query–target pairs that are from the same motif are labeled ‘true’, and those that are not from the same motif are marked ‘false’. A ROC curve plots the fraction of the true positive pairs as a function of the fraction of false positive pairs. The area under this curve (AUC) corresponds to the probability that a score function will rank a randomly chosen positive pair higher than a randomly chosen negative pair. A perfect score function will have an AUC of 1.0, whereas a random score function will have an AUC of 0.5. The AUC is calculated for each query motif against the target database, and the mean AUC (over all queries) is reported in Table 2 for different score functions.

We repeated a similar experiment using the TRANSFAC database (see Section 5 in Supplementary Material). The findings there largely repeat the ones observed in the mouse data: for each of Tomtom's similarity scores, the retrieval accuracy of our complete version combined with the DP-computed *P*-values is essentially the same as that of Tomtom. At the same time, using MC methods to estimate the *P*-value slightly compromises the retrieval accuracy.

The experiments above were asymmetric in that mostly the query motifs were randomly missing key motif columns (by truncation). In addition, the query motifs were generated by sampling columns using a Dirichlet distribution. Therefore, to broaden the scope of the tests of our complete scores we designed an additional set of experiments where (i) we generated queries by sampling sites and (ii) to simulate cases where the target motifs miss a growing number of key columns of the motif, but without resorting to truncation which would create artificially short target motifs, we added an increasing number of randomly selected target database columns to the query motifs. The precise protocol and the results are described in Section 6 in Supplementary Material. Qualitatively, we noticed that as the percentage of added query columns was increased from 10% to 100%, the complete scores showed very little loss in retrieval accuracy when compared with the raw scores. More precisely, for the experiments using the mouse PBM and TRANSFAC databases, the loss was negligible throughout the entire range, whereas for experiments based on the MacIsaac yeast database, the loss was negligible when no >50% columns were added to the query and increased after that to ~1% loss in mean AUC when adding up to 100% columns. See Section 6 below for further analysis.

## 6 DISCUSSION

Habib *et al.* (2008) offered a possible explanation for the phenomenon of uninformative alignments, wherein a motif database search tool such as Tomtom reports as significant an alignment consisting of uninformative columns. They pointed out that most similarity scores do not distinguish between good alignments of informative and of uninformative columns.

Habib *et al.* then introduced the BLiC score to address this issue. Our analysis shows that while the BLiC score is effective at reducing the number of uninformative alignments, it can significantly reduce the retrieval accuracy. While one can design post-processing tools to filter out uninformative alignments, we preferred the more principled approach in the spirit of Habib *et al.* This is not only a question of elegance and deeper understanding of the issues; indeed, post-processing tools tend to compromise the statistical significance analysis in a way that is very difficult to fix. Therefore, we tested a two-pronged approach to reducing the number of uninformative alignments: by modifying the way, we select the optimal query–target alignment, and by testing with respect to a more sophisticated null model.

The evidence presented above indicates that our initially designed two-pronged approach is somewhat of an overkill. Indeed, our general approach to selecting the optimal alignment using complete scores (3) has proven quite effective on its own at removing uninformative alignments for all similarity scores we looked at. At the same time, the new version of Tomtom that uses the complete scores exhibits a retrieval accuracy which is essentially as good as the original method employed by Tomtom (see comment below) with no significant runtime penalty. Taken together, our new recommended settings for Tomtom is to use the new `–complete-scores` option available in the MEME Suite. More generally, our complete scores can in principle assist any motif database search tool, which uses a linear similarity score (2), to reduce the number of uninformative alignments.

The complete scores exhibit negligible loss or indeed some gain in retrieval accuracy when applied to reasonably well curated databases where the target motifs do not lack more than a third of the motif columns. Even when the database motifs were simulated to be missing up to 50% of the motif columns the complete score's loss of retrieval accuracy was negligible when we used the mouse PBM and TRANSFAC. A similar experiment at this extreme setting but using the MacIsaac yeast database showed a loss of 1% in retrieval accuracy. There are a couple of possible explanations for this difference. First, the yeast database is significantly smaller than the other two: 1218 columns in total versus 6295 (mouse PBM) and 10 642 (TRANSFAC). Because we estimate from the target database the significance as well as the medians that are crucial for the complete scores, a significantly smaller database implies a much larger variability in the results. Second, the median motif length of the yeast database is 9, whereas it is 16 for the mouse PBM data and 12 for TRANSFAC. Again, the smaller motif length could imply more variability when testing for partial matching.

We were puzzled by the slight decline in retrieval accuracy when using the more sophisticated HMM, when compared with the iid model (Table 2). One possible explanation lies in the MC simulations which we use to evaluate the *P*-value under the null HMM. Indeed, when we increased the number of MC simulations per target motif from 1000 to 10 000 we observed an increase in retrieval accuracy (mean AUC of 0.9785 to mean AUC of 0.9869 under the same experiment described in Section 2 using HMM *P*-values for complete-ED).

Furthermore, we compared the retrieval accuracy of the complete scores (3) combined with the iid null target model with *P*-values computed in two different ways: using MC simulations versus using the DP approach described in Section 4. In this case, the DP computed *P*-values consistently demonstrated better retrieval accuracy than the MC generated *P*-values (using 10 000 samples). If we can make the leap of faith that a similar principle is at work for the null HMM, then that would again point to the MC sampled *P*-values as the cause of the inferior retrieval performance of the HMM compared with the iid model.

Finally, on this issue, we suspect that ties, in particular, compromise the power of MC sampled *P*-values. Using 10 000 samples to evaluate the *P*-values, we observed a non-negligible number of cases where the selected target motif shared the same *P*-value with a few other target motifs.^{5} Our analysis showed that, had all these ties been broken in favor of the correct target, then the retrieval accuracy would have been at least as good as Tomtom's.

The HMM described in Figure 4 proved redundant here: its retrieval accuracy was slightly lower when compared with the complete scores or the raw scores, and the MC significance evaluation made it significantly slower as well. As explained in detail above, we believe that we could address both drawbacks by developing a DP algorithm to compute the significance under the HMM null model. However, currently, we are not motivated to design such an algorithm because the complete score achieved our stated goal. We might revisit this issue in the future. For example, in order to effectively apply the complete score one must verify, as in Table 1, that the median null score of an uninformative column is higher than the median of an informative column. While we cannot at the moment imagine a scoring system for which that would not be the case, one could still use the HMM for such a score. Similarly, the experiments with the MacIsaac yeast motif database suggest that when querying against a rather small database that includes many motifs that are missing a significant number of key columns, there is a small price to pay when using the complete scores.

The complete scores defined in (3) assign the median of the null target column similarity score to each unaligned column. This approach is akin to randomly selecting a target column to align to the unaligned query column. We considered quantiles other than the median, and we found that both in terms of reducing uninformative alignments and in terms of retrieval accuracy the method is quite robust to the exact value of the quantile (Section 4 in Supplementary Material).

Finally, the ALLR score is unique among the (incomplete or raw) column similarity scores considered here in the sense that it can differentiate between perfect matches of informative and of uninformative columns. Undoubtedly, this property contributes to the ALLR score being the most effective at filtering out uninformative alignments. Still, as we showed, any complete score (including complete-ALLR) does a significantly better job at removing such alignments. Moreover, our findings and to a larger extent the ones in Gupta *et al.* (2007) show that ALLR is not optimal as far as retrieval accuracy is concerned.

## ACKNOWLEDGEMENT

We are grateful to the anonymous referees for their comments and suggestions which greatly improved the manuscript.

*Funding*: ARC Centre of Excellence in Bioinformatics (to T.L.B.); National Institutes of Health award (R01 RR021692).

*Conflict of Interest*: none declared.

## Footnotes

^{1}Throughout this article, we reserve the term *uninformative alignment* for such an alignment of uninformative columns.;

^{2}Selecting the optimal alignment based on the offset *P*-value for the complete score yields *exactly* the same alignment as the one selected by Tomtom.;

^{3}More precisely, the complexity of computing the new significance evaluation only changes by a constant factor, and, in practice, we did not perceive any significant change in the runtime in any of our tests.;

^{4}In Tomtom;

^{5}In which case, we ranked the target motifs based on the complete score.;

## REFERENCES

- Crooks G, et al. Weblogo: a sequence logo generator. Genome Res. 2004;14:1188–1190. [PMC free article] [PubMed]
- Das M, Dai HK. A survey of DNA motif finding algorithms. BMC Bioinformatics. 2007;8(Suppl. 7):S21. [PMC free article] [PubMed]
- Durbin R, et al. Biological Sequence Analysis. Cambridge University Press, New York: 1998.
- Gupta S, et al. Quantifying similarity between motifs. Genome Biol. 2007;8:R24. [PMC free article] [PubMed]
- Habib N, et al. A novel Bayesian DNA motif comparison method for clustering and retrieval. PLoS Comput. Biol. 2008;4:e1000010. [PMC free article] [PubMed]
- MacIsaac KD, et al. An improved map of conserved regulatory sites for Saccharomyces cerevisiae. BMC Bioinformatics. 2006;7:113. [PMC free article] [PubMed]
- Mahony S, Benos PV. STAMP: a web tool for exploring DNA-binding motif similarities. Nucleic Acids Res. 2007;35:W253–W258. [PMC free article] [PubMed]
- Newburger DE, Bulyk ML. UniPROBE : an online database of protein binding microarray data on protein – DNA interactions. Nucleic Acids Res. 2009;37(Suppl. 1):D77–D82. [PMC free article] [PubMed]
- Piipari M, et al. Metamotifs–a generative model for building families of nucleotide position weight matrices. BMC Bioinformatics. 2010;11:348. [PMC free article] [PubMed]
- Portales-Casamar E, et al. JASPAR 2010: the greatly expanded open-access database of transcription factor binding profiles. Nucleic Acids Res. 2010;38(Suppl. 1):D105–D110. [PMC free article] [PubMed]
- Sandelin A, Wasserman WW. Constrained binding site diversity within families of transcription factors enhances pattern discovery bioinformatics. J. Mol. Biol. 2004;338:207–215. [PubMed]
- Schneider TD, Stephens RM. Sequence logos: a new way to display consensus sequences. Nucleic Acids Res. 1990;18:6097–6100. [PMC free article] [PubMed]
- Stormo G. DNA binding sites: representation and discovery. Bioinformatics. 2000;16:16–23. [PubMed]
- Tompa M, et al. Assessing computational tools for the discovery of transcription factor binding sites. Nat. Biotechnol. 2005;23:137–144. [PubMed]
- Wingender E, et al. TRANSFAC: an integrated system for gene expression regulation. Nucleic Acids Res. 2000;28:316–319. [PMC free article] [PubMed]
- Xing EP, Karp RM. Motifprototyper: a Bayesian profile model for motif families. Proc. Natl Acad. Sci. USA. 2004;101:10523–10528. [PMC free article] [PubMed]

**Oxford University Press**

## Formats:

- Article |
- PubReader |
- ePub (beta) |
- PDF (347K)

- MEME SUITE: tools for motif discovery and searching.[Nucleic Acids Res. 2009]
*Bailey TL, Boden M, Buske FA, Frith M, Grant CE, Clementi L, Ren J, Li WW, Noble WS.**Nucleic Acids Res. 2009 Jul; 37(Web Server issue):W202-8. Epub 2009 May 20.* - MEME-ChIP: motif analysis of large DNA datasets.[Bioinformatics. 2011]
*Machanick P, Bailey TL.**Bioinformatics. 2011 Jun 15; 27(12):1696-7. Epub 2011 Apr 12.* - Quantifying similarity between motifs.[Genome Biol. 2007]
*Gupta S, Stamatoyannopoulos JA, Bailey TL, Noble WS.**Genome Biol. 2007; 8(2):R24.* - A novel Bayesian DNA motif comparison method for clustering and retrieval.[PLoS Comput Biol. 2008]
*Habib N, Kaplan T, Margalit H, Friedman N.**PLoS Comput Biol. 2008 Feb 29; 4(2):e1000010. Epub 2008 Feb 29.* - A survey of DNA motif finding algorithms.[BMC Bioinformatics. 2007]
*Das MK, Dai HK.**BMC Bioinformatics. 2007 Nov 1; 8 Suppl 7:S21. Epub 2007 Nov 1.*

- Cytosine methylation changes in enhancer regions of core pro-fibrotic genes characterize kidney fibrosis development[Genome Biology. 2013]
*Ko YA, Mohtat D, Suzuki M, Park AS, Izquierdo MC, Han SY, Kang HM, Si H, Hostetter T, Pullman JM, Fazzari M, Verma A, Zheng D, Greally JM, Susztak K.**Genome Biology. 2013; 14(10)R108* - An improved predictive recognition model for Cys2-His2 zinc finger proteins[Nucleic Acids Research. 2014]
*Gupta A, Christensen RG, Bell HA, Goodwin M, Patel RY, Pandey M, Enuameh MS, Rayla AL, Zhu C, Thibodeau-Beganny S, Brodsky MH, Joung JK, Wolfe SA, Stormo GD.**Nucleic Acids Research. 2014 Apr; 42(8)4800-4812* - De novo prediction of DNA-binding specificities for Cys2His2 zinc finger proteins[Nucleic Acids Research. 2014]
*Persikov AV, Singh M.**Nucleic Acids Research. 2014 Jan; 42(1)97-108* - Assessment of Algorithms for Inferring Positional Weight Matrix Motifs of Transcription Factor Binding Sites Using Protein Binding Microarray Data[PLoS ONE. ]
*Orenstein Y, Linhart C, Shamir R.**PLoS ONE. 7(9)e46145* - DBD2BS: connecting a DNA-binding protein with its binding sites[Nucleic Acids Research. 2012]
*Chien TY, Lin CK, Lin CW, Weng YZ, Chen CY, Chang DT.**Nucleic Acids Research. 2012 Jul; 40(Web Server issue)W173-W179*

- Gene (nucleotide)Gene (nucleotide)Records in Gene identified from shared sequence links
- NucleotideNucleotidePublished Nucleotide sequences
- PubMedPubMedPubMed citations for these articles