一种改进的启发式算法，用于在 DNA 序列中寻找基序信号。

An improved heuristic algorithm for finding motif signals in DNA sequences.

机构信息

Department of Computer Science and Information Engineering, National Cheng Kung University, No. 1, University Road, Tainan 70101, Taiwan.

出版信息

IEEE/ACM Trans Comput Biol Bioinform. 2011 Jul-Aug;8(4):959-75. doi: 10.1109/TCBB.2010.92.

DOI:10.1109/TCBB.2010.92

PMID:20855921

Abstract

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.

摘要

（l，d）-基序搜索问题是 DNA 功能位点发现任务的数学抽象。在本文中，我们提出了一种启发式算法，可以在给定的 DNA 序列集中找到（l，d）-信号。在模拟数据集上的评估表明，所提出的算法优于当前广泛使用的基序发现算法。我们还报告了在真实生物数据集上的实验结果。