A Multi-Objective Genetic Algorithm for Discovering Non-Dominated Motifs in DNA Sequences

  • Mehmet Kaya
  • Published 2007 in
    7th International Conference on Hybrid…

Abstract

This paper presents a novel motif discovery algorithm based on multi-objective genetic algorithms to extract non-dominated motifs in DNA sequences. The main advantage of our approach is that a large number of tradeoff (non-dominated) motifs can be obtained by a single run with respect to conflicting objectives: similarity, motif length and support maximization. In this paper, the method extracts non-dominated motifs taking into account two-objective at a time while one of the objectives is set to a pre-specified value. So, user is given to the authority of incorporating to motif discovery process. Our approach can be applied to any data set with a sequential character. Furthermore, it allows any choice of similarity measures for finding motifs. By analyzing the discovered non-dominated motifs, the decision maker can understand the tradeoff between the objectives. We compare the approach with the three well-known motif discovery methods, AlignACE, MEME and Weeder. Experimental results on real data set extracted from TRANSFAC database demonstrate that the proposed method exhibits good performance over the other methods in terms of runtime and accuracy of prediction.

DOI: 10.1109/HIS.2007.12

8 Figures and Tables

Cite this paper

@article{Kaya2007AMG, title={A Multi-Objective Genetic Algorithm for Discovering Non-Dominated Motifs in DNA Sequences}, author={Mehmet Kaya}, journal={7th International Conference on Hybrid Intelligent Systems (HIS 2007)}, year={2007}, pages={180-185} }