Motif finding in biological sequences is a widely studied yet not fully solved problem. Exact solution to this problem is NP-complete. However, all existing computational methods have been based on some heuristics. On the other hand biological approaches are not efficient both in space and time. Fortunately, large amounts of genome sequencing data are readily available for researchers for analysis and it is possible to build computational model which is also biologically significant. Practical solutions should have highly conserved instances of the candidate motif having biological significance. In this paper, a new approach involving the Multi-objective Genetic Algorithm is used to find motifs in biological sequences. Experiment result shows that the proposed method is successful in discovering planted motif in a group of DNA sequences with high accuracy.

Keywords : Genetic Algorithm; Sequence Conservation; Mult-Objective Optimization.