An improved heuristic algorithm for finding motif signals in DNA sequences

Chao Wen Huang, Wun Shiun Lee, Sun Yuan Hsieh

研究成果: Article同行評審

27 引文 斯高帕斯(Scopus)

摘要

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.

原文English
文章編號5582077
頁(從 - 到)959-975
頁數17
期刊IEEE/ACM Transactions on Computational Biology and Bioinformatics
8
發行號4
DOIs
出版狀態Published - 2011

All Science Journal Classification (ASJC) codes

  • Biotechnology
  • Genetics
  • Applied Mathematics

指紋 深入研究「An improved heuristic algorithm for finding motif signals in DNA sequences」主題。共同形成了獨特的指紋。

引用此