Cart (Loading....) | Create Account
Close category search window

MGIGA: An Iterative Merge Based Genetic Algorithm for Motif Discovery in Genomic Sequences

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

5 Author(s)
Kg, S. ; MS Ramaiah Inst. of Technol., Bangalore ; Pendyala, S. ; Bhatt, A. ; Venugopal, K.
more authors

Motif discovery is an important problem in bio-informatics that involves the search for approximate matches. Various algorithms have been proposed, including exhaustive searches as well as heuristic searches that involve searching only a subset of all the possible solutions. One such often employed method is the genetic algorithm. A genetic algorithm based approach is employed in MDGA, using a single population. In this paper, we present an iterative merge based genetic algorithms for motif discovery in genomic sequences and the results are compared with that of standard methods on well known datasets.

Published in:

Conference on Computational Intelligence and Multimedia Applications, 2007. International Conference on  (Volume:1 )

Date of Conference:

13-15 Dec. 2007

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.