By Topic

Combining genetic algorithm and random projection strategy for (l, d)-motif discovery

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Hongwei Huo ; Sch. of Comput. Sci. & Technol., Xidian Univ., Xi''an, China ; Zhenhua Zhao ; Stojkovic, V. ; Lifang Liu

Identification of planted (Z, d)-motifs is an important and hard challenging problem in computational biology. In this paper, we present an original algorithm that combines genetic algorithm (GA) and random projection strategy (RPS) GARPS to identify (I, d)-motifs. We start with RPS to find good starting positions by introducing position-weight function and constructing a new hash function based on the function and return a set of candidate motifs. Then, we use the results(good candidate motifs) from RPS as the initial population of genetic algorithm to make series of iterations to refine motif candidates. We use the global search capability of GA and RPS are explored in GARPS. Experimental results on simulated data show that GARPS performs better than the projection algorithm and solves the most of challenging planted motif finding problems and improves finding faint motifs.

Published in:

Bio-Inspired Computing, 2009. BIC-TA '09. Fourth International Conference on

Date of Conference:

16-19 Oct. 2009