Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. For technical support, please contact us at We apologize for any inconvenience.
By Topic

Computational discovery of regulatory DNA motifs using evolutionary computation

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

2 Author(s)
Xi Li ; Dept. of Comput. Sci. & Comput. Eng., La Trobe Univ., Melbourne, VIC, Australia ; Dianhui Wang

Computational discovery of DNA motifs is one of the major challenges in bioinformatics, which helps in understanding the mechanism of gene regulation. It has been reported that computational approaches have good potential for problem solving in terms of cost and time saving. Based on our previous studies, this paper aims to develop an evolutionary computation scheme to provide an alternative approach for motif discovery. To work on the framework of our previously developed GAPK, a small sized collection of k-mers is extracted and utilized as “prior knowledge” in algorithm development. Our technical contributions in this paper mainly include a novel fitness function carrying information on conservation and rareness of DNA motifs, and a path to access GAPK-like solutions using seed concept and filtering techniques. The proposed algorithm in this paper has been evaluated by using eight benchmarked datasets, with comparisons to well-known tools such as MEME, MDScan, AlignACE and two GA-based techniques. Results show that our proposed method favorably outperforms other algorithms for these testing datasets.

Published in:

Evolutionary Computation (CEC), 2010 IEEE Congress on

Date of Conference:

18-23 July 2010