Sciweavers

Share
ISAAC
2004
Springer

Randomized Algorithms for Motif Detection

9 years 9 months ago
Randomized Algorithms for Motif Detection
Motivation: Motif detection for DNA sequences has many important applications in biological studies, e.g., locating binding sites and regulatory signals, and designing genetic probes etc. In this paper, we propose a randomized algorithm, design an improved EM algorithm and combine them to form a software. 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 ×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 (Expectation Maximization) algorithm that outperforms the original EM algorithm. (3) We develop a software 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 det...
Lusheng Wang, Liang Dong, Hui Fan
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Where ISAAC
Authors Lusheng Wang, Liang Dong, Hui Fan
Comments (0)
books