Comparing multiobjective swarm intelligence metaheuristics for DNA motif discovery

Engineering Applications of Artificial Intelligence

Volumn 26, Issue 1, 2013, Pages 314-326

  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

Artificial bee colony; Deoxyribonucleic acid (DNA); Gravitational search algorithm; Motif discovery; Multiobjective optimization; Swarm intelligence

Indexed keywords

ARTIFICIAL BEE COLONIES; BIOLOGICAL METHODS; BIOLOGICAL PROBLEMS; COMPUTATIONAL TECHNIQUE; DNA MOTIF; DNA SEQUENCE ANALYSIS; GRAVITATIONAL SEARCH ALGORITHMS; META HEURISTICS; MOTIF DISCOVERY; MULTI OBJECTIVE; NOVEL ALGORITHM; PATTERN SEARCH; PROBLEM DEFINITION; PROBLEM FORMULATION; STANDARD ALGORITHMS; SWARM INTELLIGENCE;

ARTIFICIAL INTELLIGENCE; DNA; GENES; HEURISTIC ALGORITHMS; LEARNING ALGORITHMS; MARKOV PROCESSES; MULTIOBJECTIVE OPTIMIZATION;

NUCLEIC ACIDS;

EID: 84870061263     PISSN: 09521976     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.engappai.2012.06.014     Document Type: Article

References (49)

