An effective algorithm of motif finding problem.
Identification of the short DNA sequence motif, which serves as binding targets for transcription factors, is a fundamental problem in both computer science and molecular biology. Especially, finding the subtle motifs with variable gaps is more challenging. In this paper, a new algorithm is presented, which explores some new strategies. Based on a neighbourhood set concept, a new probability matrix is defined, which can capture the target motifs effectively. An iterative restart strategy is used, by which we can use several similar motifs' information to detect the real motif to demonstrate the effectiveness of our algorithm. We test it on several kinds of data and compare it with some other current representation algorithms. Simulation shows that the algorithm can effectively detect the subtle motifs.
Chen
Yong
Y
School of Mathematics and System Sciences, Shandong University, Jinan, Shandong, China. yong-ch@hotmail.com
Li
Guojun
G
D000465:Algorithms; D001483:Base Sequence; D017422:Sequence Analysis, DNA