location: Current position: Home >> Scientific Research >> Paper Publications

An iterative algorithm for motif discovery

Hits:

Indexed by:会议论文

Date of Publication:2013-01-01

Included Journals:CPCI-S、Scopus

Volume:24

Page Number:25-29

Key Words:Bioinformatics; Motif discovery; DNA sequences; Transcription factors

Abstract:Analysis of DNA Sequence motifs is becoming increasingly important in the study of gene regulation, and the identification of motif in DNA sequences is a very complex problem in computational biology. In this paper, we propose a method that employs the general GA framework and computes the motifs from the shot motif length to the standard length with three operation in GA and a new operation called Addition proposed by us. The experiment results on simulated data and real biological data show that the obtained motifs are consistent with the real ones. Moreover, our method gets higher score than the other three methods: Gibbs Sampler, Genetic Algorithm (GA) and GARPS algorithm in terms of the data CRP. In addition, our algorithm is a parallel random search that is beneficial to implement parallel computing to increase computational efficiency of the algorithm. (C) 2013 The Authors. Published by Elsevier B.V.

Pre One:Modified gradient-based learning for local coupled feedforward neural networks with Gaussian basis function

Next One:Convergence of online gradient methods for Pi-Sigma neural network with a penalty term, DOI: 10.1109/ANTHOLOGY.2013.