Using a parallel team of multiobjective evolutionary algorithms to solve the motif discovery problem

Advances in Intelligent and Soft Computing

Volumn 79, Issue , 2010, Pages 569-576

  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

Bioinformatics; evolutionary algorithms; motif discovery; multiobjective optimization; parallel team

Indexed keywords

COLLABORATIVE WORK; DEOXYRIBONUCLEIC ACIDS; DIFFERENTIAL EVOLUTION; DNA ANALYSIS; EVOLUTIONARY TECHNIQUES; MOTIF DISCOVERY; MOTIF FINDING; MULTI OBJECTIVE; MULTI OBJECTIVE EVOLUTIONARY ALGORITHMS; MULTIPLE ALIGNMENT; NON-DOMINATED SORTING GENETIC ALGORITHM - II; NP-HARD; OPTIMIZATION PROBLEMS; PARALLEL TEAM; POPULATION-BASED ALGORITHM; SEARCH SPACES; TRAJECTORY-BASED ALGORITHM; VARIABLE NEIGHBORHOOD SEARCH;

ARTIFICIAL INTELLIGENCE; BIOINFORMATICS; BIOLOGY; DISTRIBUTED COMPUTER SYSTEMS; DNA SEQUENCES; HEURISTIC ALGORITHMS; MULTIOBJECTIVE OPTIMIZATION; NUCLEIC ACIDS; PROTEIN FOLDING;

EVOLUTIONARY ALGORITHMS;

EID: 80052986161     PISSN: 18675662     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-642-14883-5_72     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) (Pubitemid 32209244)
2. D'haeseleer, P.: What are DNA sequence motifs? Nature Biotechnology 24(4), 423-425 (2006)
3. Kaya, M.: MOGAMOD: Multi-objective genetic algorithm for motif discovery. Expert Systems with Applications: An International Journal 36(2), 1039-1047 (2009)
4. González-Á lvarez, D.L., Vega-Rodŕiguez, 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). IEEE Computer Society, Los Alamitos (2010)
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) (Pubitemid 34555372)
6. González-Á lvarez, D.L., Vega-Rodŕiguez, M.A., Gómez-Pulido, J.A., Sánchez-Pérez, J.M.: A Multiobjective Variable Neighborhood Search for Solving the Motif Discovery Problem. In: Advances in Intelligent and Soft Computing. Springer. Heidelberg (2010)
7. Tompa, M., et al.: Assessing computational tools for the discovery of transcription factor binding sites. Nature Biotechnology 23(1), 137-144 (2005) (Pubitemid 41724640)
8. 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) (Pubitemid 26085775)
9. 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) (Pubitemid 28483622)
10. 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)
11. 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)
12. OpenMP, http://openmp.org/