%0 Journal Article
%T Comparison and Analysis on Subtle Motifs Discovery Algorithms in DNA Sequence<br>DNA序列中弱信号基序查找算法比较与分析
%A WANG Jian-xin
%A YANG De
%A HUANNG Yuan-nan
%A <br>王建新
%A 杨德
%A 黄元南
%J 计算机科学
%D 2008
%I 
%X 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...
%K Subtle signals
%K Motif discovery
%K Planted(l
%K d) problem
%K Algorithms
%K Consensus
%K Profile<br>弱信号
%K 基序查找
%K 植入(l
%K d)问题
%K 算法
%K 一致序列
%K 简图
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=E9F79527020F789AAB81EE0E41CC49EE&yid=67289AFF6305E306&vid=6209D9E8050195F5&iid=5D311CA918CA9A03&sid=847B14427F4BF76A&eid=5D9D6A8FC2C66FD8&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=29