The Community for Technology Leaders
Green Image
We consider the planted (<em>l</em>, <em>d</em>) motif search problem, which consists of finding a substring of length l that occurs in a set of input sequences {s<sub>1</sub>, . . . , s<sub>n</sub>} 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 <em>d</em>, 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.
Planted motif search problem, challenging instances, exact algorithms, branch and bound algorithms

S. Rajasekaran, S. Balla and J. Davila, "Fast and Practical Algorithms for Planted (l, d) Motif Search," in IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 4, no. , pp. 544-552, 2007.
86 ms
(Ver 3.3 (11022016))