title: Improved Exact Enumerative Algorithms for the Planted (l, d)-Motif Search Problem.
abstract: In this paper efficient exact algorithms are proposed for the planted ( l, d)-motif search problem. This problem is to find all motifs of length l that are planted in each input string with at most d mismatches. The "quorum" version of this problem is also treated in this paper to find motifs planted not in all input strings but in at least q input strings. The proposed algorithms are based on the previous algorithms called qPMSPruneI and qPMS7 that traverse a search tree starting from a l-length substring of an input string. To improve these previous algorithms, several techniques are introduced, which contribute to reducing the computation time for the traversal. In computational experiments, it will be shown that the proposed algorithms outperform the previous algorithms.
authors.forename: Shunji
authors.initials: S
authors.lastname: Tanaka
mesh_terms: D000465:Algorithms; D020816:Amino Acid Motifs / Q000235:genetics*; D019295:Computational Biology / Q000379:methods*; D059372:Nucleotide Motifs / Q000235:genetics*; D017422:Sequence Analysis, DNA / Q000379:methods*; D020539:Sequence Analysis, Protein / Q000379:methods*