## Abstract

### Background

Motif searching is an important step in the detection of rare events occurring in a set of DNA or protein sequences. One formulation of the problem is known as (*l*,*d*)-motif search or Planted Motif Search (PMS). In PMS we are given two integers *l* and *d* and *n* biological sequences. We want to find all sequences of length *l* that appear in each of the input sequences with at most *d* mismatches. The PMS problem is NP-complete. PMS algorithms are typically evaluated on certain instances considered challenging. Despite ample research in the area, a considerable performance gap exists because many state of the art algorithms have large runtimes even for moderately challenging instances.

### Results

This paper presents a fast exact parallel PMS algorithm called PMS8. PMS8 is the first algorithm to solve the challenging (*l*,*d*) instances (25,10) and (26,11). PMS8 is also efficient on instances with larger *l* and *d* such as (50,21). We include a comparison of PMS8 with several state of the art algorithms on multiple problem instances. This paper also presents necessary and sufficient conditions for 3 *l*-mers to have a common *d*-neighbor. The program is freely available at http://engr.uconn.edu/~man09004/PMS8/.

### Conclusions

We present PMS8, an efficient exact algorithm for Planted Motif Search. PMS8 introduces novel ideas for generating common neighborhoods. We have also implemented a parallel version for this algorithm. PMS8 can solve instances not solved by any previous algorithms.

### Similar content being viewed by others

## Background

This paper presents an efficient exact parallel algorithm for the Planted Motif Search (PMS) problem also known as the (*l*,*d*) motif problem [1]. A string of length *l* is caller an *l*-mer. The number of positions where two *l*-mers *u* and *v* differ is called their Hamming distance and is denoted by *H* *d*(*u*,*v*). For any string *T*, *T*[ *i*..*j*] is the substring of *T* starting at position *i* and ending at position *j*. The PMS problem is the following. Given *n* sequences *S*_{1},*S*_{2},…,*S*_{
n
} of length *m* each, from an alphabet *Σ* and two integers *l* and *d*, identify all *l*-mers *M*,*M*∈*Σ*^{l}, that occur in at least one location in each of the *n* sequences with a Hamming distance of at most *d*. More formally, *M* is a motif if and only if ∀*i*,1≤*i*≤*n*,∃*j*_{
i
},1≤*j*_{
i
}≤*m*-*l*+1, such that *H* *d*(*M*,*S*_{
i
}[*j*_{
i
}..*j*_{
i
}+*m*-1])≤*d*.

The PMS problem is essentially the same as the Closest Substring problem. These problems have applications in PCR primer design, genetic probe design, discovering potential drug targets, antisense drug design, finding unbiased consensus of a protein family, creating diagnostic probes and motif finding (see e.g., [2]). Therefore, efficient algorithms for solving the PMS problem are very important in biology and bioinformatics.

A PMS algorithm that finds all the motifs for a given input is called an exact algorithm. All known exact algorithms have an exponential worst case runtime because the PMS problem is NP-complete [2]. An exact algorithm can be built using two approaches. One is sample driven: for all (*m*-*l*+1)^{n} possible combinations of *l*-mers coming from different strings, generate the common neighborhood. The other is pattern-driven: for all *Σ*^{l} possible *l*-mers check which are motifs. Many algorithms employ a combination of these two techniques. For example, [3] and [4] generate the common neighbors for every pair of *l*-mers coming from two of the input strings. Every neighbor is then matched against the remaining *n*-2 input strings to confirm or reject it as a motif. Other algorithms ([5, 6]) consider groups of three *l*-mers instead of two.

PMS algorithms are typically tested on instances generated as follows (also see [1, 4]): 20 DNA strings of length 600 are generated according to the i.i.d. (independent identically distributed) model. A random *l*-mer is chosen as a motif and planted at a random location in each input string. Every planted instance is modified in at most *d* positions. For a given integer *l*, the instance (*l*,*d*) is defined to be challenging if *d* is the smallest integer for which the expected number of motifs of length *l* that occur in the input by random chance is ≥1. Some of the challenging instances are (13,4),(15,5),(17,6),(19,7),(21,8),(23,9),(25,10), (26,11), etc.

The largest challenging instance solved up to now has been (23,9). To the best of our knowledge the only algorithm to solve (23,9) has been qPMS7 [5]. The algorithm in [7] can solve instances with relatively large *l* (up to 48) provided that *d* is at most *l*/4. However, most of the well known challenging instances have *d*>*l*/4. PairMotif [3] can solve instances with larger *l*, such as (27,9) or (30,9), but these are significantly less challenging than (23,9). Furthermore, for instances that current algorithms have been able to solve, the runtimes are often quite large.

