Fast and Practical Algorithms for Planted (l, d) Motif Search

We consider the planted (I, d) motif search problem, which consists of finding a substring of length I that occurs in a set of input sequences {si,. ..,s
_n
} with up to d errors, a problem that arises from the need to find transcription factor-binding sites in genomic information. We propose a sequence of practical algorithms, which start based on the ideas considered in PMS1. These algorithms are exact, have little space requirements, and are able to tackle challenging instances with bigger d, taking less time in the instances reported solved by exact algorithms. In particular, one of the proposed algorithms, PMSprune, is able to solve the challenging instances, such as (17, 6) and (19, 7), which were not previously reported as solved in the literature.