CSDL Home IEEE/ACM Transactions on Computational Biology and Bioinformatics 2011 vol.8 Issue No.04 - July/August
Issue No.04 - July/August (2011 vol.8)
Chao-Wen Huang , National Cheng Kung University, Tainan
Wun-Shiun Lee , National Cheng Kung University, Tainan
Sun-Yuan Hsieh , National Cheng Kung University, Tainan
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2010.92
The planted (l,d)-motif search problem is a mathematical abstraction of the DNA functional site discovery task. In this paper, we propose a heuristic algorithm that can find planted (l,d)-signals in a given set of DNA sequences. Evaluations on simulated data sets demonstrate that the proposed algorithm outperforms current widely used motif finding algorithms. We also report the results of experiments on real biological data sets.
Planted motif search problem, heuristic algorithms, (l, d)-signals.
Chao-Wen Huang, Wun-Shiun Lee, Sun-Yuan Hsieh, "An Improved Heuristic Algorithm for Finding Motif Signals in DNA Sequences", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.8, no. 4, pp. 959-975, July/August 2011, doi:10.1109/TCBB.2010.92