arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1102.4015q-bio.GN
收藏

dMotifGreedy:一种从头发现DNA基序的新工具,具有增强的报告不同基序的能力

dMotifGreedy: a novel tool for de novo discovery of DNA motifs with enhanced power of reporting distinct motifs

Yupeng Wang, Xinyu Liu, Michael Kelley, Romdhane Rekaya

摘要:

从头发现过度代表的DNA模体是计算生物学的主要挑战之一。虽然有许多工具可用于从头发现基序,但这些工具中的许多都受到局部最优现象的影响,这可能会阻碍多个不同基序的检测。开发了一个基于贪婪算法的工具dMotifGreedy。dMotifGreedy首先从输入序列的成对局部比对中搜索候选基序,然后通过贪婪算法为每个候选基序计算最优全局解。dMotifGreedy在检测真模体方面具有竞争力的性能,并且在检测多个不同的真模体方面具有极大的增强性能。dMotifGreedy可通过http://lambchop.ads.uga.edu/dmotifgreedy/download.php上的独立程序免费获得。

英文摘要:

De novo discovery of over-represented DNA motifs is one of the major challenges in computational biology. Although numerous tools have been available for de novo motif discovery, many of these tools are subject to local optima phenomena, which may hinder detection of multiple distinct motifs. A greedy algorithm based tool named dMotifGreedy was developed. dMotifGreedy begins by searching for candidate motifs from pair-wise local alignments of input sequences and then computes an optimal global solution for each candidate motif through a greedy algorithm. dMotifGreedy has competitive performance in detecting a true motif and greatly enhanced performance in detecting multiple distinct true motifs. dMotifGreedy is freely available via a stand-alone program at http://lambchop.ads.uga.edu/dmotifgreedy/download.php.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