An improved heuristic algorithm for finding motif signals in DNA sequences

Chao Wen Huang; Wun Shiun Lee; Sun Yuan Hsieh

doi:10.1109/TCBB.2010.92

An improved heuristic algorithm for finding motif signals in DNA sequences

Chao Wen Huang, Wun Shiun Lee, Sun Yuan Hsieh

Department of Computer Science and Information Engineering

Research output: Contribution to journal › Article › peer-review

33 Citations (Scopus)

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.

Original language	English
Article number	5582077
Pages (from-to)	959-975
Number of pages	17
Journal	IEEE/ACM Transactions on Computational Biology and Bioinformatics
Volume	8
Issue number	4
DOIs	https://doi.org/10.1109/TCBB.2010.92
Publication status	Published - 2011

All Science Journal Classification (ASJC) codes

Biotechnology
Genetics
Applied Mathematics

Access to Document

10.1109/TCBB.2010.92

Cite this

@article{3ff8bc45dd4747c899f13b3fe3da1ca9,

title = "An improved heuristic algorithm for finding motif signals in DNA sequences",

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.",

author = "Huang, {Chao Wen} and Lee, {Wun Shiun} and Hsieh, {Sun Yuan}",

year = "2011",

doi = "10.1109/TCBB.2010.92",

language = "English",

volume = "8",

pages = "959--975",

journal = "IEEE/ACM Transactions on Computational Biology and Bioinformatics",

issn = "1545-5963",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "4",

}

TY - JOUR

T1 - An improved heuristic algorithm for finding motif signals in DNA sequences

AU - Huang, Chao Wen

AU - Lee, Wun Shiun

AU - Hsieh, Sun Yuan

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=79957634274&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79957634274&partnerID=8YFLogxK

U2 - 10.1109/TCBB.2010.92

DO - 10.1109/TCBB.2010.92

M3 - Article

C2 - 20855921

AN - SCOPUS:79957634274

SN - 1545-5963

VL - 8

SP - 959

EP - 975

JO - IEEE/ACM Transactions on Computational Biology and Bioinformatics

JF - IEEE/ACM Transactions on Computational Biology and Bioinformatics

IS - 4

M1 - 5582077

ER -

An improved heuristic algorithm for finding motif signals in DNA sequences

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this