Skip to Main Content
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.