Applying a multiobjective gravitational search algorithm (MO-GSA) to discover motifs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6692 LNCS, Issue PART 2, 2011, Pages 372-379

  González Álvarez, David L ^a   Vega Rodríguez, Miguel A ^a   Gómez Pulido, Juan A ^a   Sánchez Pérez, Juan M ^a  

^a UNIVERSITY OF EXTREMADURA   (Spain)

Author keywords

DNA; Gravitational Search Algorithm; motif finding; multiobjective optimization; Swarm Intelligence

Indexed keywords

COMPLEX SYSTEMS; COMPUTATIONAL TECHNIQUE; DEOXYRIBONUCLEIC ACIDS; GENOMICS; MASS INTERACTION; MOTIF DISCOVERY; MOTIF FINDING; MULTI OBJECTIVE; REAL DATA SETS; SEARCH ALGORITHMS; SEQUENCE ANALYSIS; SMALL MOLECULES; SWARM INTELLIGENCE; GRAVITATIONAL SEARCH ALGORITHM (GSA); GRAVITATIONAL SEARCH ALGORITHMS; LAW OF GRAVITIES;

ANIMALS; BIOINFORMATICS; CELLULAR AUTOMATA; DNA SEQUENCES; LEARNING ALGORITHMS; MULTIOBJECTIVE OPTIMIZATION; NEURAL NETWORKS; NUCLEIC ACIDS; ARTIFICIAL INTELLIGENCE; DNA; GRAVITATION; OPTIMIZATION; SWARM INTELLIGENCE;

GRAVITATION; BIOINFORMATICS;

EID: 79957953014     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21498-1_47     Document Type: Conference Paper

References (12)

1. Dopazo, J., Zanders, E., Dragoni, I., Amphlett, G., Falciani, F.: Methods and approaches in the analysis of gene expression data. Journal of immunological methods 250(1-2), 93-112 (2001)
2. Kaya, M.: MOGAMOD: Multi-objective genetic algorithm for motif discovery. Expert Systems with Applications: An International Journal 36(2), 1039-1047 (2009)
3. González-Álvarez, D.L., Vega-Rodríguez, M.A., Gómez-Pulido, J.A., Sánchez- Pérez, J.M.: Solving the Motif Discovery Problem by Using Differential Evolution with Pareto Tournaments. In: Proceedings of the 2010 IEEE Congress on Evolutionary Computation (CEC 2010), pp. 4140-4147. IEEE Computer Society, Los Alamitos (2010)
4. Rashedi, E., Nezamabadi-pour, H., Saryazdi, S.: GSA: A Gravitational Search Algorithm. Information Sciences 179(13), 2232-2248 (2009)
5. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multi-objective genetic algorithm: NSGA II. IEEE Transactions on Evolutionary Computation 6, 182-197 (2002)
6. Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the Strength Pareto Evolutionary Algorithm for Multiobjective Optimization. Evol. Methods for Design Optimization and Control with Applications to Industrial Problems, 95-100 (2001)
7. González-Álvarez, D.L., Vega-Rodríguez, M.A., Gómez-Pulido, J.A., Sánchez- Pérez, J.M.: A Multiobjective Variable Neighborhood Search for Solving the Motif Discovery Problem. AISC, vol. 73, pp. 39-46. Springer, Heidelberg (2010)
8. Zitzler, E., Deb, K., Thiele, L.: Comparison of multiobjective evolutionary algorithms: empirical results. IEEE Transactions on Evolutionary Computation 8(2), 173-195 (2000)
9. Wingender, E., Dietze, P., Karas, H., Knüppel, R.: TRANSFAC: a database on transcription factors and their DNA binding sites. Nucleic Acids Research 24(1), 238-241 (1996)
10. Roth, F.P., Hughes, J.D., Estep, P.W., Church, G.M.: Finding DNA regulatory motifs within unaligned noncoding sequences clustered by whole genome mRNA quantitation. Nature Biotechnology 16(10), 939-945 (1998)
11. Bailey, T.L., Elkan, C.: Fitting a mixture model by expectation maximization to discover motifs in biopolymers. In: Proceedings of the Second International Conference on Intelligent Systems for Molecular Biology, pp. 28-36. AAAI Press, Menlo Park (1994)
12. Pavesi, G., Mereghetti, P., Mauri, G., Pesolev, G.: Weeder Web: discovery of transcription factor binding sites in a set of sequences from co-regulared genes. Nucleic Acids Research 32, 199-203 (2004)