In this paper we propose a new exact algorithm, PMS8, which can efficiently solve both instances with large *l* and instances with large *d*. The efficiency of PMS8 comes mainly from reducing the search space by using the pruning conditions presented later in the paper, but also from a careful implementation which utilizes several speedup techniques and emphasizes cache locality.

One of the basic steps employed in many PMS algorithms (such as PMSprune [4], PMS5 [8], PMS6 [9], and qPMS7 [5]) is that of computing all the common neighbors of three *l*-mers. In qPMS7, this problem is solved using an Integer Linear Programming (ILP) formulation. In particular, a large number of ILP instances are solved as a part of a preprocessing step and a table is populated. This table is then repeatedly looked up to identify common neighbors of three *l*-mers. This preprocessing step takes a considerable amount of time and the lookup table calls for a large amount of memory. In this paper we offer a novel algorithm for computing all the common neighbors of three *l*-mers. This algorithm eliminates the preprocessing step. In particular, we don’t solve any ILP instance. We also don’t employ any lookup tables and hence we reduce the memory usage. We feel that this algorithm will find independent applications. Specifically, we state and prove necessary and sufficient conditions for 3 *l*-mers to have a common neighbor.

## Methods

For any *l*-mer *u* we define its *d*-neighborhood as the set of *l*-mers *v* for which *H* *d*(*u*,*v*)≤*d*. For any set of *l*-mers *T* we define the common *d*-neighborhood of *T* as the intersection of the *d*-neighborhoods of all *l*-mers in *T*. To compute common neighborhoods, a natural approach is to traverse the tree of all possible *l*-mers and identify the common neighbors. A pseudocode is given in Appendix 1. A node at depth *k*, which represents a *k*-mer, is not explored deeper if certain pruning conditions are met. Thus, the better the pruning conditions are, the faster will be the algorithm. We discuss pruning conditions in a later section.

PMS8 consists of a sample driven part followed by a pattern driven part. In the sample driven part we generate tuples of *l*-mers originating from different strings. In the pattern driven part we generate the common *d*-neighborhood of such tuples. Initially we build a matrix *R* of size *n*×(*m*-*l*+1) where row *i* contains all the *l*-mers in *S*_{
i
}. We pick an *l*-mer *x* from row 1 of *R* and push it on a stack. We filter out any *l*-mer in *R* at a distance greater than 2*d* from *x*. Then we pick an *l*-mer from the second row of *R* and push it on the stack. We filter out any *l*-mer in *R* that does not have a common neighbor with the *l*-mers on the stack; then we repeat the process. If any row becomes empty, we discard the top of the stack, revert to the previous instance of *R* and try a different *l*-mer. If the stack size is above a certain threshold (see section on Memory and Runtime) we generate the common *d*-neighborhood of the *l*-mers on the stack. For each neighbor *M* we check whether there is at least one *l*-mer *u* in each row of *R* such that *H* *d*(*M*,*u*)≤*d*. If this is true then *M* is a motif. The pseudocode of PMS8 is given in Appendix 1.

A necessary and sufficient condition for 3 *l*-mers to have a common neighbor is discussed in the section on pruning conditions. For 4 or more *l*-mers we only have necessary conditions, so we may generate tuples that will not lead to solutions. However, due to the way the filtering works, the following observations apply. Let the stack at any one time contain *t* *l*-mers: *r*_{1},*r*_{2},…,*r*_{
t
} where *r*_{
t
} is at the top of the stack. Evidently, the *l*-mers on the stack pass the necessary pruning conditions for *t* *l*-mers. However, the following are also true. For any two *l*-mers *r*_{
i
} and *r*_{
j
} on the stack, there exists a common neighbor. This is true because whenever we filter an *l*-mer we make sure it has at least one neighbor in common with the *l*-mer at the stop of the stack. Thus, we can prove by induction that any two *l*-mers in the stack have a common neighbor. Second, any triplet of the form *r*_{1},*r*_{2},*r*_{
i
}, 2<*i*≤*t*, has at least one common neighbor. This is true because when the stack had only the first two *l*-mers we filtered out any *l*-mer which doesn’t make a compatible triplet with the two. In general, for any number *p*<*t* the (*p*+1) tuples of the form *r*_{1},*r*_{2},…,*r*_{
p
},*r*_{
i
} where *p*<*i*≤*t* must pass the pruning conditions for *p*+1*l*-mers. Therefore, even though the pruning for more than 3 *l*-mers is not perfect, the algorithm implicitly tests the pruning conditions on many subsets of the *l*-mers in the stack and thus decreases the number of false positive tuples generated.

