|
计算机科学 2008
Comparison and Analysis on Subtle Motifs Discovery Algorithms in DNA Sequence
|
Abstract:
Finding motifs is a significant computational problem in bioinformatics,many models and algorithms have been proposed to solve this problem.By reason of the complexity of DNA sequence data,there exist lots of subtle motifs which are much more difficult to be found than strong signals.Up to now,the planted(l,d) motif problem and the extended planted(l,d) motif problem are two suitable models for finding subtle motifs.This paper generalizes and analyzes the methods and strategies of motif discovery and the mo...