1.
IEEE/ACM Trans Comput Biol Bioinform
; 8(4): 959-75, 2011.
Artigo
em Inglês
| MEDLINE
| ID: mdl-20855921
RESUMO
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.