### Speedup techniques

#### Sort rows by size

An important speedup technique is to reorder the rows of *R* by size after every filtering step. This reduces the number of tuples that we consider at lower stack sizes. These tuples require the most expensive filtering because as the stack size increases, fewer *l*-mers remain to be filtered.

#### Compress *l*-mers

We can speed up Hamming distance operations by compressing all the l-mers of *R* in advance. For example, for DNA we store 8 characters in a 16 bit integer, divided into 8 groups of 2 bits. For every 16 bit integer *i* we store in a table the number of non-zero groups of bits in *i*. To compute the Hamming distance between two *l*-mers we first perform an exclusive or of their compressed representations. Equal characters produce bits of 0, different characters produce non-zero bits. Therefore, one table lookup provides the Hamming distance for 8 characters. One compressed *l*-mer requires *l*∗⌈log|*Σ*|⌉ bits of storage. However, we only need the first 16 bits of this representation because the next 16 bits are the same as the first 16 bits of the *l*-mer 8 positions to the right of the current one. Therefore, the table of compressed *l*-mers only requires *O*(*n*(*m*-*l*+1)) words of memory.

#### Preprocess distances for pairs of *l*-mers

The filtering step tests many times if two *l*-mers have a distance of no more than 2*d*. Thus, for every pair of *l*-mers we compute this bit of information in advance.

#### Cache locality

We can update *R* in an efficient manner as follows. Every row in the updated matrix *R*^{′} is a subset of the corresponding row in the current matrix *R*, because some elements will be filtered out. Therefore, we can store *R*^{′} in the same memory locations as *R*. To do this, in each row, we move the elements belonging to *R*^{′} at the beginning of the row. In addition, we keep track of how many elements belong to *R*^{′}. To revert from *R*^{′} back to *R*, we restore the row sizes to their previous values. The row elements will be the same even if they have been moved within the row. The same process can be repeated at every step of the recursion, therefore the whole “stack” of *R* matrices is stored in a single matrix. This reduces the memory requirement and improves cache locality. The cache locality is improved because at every step of the recursion, in each row, we access a subset of the elements we accessed in the previous step, and those elements are in contiguous locations of memory.

#### Find motifs for a subset of the strings

We use the speedup technique described in [10]: compute the motifs for *n*^{′}<*n* of the input strings, then test each of them against the remaining *n*-*n*^{′} strings. For the results in this paper *n*^{′} was heuristically computed using the formula provided in Appendix 1.

### Memory and Runtime

