{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T05:40:03Z","timestamp":1745991603392,"version":"3.40.4"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,4,18]],"date-time":"2013-04-18T00:00:00Z","timestamp":1366243200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s10898-013-0069-7","type":"journal-article","created":{"date-parts":[[2013,4,17]],"date-time":"2013-04-17T11:57:16Z","timestamp":1366199836000},"page":"467-497","source":"Crossref","is-referenced-by-count":4,"title":["Analysing the scalability of multiobjective evolutionary algorithms when solving the motif discovery problem"],"prefix":"10.1007","volume":"57","author":[{"given":"David L.","family":"Gonz\u00e1lez-\u00c1lvarez","sequence":"first","affiliation":[]},{"given":"Miguel A.","family":"Vega-Rodr\u00edguez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,4,18]]},"reference":[{"issue":"5691","key":"69_CR1","doi-asserted-by":"crossref","first-page":"1743","DOI":"10.1126\/science.1102216","volume":"305","author":"W Ao","year":"2004","unstructured":"Ao, W., Gaudet, J., Kent, W.J., Muttumu, S., Mango, S.E.: Environmentally induced foregut remodeling by PHA-4\/FoxA and DAF-12\/NHR. Science 305(5691), 1743\u20131746 (2004)","journal-title":"Science"},{"issue":"1\u20132","key":"69_CR2","first-page":"51","volume":"21","author":"TL Bailey","year":"1995","unstructured":"Bailey, T.L., Elkan, C.: Unsupervised learning of multiple motifs in biopolymers using expectation maximization. Mach. Learn. 21(1\u20132), 51\u201380 (1995)","journal-title":"Mach. Learn."},{"key":"69_CR3","doi-asserted-by":"crossref","unstructured":"Che, D., Song, Y., Rashedd, K.: MDGA: motif discovery using a genetic algorithm. In: Proceedings of the 2005 Conference on Genetic and, Evolutionary Computation (GECCO\u201905), pp. 447\u2013452 (2005)","DOI":"10.1145\/1068009.1068080"},{"key":"69_CR4","doi-asserted-by":"crossref","unstructured":"Congdon, C.B., Fizer, C.W., Smith, N.W., Gaskins, H.R., Aman, J., Nava, G.M., Mattingly, C.: Preliminary results for GAMI: a genetic algorithms approach to motif inference. In: Proceedings of the 2005 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB\u201905), pp. 97\u2013104 (2005)","DOI":"10.1109\/CIBCB.2005.1594904"},{"key":"69_CR5","volume-title":"Multi-Objective Optimization Using Evolutionary Algorithms","author":"K Deb","year":"2001","unstructured":"Deb, K.: Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, New York (2001)"},{"key":"69_CR6","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6, 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"69_CR7","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1038\/nbt0406-423","volume":"24","author":"P D\u2019haeseleer","year":"2006","unstructured":"D\u2019haeseleer, P.: What are DNA sequence motifs? Nat. Biotechnol. 24(4), 423\u2013425 (2006)","journal-title":"Nat. Biotechnol."},{"issue":"Suppl 1","key":"69_CR8","doi-asserted-by":"crossref","first-page":"S354","DOI":"10.1093\/bioinformatics\/18.suppl_1.S354","volume":"18","author":"E Eskin","year":"2002","unstructured":"Eskin, E., Pevzner, P.A.: Finding composite regulatory patterns in DNA sequences. Bioinformatics 18(Suppl 1), S354\u2013S363 (2002)","journal-title":"Bioinformatics"},{"issue":"10","key":"69_CR9","doi-asserted-by":"crossref","first-page":"2240","DOI":"10.1093\/bioinformatics\/bti336","volume":"21","author":"AV Favorov","year":"2005","unstructured":"Favorov, A.V., Gelfand, M.S., Gerasimova, A.V., Ravcheev, D.A., Mironov, A.A., Makeev, V.J.: A Gibbs sampler for identification of symmetrically structured, spaced DNA motifs with improved estimation of the signal length. Bioinformatics 21(10), 2240\u20132245 (2005)","journal-title":"Bioinformatics"},{"issue":"21","key":"69_CR10","doi-asserted-by":"crossref","first-page":"e142","DOI":"10.1093\/nar\/gkn738","volume":"36","author":"GB Fogel","year":"2008","unstructured":"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 Res. 36(21), e142 (2008)","journal-title":"Nucleic Acids Res."},{"issue":"13","key":"69_CR11","doi-asserted-by":"crossref","first-page":"3826","DOI":"10.1093\/nar\/gkh713","volume":"32","author":"GB Fogel","year":"2004","unstructured":"Fogel, G.B., Weekes, D.G., Varga, G., Dow, E.R., Harlow, H.B., Onyia, J.E., Su, C.: Discovery of sequence motifs related to coexpression of genes using evolutionary computation. Nucleic Acids Res. 32(13), 3826\u20133835 (2004)","journal-title":"Nucleic Acids Res."},{"issue":"1","key":"69_CR12","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1093\/nar\/gkh169","volume":"32","author":"MC Frith","year":"2004","unstructured":"Frith, M.C., Hansen, U., Spouge, J.L., Weng, Z.: Finding functional sequence elements by multiple local alignment. Nucleic Acids Res. 32(1), 189\u2013200 (2004)","journal-title":"Nucleic Acids Res."},{"key":"69_CR13","unstructured":"Gonz\u00e1lez-\u00c1lvarez, D.L., Vega-Rodr\u00edguez, M.A., G\u00f3mez-Pulido, J.A., S\u00e1nchez-P\u00e9rez, J.M.: A multiobjective variable neighborhood search for solving the motif discovery problem. Int. Workshop Soft Comput. Models Ind. Appl. (SOCO\u201910) 73, 39\u201346 (2010)"},{"key":"69_CR14","doi-asserted-by":"crossref","unstructured":"Gonz\u00e1lez-\u00c1lvarez, D.L., Vega-Rodr\u00edguez, M.A., G\u00f3mez-Pulido, J.A., S\u00e1nchez-P\u00e9rez, 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\u201910), pp. 4140\u20134147 (2010)","DOI":"10.1109\/CEC.2010.5586068"},{"key":"69_CR15","doi-asserted-by":"crossref","unstructured":"Gonz\u00e1lez-\u00c1lvarez, D.L., Vega-Rodr\u00edguez, M.A., G\u00f3mez-Pulido, J.A., S\u00e1nchez-P\u00e9rez, J.M.: Applying a multiobjective gravitational search algorithm (MO-GSA) to discover motifs. International Work Conference on Artificial Neural Networks (IWANN\u201911), LNCS 6692\/2011, 372\u2013379 (2011)","DOI":"10.1007\/978-3-642-21498-1_47"},{"key":"69_CR16","doi-asserted-by":"crossref","unstructured":"Gonz\u00e1lez-\u00c1lvarez, D.L., Vega-Rodr\u00edguez, M.A., G\u00f3mez-Pulido, J.A., S\u00e1nchez-P\u00e9rez, J.M.: 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\u201911), LNCS 6623\/2011, pp. 89\u2013100 (2011)","DOI":"10.1007\/978-3-642-20389-3_9"},{"issue":"6","key":"69_CR17","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1109\/TSMCC.2011.2172939","volume":"42","author":"DL Gonz\u00e1lez-\u00c1lvarez","year":"2011","unstructured":"Gonz\u00e1lez-\u00c1lvarez, D.L., Vega-Rodr\u00edguez, M.A., G\u00f3mez-Pulido, J.A., S\u00e1nchez-P\u00e9rez, J.M.: Predicting DNA motifs by using evolutionary multiobjective optimization. IEEE Trans. Syst. Man Cybern. Part C Appl. Rev. 42(6), 913\u2013925 (2011)","journal-title":"IEEE Trans. Syst. Man Cybern. Part C Appl. Rev."},{"issue":"1","key":"69_CR18","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/j.engappai.2012.06.014","volume":"26","author":"DL Gonz\u00e1lez-\u00c1lvarez","year":"2012","unstructured":"Gonz\u00e1lez-\u00c1lvarez, D.L., Vega-Rodr\u00edguez, M.A., G\u00f3mez-Pulido, J.A., S\u00e1nchez-P\u00e9rez, J.M.: Comparing multiobjective swarm intelligence metaheuristics for DNA motif discovery. Eng. Appl. Artif. Intell. 26(1), 314\u2013326 (2012)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"7\u20138","key":"69_CR19","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1093\/bioinformatics\/15.7.563","volume":"15","author":"GZ Hertz","year":"1999","unstructured":"Hertz, G.Z., Stormo, G.D.: Identifying DNA and protein patterns with statistically significant alignments of multiple sequences. Bioinformatics 15(7\u20138), 563\u2013577 (1999)","journal-title":"Bioinformatics"},{"key":"69_CR20","unstructured":"Karaboga, D.: An idea based on honey bee swarm for numerical optimization. Technical report-tr06, Erciyes University, Turkey (2005)"},{"issue":"1","key":"69_CR21","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/j.asoc.2007.05.007","volume":"8","author":"D Karaboga","year":"2008","unstructured":"Karaboga, D., Basturk, B.: On the performance of artificial bee colony (ABC) algorithm. Appl. Soft Comput. J. 8(1), 687\u2013697 (2008)","journal-title":"Appl. Soft Comput. J."},{"issue":"2","key":"69_CR22","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1016\/j.eswa.2007.11.008","volume":"36","author":"M Kaya","year":"2009","unstructured":"Kaya, M.: MOGAMOD: multi-objective genetic algorithm for motif discovery. Expert Syst. Appl. 36(2), 1039\u20131047 (2009)","journal-title":"Expert Syst. Appl."},{"key":"69_CR23","doi-asserted-by":"crossref","unstructured":"Liu, F.F.M., Tsai, J.J.P., Chen, R.M., Chen, S.N., Shih, S.H.: FMGA: finding motifs by genetic algorithm. Fourth IEEE Symposium on Bioinformatics and, Bioengineering (BIBE\u201904), pp. 459\u2013466 (2004)","DOI":"10.1109\/BIBE.2004.1317378"},{"issue":"3","key":"69_CR24","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1109\/tcbb.2007.1044","volume":"4","author":"MA Lones","year":"2007","unstructured":"Lones, M.A., Tyrrell, A.M.: Regulatory motif discovery using a population clustering evolutionary algorithm. IEEE\/ACM Trans. Comput. Biol. Bioinform. 4(3), 403\u2013414 (2007)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"69_CR25","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovic","year":"1997","unstructured":"Mladenovic, N., Hansen, P.: Variable neighborhood search. Comput. Operat. Res. 24, 1097\u20131100 (1997)","journal-title":"Comput. Operat. Res."},{"key":"69_CR26","doi-asserted-by":"crossref","unstructured":"Paul, T.K., Iba, H.: Identification of weak motifs in multiple biological sequences using genetic algorithm. In: Proceedings of the 2006 Conference on Genetic and, Evolutionary Computation (GECCO\u201906), pp. 271\u2013278 (2006)","DOI":"10.1145\/1143997.1144044"},{"issue":"Suppl 1","key":"69_CR27","doi-asserted-by":"crossref","first-page":"S207","DOI":"10.1093\/bioinformatics\/17.suppl_1.S207","volume":"17","author":"G Pavesi","year":"2001","unstructured":"Pavesi, G., Mauri, G., Pesole, G.: An algorithm for finding signals of unknown length in DNA sequences. Bioinformatics 17(Suppl 1), S207\u2013S214 (2001)","journal-title":"Bioinformatics"},{"issue":"13","key":"69_CR28","doi-asserted-by":"crossref","first-page":"2232","DOI":"10.1016\/j.ins.2009.03.004","volume":"179","author":"E Rashedi","year":"2009","unstructured":"Rashedi, E., Nezamabadi-pour, H., Saryazdi, S.: GSA: a gravitational search algorithm. Inf. Sci. 179(13), 2232\u20132248 (2009)","journal-title":"Inf. Sci."},{"key":"69_CR29","first-page":"191","volume":"6","author":"M Regnier","year":"2004","unstructured":"Regnier, M., Denise, A.: Rare events and conditional events on random strings. Discrete Math. Theor. Comput. Sci. 6, 191\u2013214 (2004)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"10","key":"69_CR30","doi-asserted-by":"crossref","first-page":"939","DOI":"10.1038\/nbt1098-939","volume":"16","author":"FP Roth","year":"1998","unstructured":"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. Nat. Biotechnol. 16(10), 939\u2013945 (1998)","journal-title":"Nat. Biotechnol."},{"key":"69_CR31","doi-asserted-by":"crossref","unstructured":"Shao, L., Chen, Y.: Bacterial foraging optimization algorithm integrating tabu search for motif discovery. IEEE International Conference on Bioinformatics and, Biomedicine (BIBM\u201909), pp. 415\u2013418 (2009)","DOI":"10.1109\/BIBM.2009.12"},{"key":"69_CR32","doi-asserted-by":"crossref","unstructured":"Shao, L., Chen, Y., Abraham, A.: Motif discovery using evolutionary algorithms. International Conference of Soft Computing and, Pattern Recognition (SOCPAR\u201909), pp. 420\u2013425 (2009)","DOI":"10.1109\/SoCPaR.2009.88"},{"key":"69_CR33","volume-title":"Handbook of Parametric and Nonparametric Statistical Procedures","author":"DJ Sheskin","year":"2007","unstructured":"Sheskin, D.J.: Handbook of Parametric and Nonparametric Statistical Procedures, 4th edn. Chapman & Hall\/CRC Press, New York (2007)","edition":"4"},{"issue":"13","key":"69_CR34","doi-asserted-by":"crossref","first-page":"3586","DOI":"10.1093\/nar\/gkg618","volume":"31","author":"S Sinha","year":"2003","unstructured":"Sinha, S., Tompa, M.: YMF: a program for discovery of novel transcription factor binding sites by statistical overrepresentation. Nucleic Acids Res. 31(13), 3586\u20133588 (2003)","journal-title":"Nucleic Acids Res."},{"issue":"3","key":"69_CR35","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1162\/evco.1994.2.3.221","volume":"2","author":"N Srinivas","year":"1995","unstructured":"Srinivas, N., Deb, K.: Multi-objective function optimization using non-dominated sorting genetic algorithms. Evol. Comput. 2(3), 221\u2013248 (1995)","journal-title":"Evol. Comput."},{"key":"69_CR36","doi-asserted-by":"crossref","first-page":"1596","DOI":"10.1109\/CEC.2003.1299863","volume":"3","author":"M Stine","year":"2003","unstructured":"Stine, M., Dasgupta, D., Mukatira, S.: Motif discovery in upstream sequences of coordinately expressed genes. 2003 Congr. Evol. Comput. (CEC\u201903) 3, 1596\u20131603 (2003)","journal-title":"2003 Congr. Evol. Comput. (CEC\u201903)"},{"issue":"4","key":"69_CR37","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn, R., Price, K.: Differential evolution\u2014a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11(4), 341\u2013359 (1997)","journal-title":"J. Glob. Optim."},{"issue":"12","key":"69_CR38","doi-asserted-by":"crossref","first-page":"1113","DOI":"10.1093\/bioinformatics\/17.12.1113","volume":"17","author":"G Thijs","year":"2001","unstructured":"Thijs, G., Lescot, M., Marchal, K., Rombauts, S., De Moor, B., Rouz\u00e9, P., Moreau, Y.: A higher-order background model improves the detection of promoter regulatory elements by Gibbs sampling. Bioinformatics 17(12), 1113\u20131122 (2001)","journal-title":"Bioinformatics"},{"issue":"1","key":"69_CR39","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1038\/nbt1053","volume":"23","author":"M Tompa","year":"2005","unstructured":"Tompa, M., Li, N., Bailey, T.L., Church, G.M., De Moor, B., Eskin, E., Favorov, A.V., Frith, M.C., Fu, Y., Kent, W.J., Makeev, V.J., Mironov, A.A., Noble, W.S., Pavesi, G., Pesole, G., Regnier, M., Simonis, N., Sinha, S., Thijs, G., van Helden, J., Vandenbogaert, M., Weng, Z., Workman, C., Ye, C., Zhu, Z.: Assessing computational tools for the discovery of transcription factor binding sites. Nat. Biotechnol. 23(1), 137\u2013144 (2005)","journal-title":"Nat. Biotechnol."},{"issue":"5","key":"69_CR40","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1006\/jmbi.1998.1947","volume":"281","author":"J Helden van","year":"1998","unstructured":"van Helden, J., Andre, B., Collado-Vides, J.: Extracting regulatory sites from the upstream region of yeast genes by computational analysis of oligonucleotide frequencies. J. Mol. Biol. 281(5), 827\u2013842 (1998)","journal-title":"J. Mol. Biol."},{"issue":"8","key":"69_CR41","doi-asserted-by":"crossref","first-page":"1808","DOI":"10.1093\/nar\/28.8.1808","volume":"28","author":"J Helden van","year":"2000","unstructured":"van Helden, J., Rios, A.F., Collado-Vides, J.: Discovering regulatory elements in non-coding sequences by analysis of spaced dyads. Nucleic Acids Res. 28(8), 1808\u20131818 (2000)","journal-title":"Nucleic Acids Res."},{"issue":"2","key":"69_CR42","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1109\/TEVC.2003.810760","volume":"7","author":"N Weicker","year":"2003","unstructured":"Weicker, N., Szabo, G., Weicker, K., Widmayer, P.: Evolutionay multiobjective optimization for base station transmitter placement with frequency assignment. IEEE Trans. Evol. Comput. 7(2), 189\u2013203 (2003)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"69_CR43","doi-asserted-by":"crossref","unstructured":"Workman, C.T., Stormo, G.D.: ANN-Spec: a method for discovering transcription factor binding sites with improved specificity. Pacific Symposium on Biocomputing, pp. 467\u2013478 (2000)","DOI":"10.1142\/9789814447331_0044"},{"key":"69_CR44","doi-asserted-by":"crossref","unstructured":"Yang, X.S.: Firefly algorithms for multimodal optimization. 5th International Symposium of Stochastic Algorithms: Foundations and Applications (SAGA\u201909), LNCS 5792, pp. 169\u2013178 (2009)","DOI":"10.1007\/978-3-642-04944-6_14"},{"issue":"2","key":"69_CR45","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1162\/106365600568202","volume":"8","author":"E Zitzler","year":"2000","unstructured":"Zitzler, E., Deb, K., Thiele, L.: Comparison of multiobjective evolutionary algorithms: empirical results. Evol. Comput. 8(2), 173\u2013195 (2000)","journal-title":"Evol. Comput."},{"key":"69_CR46","unstructured":"Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: improving the strength pareto evolutionary algorithm. Technical report tik-report 103, Swiss Federal Institute of Technology Zurich, Switzeland (2001)"},{"issue":"4","key":"69_CR47","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans. Evol. Comput. 3(4), 257\u2013271 (1999)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-013-0069-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-013-0069-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-013-0069-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T05:25:02Z","timestamp":1745990702000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-013-0069-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,18]]},"references-count":47,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["69"],"URL":"https:\/\/doi.org\/10.1007\/s10898-013-0069-7","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2013,4,18]]}}}