An effective algorithm of motif finding problem Online publication date: Sat, 17-May-2008
by Yong Chen, Guojun Li
International Journal of Bioinformatics Research and Applications (IJBRA), Vol. 4, No. 2, 2008
Abstract: 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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bioinformatics Research and Applications (IJBRA):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com