1. W. Ao, J. Gaudet, W.J. Kent, S. Muttumu, and S.E. Mango Environmentally induced foregut remodeling by PHA-4/FoxA and DAF-12/NHR Science 305 5691 2004 1743 1746
2. T.L. Bailey, and C. Elkan Unsupervised learning of multiple motifs in biopolymers using expectation maximization Mach. Learn. 21 1-2 1995 51 80
3. Che, Y.; Song, D.; Rashedd, K.; 2005. MDGA: Motif discovery using a genetic algorithm. In: Proceedings of the 2005 Conference on Genetic and Evolutionary Computation (GECCO'05), pp. 447-452.
4. K. Deb Multi-objective Optimization Using Evolutionary Algorithms 2001 John Wiley & Sons
5. K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan A fast and elitist multiobjective genetic algorithm: NSGA-II IEEE Trans. Evolut. Comput. 6 2002 182 197
6. P. D'haeseleer What are DNA sequence motifs? Nat. Biotechnol. 24 4 2006 423 425
7. E. Eskin, and P.A. Pevzner Finding composite regulatory patterns in DNA sequences Bioinformatics 18 Suppl 1 2002 S354 S363
8. A.V. Favorov, M.S. Gelfand, A.V. Gerasimova, D.A. Ravcheev, A.A. Mironov, and V.J. Makeev A Gibbs sampler for identification of symmetrically structured, spaced DNA motifs with improved estimation of the signal length Bioinformatics 21 10 2005 2240 2245
9. G.B. Fogel, D.G. Weekes, G. Varga, E.R. Dow, H.B. Harlow, J.E. Onyia, and C. Su Discovery of sequence motifs related to coexpression of genes using evolutionary computation Nucl. Acids Res. 32 13 2004 3826 3835
10. G.B. Fogel, V.W. Porto, G. Varga, E.R. Dow, A.M. Craven, D.M. Powers, H.B. Harlow, E.W. Su, J.E. Onyia, and C. Su Evolutionary computation for discovery of composite transcription factor binding sites Nucl. Acids Res. 36 21 2008 e142
11. M.C. Frith, U. Hansen, J.L. Spouge, and Z. Weng Finding functional sequence elements by multiple local alignment Nucl. Acids Res. 32 1 2004 189 200
12. F. Glover, and G. Kochenberger Handbook of Metaheuristics 2003 Kluwer Academic Publishers
13. González-Álvarez, D.L.; Vega-Rodríguez, M.A.; Gómez-Pulido, J.A.; Sánchez-Pérez, J.M.; 2010a. Solving the motif discovery problem by using differential evolution with Pareto tournaments. In: Proceedings of the 2010 IEEE Congress on Evolutionary Computation (CEC'10), pp. 4140-4147.
14. González-Álvarez, D.L.; Vega-Rodríguez, M.A.; Gómez-Pulido, J.A.; Sánchez-Pérez, J.M.; 2010b. A multiobjective variable neighborhood search for solving the motif discovery problem. In: International Workshop on Soft Computing Models in Industrial Applications (SOCO'10), vol. 73, pp. 39-46.
15. González-Álvarez, D.L.; Vega-Rodríguez, M.A.; Gómez-Pulido, J.A.; Sánchez-Pérez, J.M.; 2011a. Finding motifs in DNA sequences applying a multiobjective artificial bee colony (MOABC) algorithm. In: Proceedings of 8th European Conference on Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics (EVOBIO'11), Lecture Notes in Computer Science, vol. 6623/2011, pp. 89-100.
16. González-Álvarez, D.L.; Vega-Rodríguez, M.A.; Gómez-Pulido, J.A.; Sánchez-Pérez, J.M.; 2011b. Applying a multiobjective gravitational search algorithm (MO-GSA) to discover motifs. In: International Work Conference on Artificial Neural Networks (IWANN'11), Lecture Notes in Computer Science, vol. 6692/2011, pp. 372-379.
17. D.L. González-Álvarez, M.A. Vega-Rodríguez, J.A. Gómez-Pulido, and J.M. Sánchez-Pérez Predicting DNA motifs by using evolutionary multiobjective optimization IEEE Trans. Syst. Man Cybern. Part C: Appl. Rev. 2011 1 13 (on-line available since December 2011)
18. G.Z. Hertz, and G.D. Stormo Identifying DNA and protein patterns with statistically significant alignments of multiple sequences Bioinformatics 15 7-8 1999 563 577
19. G.Z. Hertz, G.W. Hartzell, and G.D. Stormo Identification of consensus patterns in unaligned DNA sequences known to be functionally related Comput. Appl. Biosci. 6 2 1990 81 92
20. Karaboga, D.; 2005. An Idea Based on Honey Bee Swarm for Numerical Optimization. Technical Report-tr06, Erciyes University, Turkey.
21. M. Kaya MOGAMOD: Multi-objective genetic algorithm for motif discovery Expert Syst. Appl. 36 2 2009 1039 1047
22. Liu, F.F.M.; Tsai, J.J.P.; Chen, R.M.; Chen, S.N.; Shih, S.H.; 2004. FMGA: finding motifs by genetic algorithm. In: Fourth IEEE Symposium on Bioinformatics and Bioengineering (BIBE'04), pp. 459-466.
23. D. Maier The complexity of some problems on subsequences and supersequences J. ACM 25 2 1978 322 336
24. N. Mladenovic, and P. Hansen Variable neighborhood search Comput. Oper. Res. 24 1997 1097 1100
25. A.F. Neuwald, J.S. Liu, and C.E. Lawrence Gibbs motif sampling: detection of bacterial outer membrane protein repeats Protein Sci. 4 8 1995 1618 1632
26. C. Notredame, and D.G. Higgins SAGA: sequence alignment by genetic algorithm Nucl. Acids Res. 24 8 1996 1515 1524
27. G. Pavesi, G. Mauri, and G. Pesole An algorithm for finding signals of unknown length in DNA sequences Bioinformatics 17 Suppl 1 2001 S207 S214
28. E. Rashedi, H. Nezamabadi-pour, and S. Saryazdi GSA: a gravitational search algorithm Inf. Sci. 179 13 2009 2232 2248
29. M. Regnier, and A. Denise Rare events and conditional events on random strings Discrete Math. Theor. Comput. Sci. 6 2004 191 214
30. R. Rivière, D. Barth, J. Cohen, and A. Denise Shuffling biological sequences with motif constraints J. Discrete Algorithms 6 2 2008 192 204
31. F.P. Roth, J.D. Hughes, P.W. Estep, and G.M. Church Finding DNA regulatory motifs within unaligned noncoding sequences clustered by whole-genome mRNA quantitation Nat. Biotechnol. 16 10 1998 939 945
32. Shao, L.; Chen, Y.; 2009. Bacterial foraging optimization algorithm integrating tabu search for motif discovery. In: IEEE International Conference on Bioinformatics and Biomedicine (BIBM'09), pp. 415-418.
33. Shao, L.; Chen, Y.; Abraham, A.; 2009. Motif discovery using evolutionary algorithms. In: International Conference of Soft Computing and Pattern Recognition (SOCPAR'09), pp. 420-425.
34. D.J. Sheskin Handbook of Parametric and Nonparametric Statistical Procedures 4th ed. 2007 Chapman & Hall/CRC Press New York
35. S. Sinha, and M. Tompa YMF: A program for discovery of novel transcription factor binding sites by statistical overrepresentation Nucl. Acids Res. 31 13 2003 3586 3588
36. N. Srinivas, and K. Deb Multi-objective function optimization using non-dominated sorting genetic algorithms Evolut. Comput. 2 3 1995 221 248
37. Stine, M.; Dasgupta, D.; Mukatira, S.; 2003. Motif discovery in upstream sequences of coordinately expressed genes. In: The 2003 Congress on Evolutionary Computation (CEC'03), vol. 3, pp. 1596-1603.
38. R. Storn, and K. Price Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces J. Global Optim. 11 4 1997 341 359
39. G. Thijs, M. Lescot, K. Marchal, S. Rombauts, B. De Moor, P. Rouzé, and Y. Moreau A higher-order background model improves the detection of promoter regulatory elements by Gibbs sampling Bioinformatics 17 12 2001 1113 1122
40. M. Tompa, N. Li, T.L. Bailey, G.M. Church, B. De Moor, E. Eskin, A.V. Favorov, M.C. Frith, Y. Fu, W.J. Kent, V.J. Makeev, A.A. Mironov, W.S. Noble, G. Pavesi, G. Pesole, M. Regnier, N. Simonis, S. Sinha, G. Thijs, J. van Helden, M. Vandenbogaert, C. Weng, Z. Workman, C. Ye, and Z. Zhu Assessing computational tools for the discovery of transcription factor binding sites Nat. Biotechnol. 23 1 2005 137 144
41. J. van Helden, B. Andre, and J. Collado-Vides Extracting regulatory sites from the upstream region of yeast genes by computational analysis of oligonucleotide frequencies J. Mol. Biol. 281 5 1998 827 842
42. J. van Helden, A.F. Rios, and J. Collado-Vides Discovering regulatory elements in non-coding sequences by analysis of spaced dyads Nucl. Acids Res. 28 8 2000 1808 1818
43. L. While, P. Hingston, L. Barone, and S. Huband A faster algorithm for calculating hypervolume IEEE Trans. Evolut. Comput. 10 1 2006 29 38
44. E. Wingender, P. Dietze, H. Karas, and R. Knuppel TRANSFAC: a database on transcription factors and their DNA binding sites Nucl. Acids Res. 24 1 1996 238 241
45. Workman, C.T.; Stormo, G.D.; 2000. ANN-Spec: a method for discovering transcription factor binding sites with improved specificity. In: Pacific Symposium on Biocomputing, pp. 467-478.
46. F. Zare-Mirakabad, H. Ahrabian, M. Sadeghi, S. Hashemifar, A. Nowzari-Dalini, and B. Goliaei Genetic algorithm for dyad pattern finding in DNA sequences Genes Genet. Syst. 84 1 2009 81 93
47. E. Zitzler, and L. Thiele Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach IEEE Trans. Evolut. Comput. 3 4 1999 257 271
48. E. Zitzler, K. Deb, and L. Thiele Comparison of multiobjective evolutionary algorithms: empirical results Evolut. Comput. 8 2 2000 173 195
49. Zitzler, E.; Laumanns, M.; Thiele, L.; 2001. SPEA2: Improving the Strength Pareto Evolutionary Algorithm. Technical Report tik-report 103, Swiss Federal Institute of Technology Zurich, Switzerland.