| Literature DB >> 20855921 |
Chao-Wen Huang1, Wun-Shiun Lee, Sun-Yuan Hsieh.
Abstract
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.Mesh：
Substances：
Year: 2011 PMID： 20855921 DOI： 10.1109/TCBB.2010.92
Source DB: PubMed Journal: IEEE/ACM Trans Comput Biol Bioinform ISSN： 1545-5963 Impact factor: 3.710