Randomized algorithms for motif detection.
BACKGROUND
Motif detection for DNA sequences has many important applications in biological studies, e.g. locating binding sites regulatory signals, designing genetic probes etc. In this paper, we propose a randomized algorithm, design an improved EM algorithm and combine them to form a software tool.


RESULTS
(1) We design a randomized algorithm for consensus pattern problem. We can show that with high probability, our randomized algorithm finds a pattern in polynomial time with cost error at most x l for each string, where l is the length of the motif and can be any positive number given by the user. (2) We design an improved EM algorithm that outperforms the original EM algorithm. (3) We develop a software tool, MotifDetector, that uses our randomized algorithm to find good seeds and uses the improved EM algorithm to do local search. We compare MotifDetector with Buhler and Tompa's PROJECTION which is considered to be the best known software for motif detection. Simulations show that MotifDetector is slower than PROJECTION when the pattern length is relatively small, and outperforms PROJECTION when the pattern length becomes large.


BACKGROUND
It is available for free at http://www.cs.cityu.edu.hk/~lwang/software/motif/index.html, subject to copyright restrictions.
Wang
Lusheng
L
Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong, P. R. China. lwang@cs.cityu.edu.hk
Dong
Liang
L
D000465:Algorithms; D017124:Conserved Sequence; D004247:DNA / Q000737:chemistry* / Q000235:genetics*; D003627:Data Interpretation, Statistical; D016013:Likelihood Functions; D008957:Models, Genetic; D015233:Models, Statistical; D016415:Sequence Alignment / Q000379:methods*; D017422:Sequence Analysis, DNA / Q000379:methods*; D012689:Sequence Homology, Nucleic Acid
D004247:DNA