Since we store all matrices *R* in the space of a single matrix they only require *O*(*n*(*m*-*l*+1)) words of memory. To this we add *O*(*n*^{2}) words to store row sizes for the at most *n* matrices which share the same space. The bits of information for compatible *l*-mer pairs take *O*((*n*(*m*-*l*+1))^{2}/*w*) words, where *w* is the number of bits in a machine word. The table of compressed *l*-mers takes *O*(*n*(*m*-*l*+1)) words. Therefore, the total memory used by the algorithm is *O*(*n*(*n*+*m*-*l*+1)+(*n*(*m*-*l*+1))^{2}/*w*).

The more time we spend in the sample driven part, the less time we have to spend in the pattern driven part and vice-versa. Ideally we want to choose the threshold where we switch between the two parts such that their runtimes are almost equal. The optimal threshold can be determined empirically by running the algorithm on a small subset of the tuples. In practice, PMS8 heuristically estimates the threshold *t* such that it increases with *d* and |*Σ*| to avoid generating very large neighborhoods and it decreases with *m* to avoid spending too much time on filtering. All the results reported in this paper have been obtained using the default threshold estimation provided in Appendix 1.

### Parallel implementation

We can think of *m*-*l*+1 independent sub problems, one for each *l*-mer in the first string. The first string in each sub problem is an *l*-mer of the original first string and the rest of the strings are the same as in the original input. Because of this, the problem seems to be “embarrassingly parallel.” A straightforward parallelization idea is to assign an equal number of subproblems to each processor. This method has the advantage that no inter-processor communication is necessary beyond broadcasting the input to all processors. This method would work well for algorithms where each subproblem is expected to have a similar runtime. However, for PMS8, the runtime of each subproblem is very sensitive to the size of the neighborhoods for various combinations of *l*-mers and therefore some processors may end up starving while others are still busy.

To alleviate the above shortcoming we employ the following strategy. The processor with rank 0 is a scheduler and the others are workers. The scheduler spawns a separate worker thread to avoid using one processor just for scheduling. The scheduler reads the input and broadcasts it to all workers. Then each worker requests a sub problem from the scheduler, solves it and repeats. The scheduler loops until all jobs have been requested and all workers have been notified that no more jobs are available. At the end, all processors send their motifs to the scheduler. The scheduler loops through all the processors and collects the results. The scheduler then outputs the results.

### Pruning conditions

In this section we present pruning conditions applied for filtering *l*-mers in the sample driven part and for pruning enumeration trees in the pattern driven part.

Two *l*-mers *a* and *b* have a common neighbor *M* such that *H* *d*(*a*,*M*)≤*d*_{
a
} and *H* *d*(*b*,*M*)≤*d*_{
b
} if and only if *H* *d*(*a*,*b*)≤*d*_{
a
}+*d*_{
b
}. For 3 *l*-mers, no trivial necessary and sufficient conditions have been known up to now. In [8] sufficient conditions for 3 *l*-mers are obtained from a preprocessed table. However, as *l* increases the memory requirement of the table becomes a bottleneck. We will give simple necessary and sufficient conditions for 3 *l*-mers to have a common neighbor. These conditions are also necessary for more than 3 *l*-mers.

Let *T* be a set of *l*-mers and *M* be an *l*-mer. If ∑*u*∈*T* *H* *d*(*M*,*u*)>|*T*|*d* then, by the pigeonhole principle, one *l*-mer must have a distance from *M* greater than *d*. Therefore, *M* cannot be a common neighbor of the *l*-mers in *T*. If we have a lower bound on ∑*u*∈*T* *H* *d*(*M*,*u*) for any *M*, then we can use it as a pruning condition. If the lower bound is greater than |*T*|*d* then there is no common neighbor for *T*. One such lower bound is the *consensus total distance*.

#### Definition 1

Let *T* be a set of *l*-mers, where *k*=|*T*|. For every *i*, the set *T*_{1}[*i*],*T*_{2}[*i*],..,*T*_{
k
}[*i*] is called the *i*-th column of *T*. Let *m*_{
i
} be the maximum frequency of any character in column *i*. Then *C* *d*(*T*)= ∑*i*=1..*l* *k*-*m*_{
i
} is called the consensus total distance of *T*.

The consensus total distance is a lower bound for the total distance between any *l*-mer *M* and the *l*-mers in *T* because, regardless of *M*, the distance contributed by column *i* to the total distance is at least *k*-*m*_{
i
}. The consensus total distance for a set of two *l*-mers *A* and *B* will be denoted by *C* *d*(*A*,*B*). Also notice that *C* *d*(*A*,*B*)=*H* *d*(*A*,*B*). We can easily prove the following lemma.

#### Lemma 1

Let *T* be a set of *l*-mers and *k*=|*T*|. Let *d*_{1},*d*_{2},…*d*_{
k
} be non-negative integers. There exists a *l*-mer *M* such that *H* *d*(*M*,*T*_{
i
})≤*d*_{
i
},∀*i*, only if \mathit{\text{Cd}}\left(T\right)\le {\Sigma}_{i=1}^{k}{d}_{i}.

#### Theorem 1

Let *T* be a set of 3 *l*-mers and *d*_{1},*d*_{2},*d*_{3} be non-negative integers. There exists a *l*-mer *M* such that *H* *d*(*M*,*T*_{
i
})≤*d*_{
i
},∀*i*,1≤*i*≤3 if and only if the following conditions hold:

**i)** *C* *d*(*T*_{
i
},*T*_{
j
})≤*d*_{
i
}+*d*_{
j
},∀*i*,*j*,1≤*i*<*j*≤3

**ii)** *C* *d*(*T*)≤*d*_{1}+*d*_{2}+*d*_{3}

#### Proof

The “only if” part follows from lemma 1.

For the “if” part we show how to construct a common neighbor *M* provided that the conditions hold. We say that a column *k* where *T*_{1}[ *k*]=*T*_{2}[ *k*]=*T*_{3}[ *k*] is of type *N*_{0}. If *T*_{1}[ *k*]≠*T*_{2}[*k*]=*T*_{3}[ *k*] then the column is of type *N*_{1}. If *T*_{1}[ *k*]=*T*_{3}[ *k*]≠*T*_{2}[ *k*] the column is of type *N*_{2} and if *T*_{1}[ *k*]=*T*_{2}[ *k*]≠*T*_{3}[ *k*] then the column is of type *N*_{3}. If all three characters in the column are distinct, the column is of type *N*_{4}. Let *n*_{
i
},∀*i*,0≤*i*≤4 be the number of columns of type *N*_{
i
}. Consider two cases:

Case 1) There exists *i*,1≤*i*≤3 for which *n*_{
i
}≥*d*_{
i
}. We construct *M* as illustrated in Figure 1. Pick *d*_{
i
} columns of type *n*_{
i
}. For each chosen column *k* set *M*[ *k*]=*T*_{
j
}[ *k*] where *j*≠*i*. For all other columns set *M*[ *k*]=*T*_{
i
}[ *k*]. Therefore *C* *d*(*T*_{
i
},*M*)=*d*_{
i
}. For *j*≠*i* we know that *C* *d*(*T*_{
i
},*T*_{
j
})≤*d*_{
i
}+*d*_{
j
} from condition **i)** (condition **i** is assumed to be true at this point because we are proving the “if” part). We also know that *C* *d*(*T*_{
i
},*M*)+*C* *d*(*M*,*T*_{
j
})≤*C* *d*(*T*_{
i
},*T*_{
j
}) from the triangle inequality. It follows that *C* *d*(*M*,*T*_{
j
})≤*d*_{
j
}. Since *C* *d*(*M*,*T*_{
j
})=*H* *d*(*M*,*T*_{
j
}) it means that *M* is indeed a common neighbor of the three *l*-mers.

Case 2) For all *i*,1≤*i*≤3 we have *n*_{
i
}<*d*_{
i
}. We construct *M* as shown in Figure 2. For columns *k* of type *N*_{0},*N*_{2} and *N*_{3} we set *M*[ *k*]=*T*_{1}[ *k*]. For columns of type *N*_{1} we set *M*[ *k*]=*T*_{2}[ *k*]. For any *i*,1≤*i*≤3 the following applies. If *n*_{
i
}+*n*_{4}≤*d*_{
i
} then the Hamming distance between *M* and *T*_{
i
} is less than *d*_{
i
} regardless of what characters we choose for *M* in the columns of type *N*_{4}. On the other hand, if *n*_{
i
}+*n*_{4}>*d*_{
i
} then *M* and *T*_{
i
} have to match in at least *n*_{
i
}+*n*_{4}-*d*_{
i
} columns of type *N*_{4}. Thus, we pick *m* *a* *x*(0,*n*_{
i
}+*n*_{4}-*d*_{
i
}) columns of type *N*_{4} and for each such column *k* we set *M*[ *k*]=*T*_{
i
}[ *k*]. Now we prove that we actually have enough columns to make the above choices, in other words {\Sigma}_{i=1}^{3}\mathit{\text{max}}(0,{n}_{i}+{n}_{4}-{d}_{i})\le {n}_{4}. This is equivalent to the following conditions being true:

**a)**For any *i*,1≤*i*≤3 we want *n*_{
i
}+*n*_{4}-*d*_{
i
}≤*n*_{4}. This is true because *n*_{
i
}<*d*_{
i
}.

**b)**For any *i*,*j*,1≤*i*<*j*≤3 we want (*n*_{
i
}+*n*_{4}-*d*_{
i
})+(*n*_{
j
}+*n*_{4}-*d*_{
j
})≤*n*_{4}. This can be rewritten as *n*_{
i
}+*n*_{
j
}+*n*_{4}≤*d*_{
i
}+*d*_{
j
}. The left hand side is *H* *d*(*T*_{
i
},*T*_{
j
}) which we know is less or equal to *d*_{
i
}+*d*_{
j
}.

**c)**We want {\Sigma}_{i=1}^{3}{n}_{i}+{n}_{4}-{d}_{i}\le {n}_{4}. This can be rewritten as *n*_{1}+*n*_{2}+*n*_{3}+2*n*_{4}≤*d*_{1}+*d*_{2}+*d*_{3}. The left hand side is *C* *d*(*T*) which we know is less than *d*_{1}+*d*_{2}+*d*_{3}.

One of our reviewers kindly pointed out that the above proof is similar to an algorithm in [11].

## Results and discussion

PMS8 is implemented in C++ and uses OpenMPI for communication between processors. PMS8 was evaluated on the Hornet cluster in the Booth Engineering Center for Advanced Technology (BECAT) at University of Connecticut. The Hornet cluster consists of 64 nodes, each equipped with 12 Intel Xeon X5650 Westmere cores and 48 GB of RAM. The nodes use Infiniband networking for MPI. In our experiments we employed at most 48 cores on at most 4 nodes.

We generated random (*l*,*d*) instances according to [1] and as described in the introduction. For every (*l*,*d*) combination we report the average runtime over 5 random instances. For several challenging instances, in Figure 3 we present the speedup obtained by the parallel version over the single core version. For *p*=48 cores the speedup is close to *S*=45 and thus the efficiency is *E*=*S*/*p*=94*%*.

In Figure 4 we show the effect of the first speedup technique (sorthing rows by size) on the runtime. Note that all other speedups are enabled, only sorting rows by size is varied. The figure shows that sorting the rows by size improves the speed of PMS8 by 25% to 50%.

The runtime of PMS8 on instances with *l* up to 50 and *d* up to 21 is shown in Figure 5. Instances which are expected to have more than 500 motifs simply by random chance (spurious motifs) are excluded. The expected number of spurious motifs was computed as described in Appendix 1. Instances where *d* is small relative to *l* are solved efficiently using a single CPU core. For more challenging instances we report the time taken using 48 cores.

A comparison between PMS8 and qPMS7 [5] on challenging instances is shown in Table 1. Both programs have been executed on the Hornet cluster. qPMS7 is a sequential algorithm. PMS8 was evaluated using up to 48 cores. The speedup of PMS8 single core over qPMS7 is shown in Figure 6. The speedup is high for small instances because qPMS7 has to load an ILP table. For larger instances the speedup of PMS8 sharply increases. This is expected because qPMS7 always generates neighborhoods for tuples of 3 *l*-mers, which become very large as *l* and *d* grow. On the other hand, PMS8 increases the number of *l*-mers in the tuple with the instance size. With each *l*-mer added to the tuple, the size of the neighborhood reduces exponentially, whereas the number of neighborhoods generated increases by a linear factor. The ILP table precomputation requires solving many ILP formulations. The table then makes qPMS7 less memory efficient than PMS8. The peak memory used by qPMS7 for the challenging instances in Table 1 was 607 MB whereas for PMS8 it was 122 MB. Furthermore, due to the size of the ILP table, qPMS7 is not able to solve any instances where *l*>23. PMS8 is the first algorithm to solve the challenging instances (25,10) and (26,11).

Some recent results in the literature have also focused on instances other than the challenging ones presented above. A summary of these results and a comparison with PMS8 is presented in Table 2, starting with the most recent results. These results have been obtained on various types of hardware: single core, multi-core, GPU, grid. In the comparison, we try to match the number of processors whenever possible. The speed difference is of several orders of magnitude in some cases which indicates that the pruning conditions employed by PMS8 exponentially reduce the search space compared to other algorithms.

We also compared PMS8 with qPMS7 on the real datasets discussed in [20]. We excluded datasets with less than 4 input sequences because these are not very challenging. For each dataset we chose two combinations of *l* and *d*. These combinations were chosen on a dataset basis because for large values of *d* the number of reported motifs is excessive and for small values of *d* the instance is not very challenging. To make qPMS7 behave like PMS8 we set the quorum percent to 100% (*q*=*n*). In Table 3 we report the dataset name, the total number of sequences, the total number of bases in each dataset, the *l* and *d* combination and the runtimes of the two algorithms. Note that both algorithms are exact algorithms and therefore the sensitivity and specificity are the same. Similar to the comparison on synthetic data, the comparison on real data reveals that PMS8 outperforms qPMS7.

## Conclusions

We have presented PMS8, an efficient algorithm for the PMS problem. PMS8 is able to efficiently generate neighborhoods for *t* *l*-mers at a time, by using the pruning conditions presented in this paper. Previous algorithms generate neighborhoods for only up to three *l*-mers at a time whereas in PMS8 the value of *t* is increased as the instances become more challenging and therefore the exponential explosion is postponed. The second reason for the efficiency of PMS8 comes from the careful implementation which employs several speedup techniques and emphasizes cache locality.

## Appendix

### Appendix 1 Generating neighborhoods

**Algorithm 1. GenerateNeighborhood**(*T*,*d*)

### Appendix 2 PMS8 pseudocode

**Algorithm 2. PMS8**(*T*,*d*)

### Appendix 3 Challenging instances

For a fixed *l*, as *d* increases, the instance becomes more challenging. However, as *d* increases, the number of false positives also increases, because many motifs will appear simply by random chance. The expected number of spurious motifs in a random instance can be estimated as follows (see e.g., [4]). The number of *l*-mers in the neighborhood of a given *l*-mer *M* is N(\Sigma ,l,d)={\Sigma}_{i=0}^{d}{(}_{d}^{l}){\left(\right|\Sigma |-1)}^{d}. The probability that *M* is a *d*-neighbor of a random *l*-mer is *p*(*Σ*,*l*,*d*)=*N*(*Σ*,*l*,*d*)/|*Σ*|^{l}. The probability that *M* has at least one *d*-neighbor among the *l*-mers of a string of length *m* is thus *q*(*m*,*Σ*,*l*,*d*)=1-(1-*p*(*Σ*,*l*,*d*))^{m-l+1}. The probability that *M* has at least one *d*-neighbor in each of *n* random strings of length *m* is *q*(*m*,*Σ*,*l*,*d*)^{n}. Finally, the expected number of spurious motifs in an instance with *n* strings of length *m* each is: |*Σ*|^{l}*q*(*m*,*Σ*,*l*,*d*)^{n}. In this paper we consider all combinations of *l* and *d* where *l* is at most 50 and the number of spurious motifs (expected by random chance) does not exceed 500. Note that for a fixed *d*, if we can solve instance (*l*,*d*) we can also solve all instances (*l*^{′},*d*) where *l*^{′}>*l*, because they are less challenging than (*l*,*d*).

### Appendix 4 Heuristics for t and n

In the methods section we mentioned that we heuristically estimate the threshold *t* at which we switch from the pattern driven to the sample driven part. The exact formula used by the algorithm to compute *t* was t=max(2,\lfloor \sqrt{2(d+1)log\Sigma -logm}\rfloor ). This follows the intuition that *t* should increase with *Σ* to avoid large neighborhoods and decrease with *m* to avoid spending too much time on filtering.

In the Speedup techniques section we mentioned a speedup where we compute motifs for a subset of *n*^{′}<*n* strings. By default, the algorithm heuristically computes *n*^{′} as *n*^{′}=*m* *i* *n*(*n*,*t*+*n*/4-*l* *o* *g* *t*). These simple heuristics worked well enough on all our test cases, however the user can easily override them.

## References

Pevzner P, Sze S, et al: Combinatorial approaches to finding subtle signals in DNA sequences. Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology, August 19-23. 2000, AAAI 2000:269–278, , La Jolla / San Diego, CA, USA, Volume 8

Lanctot J, Li M, Ma B, Wang S, Zhang L: Distinguishing string selection problems. Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 17-19. 1999, ACM/SIAM 1999:633–642, January , Baltimore, Maryland

Yu Q, Huo H, Zhang Y, Guo H: PairMotif: a new pattern-driven algorithm for planted

*(l,d)*DNA motif search. PLoS ONE. 2012, 7 (10): e48442-10.1371/journal.pone.0048442.Davila J, Balla S, Rajasekaran S: Fast and practical algorithms for planted

*(l,d)*motif search. IEEE/ACM Trans Comput Biol and Bioinformatics. 2007, 4 (4): 544-552.Dinh H, Rajasekaran S, Davila J: qPMS7: A Fast Algorithm for Finding

*(l,d)*-Motifs in DNA and Protein Sequences. PLoS ONE. 2012, 7 (7): e41425-10.1371/journal.pone.0041425.Ho E, Jakubowski C, Gunderson S, et al: iTriplet, a rule-based nucleic acid sequence motif finder. Algo Mol Biol. 2009, 4: 14-10.1186/1748-7188-4-14.

Desaraju S, Mukkamala R: Multiprocessor implementation of modeling method for Planted Motif Problem. 2011 World Congress on Information and Communication Technologies (WICT), Dec 11-14. 2011, IEEE 2011:524–529, , Mumbai, India

Dinh H, Rajasekaran S, Kundeti V: PMS5: an efficient exact algorithm for the

*(l,d)*-motif finding problem. BMC Bioinformatics. 2011, 12: 410-10.1186/1471-2105-12-410.Bandyopadhyay S, Sahni S, Rajasekaran S: PMS6: A fast algorithm for motif discovery. IEEE 2nd International Conference on Computational Advances in Bio and Medical Sciences, ICCABS. 2012, IEEE 2012:1–6, , Las Vegas, NV, USA, February 23-25, 2012

Rajasekaran S, Dinh H: A speedup technique for (l, d)-motif finding algorithms. BMC Res Notes. 2011, 4: 54-10.1186/1756-0500-4-54. [http://www.biomedcentral.com/1756-0500/4/54]

Gramm J, Niedermeier R, Rossmanith P: Exact solutions for closest string and related problems. Algorithms and Computation, Volume 2223 of Lecture Notes in Computer Science. Edited by: Eades P, Takaoka T. 2001, Berlin Heidelberg: Springer, 441-453.

Abbas M, Abouelhoda M, Bahig H: A hybrid method for the exact planted (l, d) motif finding problem and its parallelization. BMC Bioinformatics. 2012, 13 (Suppl 17): S10-10.1186/1471-2105-13-S17-S10. [http://www.biomedcentral.com/1471-2105/13/S17/S10]

Dasari N, Ranjan D, Zubair M: High performance implementation of planted motif problem using suffix trees. 2011 International Conference on High Performance Computing & Simulation, HPCS 2012, Istanbul, Turkey, July 4-8, 2011. 2011, IEEE, 200-206.

Dasari N, Desh R, Zubair M: Solving planted motif problem on GPU. International Workshop on GPUs and Scientific Applications, GPUScA. 2010, Department of Scientific Computing, University of Vienna, TR-10-3 2010, , Vienna, Austria, September 11, 2010

Dasari NS, Desh R, Zubair M: An efficient multicore implementation of planted motif problem. Proceedings of the. 2010, IEEE 2010:9 –15, International Conference on High Performance Computing & Simulation, HPCS 2010, June 28 - July 2, 2010, Caen, France

Sahoo B, Sourav R, Ranjan R, Padhy S: Parallel implementation of exact algorithm for planted motif search problem using SMP cluster. European J Scientific Res. 2011, 64 (4): 484-496.

Sun H, Low M, Hsu W, Tan C, Rajapakse J: Tree-structured algorithm for long weak motif discovery. Bioinformatics. 2011, 27 (19): 2641-2647. 10.1093/bioinformatics/btr459.

Sun HQ, Low M, Hsu WJ, Rajapakse J: ListMotif: A time and memory efficient algorithm for weak motif discovery. 2010 International Conference on Intelligent Systems and Knowledge Engineering (ISKE), 15-16. 2010, IEEE 2010:254 –260, November , Hangzhou, China

Faheem HM: Accelerating motif finding problem using grid computing with enhanced brute force. Proceedings of the 12th international conference on Advanced communication technology. ICACT’10, Piscataway, NJ, USA: IEEE Press 2010:197–202

Tompa M, Li N, Bailey TL, Church GM, De Moor B, Eskin E, Favorov AV, Frith MC, Fu Y, Kent WJ, et al: Assessing computational tools for the discovery of transcription factor binding sites. Nature Biotechnol. 2005, 23: 137-144. 10.1038/nbt1053.

## Acknowledgements

The authors would like to thank Prof. Chun-Hsi (Vincent) Huang, Dr. Hieu Dinh, Tian Mi and Gabriel Sebastian Ilie for helpful discussions. This work has been supported in part by the following grants: NSF 0829916 and NIH R01-LM010101.

## Author information

### Authors and Affiliations

### Corresponding author

## Additional information

### Competing interests

The authors declare that they have no competing interests.

### Authors’ contributions

MN and SR designed and analyzed the algorithms. MN implemented the algorithms and carried out the empirical experiments. MN and SR analyzed the empirical results and drafted the manuscript. All authors read and approved the final manuscript.

## Authors’ original submitted files for images

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

## Rights and permissions

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

## About this article

### Cite this article

Nicolae, M., Rajasekaran, S. Efficient sequential and parallel algorithms for planted motif search.
*BMC Bioinformatics* **15**, 34 (2014). https://doi.org/10.1186/1471-2105-15-34

Received:

Accepted:

Published:

DOI: https://doi.org/10.1186/1471-2105-15-34