A Multiobjective SFLA-Based Technique for Predicting Motifs in DNA Sequences
In recent years design of new evolutionary techniques for addressing optimization problems is being a booming practice. Furthermore, considering that the vast majority of real optimization problems need to simultaneously optimize more than a single objective function (Multiobjective Optimization Problem - MOP); many of these techniques are also adapted to this multiobjective context. In this paper, we present a multiobjective adaptation of one of the last proposed swarm-based evolutionary algorithms, the Shuffle Frog Leaping Algorithm (SFLA), named Multiobjective Shuffle Frog Leaping Algorithm (MO-SFLA). To evaluate the performance of this new multiobjective algorithm, we have applied it to solve an important biological optimization problem, the Motif Discovery Problem (MDP). As we will see, the structure and operation of MO-SFLA makes it suitable for solving the MDP, achieving better results than other multiobjective evolutionary algorithms and making better predictions than other well-known biological tools.
KeywordsShuffle frog leaping algorithm evolutionary algorithm multiobjective optimization motif discovery DNA
Unable to display preview. Download preview PDF.
- 4.Fogel, G.B., Porto, V.W., Varga, G., Dow, E.R., Craven, A.M., Powers, D.M., Harlow, H.B., Su, E.W., Onyia, J.E., Su, C.: Evolutionary computation for discovery of composite transcription factor binding sites. Nucleic Acids Research 36(21), e142 (2008)Google Scholar
- 9.Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the strength pareto evolutionary algorithm. Technical report tik-report 103, Swiss Federal Institute of Technology Zurich, Switzerland (2001)Google Scholar