{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T16:14:39Z","timestamp":1759940079018},"reference-count":55,"publisher":"Oxford University Press (OUP)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1093\/comjnl\/bxv055","type":"journal-article","created":{"date-parts":[[2015,7,24]],"date-time":"2015-07-24T19:58:29Z","timestamp":1437767909000},"page":"384-402","source":"Crossref","is-referenced-by-count":3,"title":["A Comparative Study of Different Motif Occurrence Models Applied to a Hybrid Multiobjective Shuffle Frog Leaping Algorithm"],"prefix":"10.1093","volume":"59","author":[{"given":"David L.","family":"Gonz\u00e1lez-\u00c1lvarez","sequence":"first","affiliation":[]},{"given":"Miguel A.","family":"Vega-Rodr\u00edguez","sequence":"additional","affiliation":[]},{"given":"\u00c1lvaro","family":"Rubio-Largo","sequence":"additional","affiliation":[]}],"member":"286","published-online":{"date-parts":[[2015,7,23]]},"reference":[{"key":"2016030207390824000_59.3.384.1","doi-asserted-by":"publisher","DOI":"10.1038\/nbt0406-423"},{"key":"2016030207390824000_59.3.384.2","doi-asserted-by":"publisher","DOI":"10.1266\/ggs.84.81"},{"key":"2016030207390824000_59.3.384.3","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2002.1823"},{"key":"2016030207390824000_59.3.384.4","doi-asserted-by":"crossref","unstructured":"Che Y. , Song D. and Rashedd K. (2005) MDGA: Motif Discovery Using a Genetic Algorithm. Proc. 2005 Conf. Genetic and Evolutionary Computation (GECCO'05), pp. 447\u2013452.","DOI":"10.1145\/1068009.1068080"},{"key":"2016030207390824000_59.3.384.5","doi-asserted-by":"crossref","unstructured":"Liu F.F.M. , Tsai J.J.P. , Chen R.M. , Chen S.N. and Shih S.H. (2004) FMGA: Finding Motifs by Genetic Algorithm. 4th IEEE Symp. Bioinformatics and Bioengineering (BIBE'04), pp. 459\u2013466.","DOI":"10.1109\/BIBE.2004.1317378"},{"key":"2016030207390824000_59.3.384.6","doi-asserted-by":"crossref","unstructured":"Paul T.K. and Iba H. (2006) Identification of Weak Motifs in Multiple Biological Sequences Using Genetic Algorithm. Proc. 2006 Conference on Genetic and Evolutionary Computation (GECCO'06), pp. 271\u2013278.","DOI":"10.1145\/1143997.1144044"},{"key":"2016030207390824000_59.3.384.7","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1061\/(ASCE)0733-9496(2003)129:3(210)","article-title":"Optimization of water distribution network design using the shuffled frog-leaping algorithm","volume":"129","author":"Eusuff","year":"2003","journal-title":"J. Water Resour. Plan. Manage."},{"key":"2016030207390824000_59.3.384.8","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2011.2171972"},{"key":"2016030207390824000_59.3.384.9","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl147"},{"key":"2016030207390824000_59.3.384.10","doi-asserted-by":"crossref","unstructured":"Chan T.-K. , Leung K.-S. , Lee K.-H. and Li\u00f2 P. (2010) Generic Spaced DNA Motif Discovery Using Genetic Algorithm. IEEE Congress on Evolutionary Computation (CEC'10), pp. 1\u20138.","DOI":"10.1109\/CEC.2010.5585924"},{"key":"2016030207390824000_59.3.384.11","doi-asserted-by":"publisher","DOI":"10.1006\/jmbi.2000.3519"},{"key":"2016030207390824000_59.3.384.12","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkp335"},{"key":"2016030207390824000_59.3.384.13","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkl285"},{"key":"2016030207390824000_59.3.384.14","doi-asserted-by":"publisher","DOI":"10.1006\/jmbi.1998.1947"},{"key":"2016030207390824000_59.3.384.15","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/28.8.1808"},{"key":"2016030207390824000_59.3.384.16","doi-asserted-by":"crossref","first-page":"S354","DOI":"10.1093\/bioinformatics\/18.suppl_1.S354","article-title":"Finding composite regulatory patterns in DNA sequences","volume":"18 (Suppl. 1)","author":"Eskin","year":"2002","journal-title":"Bioinformatics"},{"key":"2016030207390824000_59.3.384.17","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkg618"},{"key":"2016030207390824000_59.3.384.18","first-page":"191","article-title":"Rare events and conditional events on random strings","volume":"6","author":"Regnier","year":"2004","journal-title":"Discret. Math. Theor. Comput. Sci."},{"key":"2016030207390824000_59.3.384.19","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/15.7.563"},{"key":"2016030207390824000_59.3.384.20","doi-asserted-by":"publisher","DOI":"10.1126\/science.1102216"},{"key":"2016030207390824000_59.3.384.21","first-page":"467","article-title":"ANN-Spec: a method for discovering transcription factor binding sites with improved specificity","volume":"5","author":"Workman","year":"2000","journal-title":"Pac. Symp. Biocomput."},{"key":"2016030207390824000_59.3.384.22","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/17.12.1113"},{"key":"2016030207390824000_59.3.384.23","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkh169"},{"key":"2016030207390824000_59.3.384.24","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti336"},{"key":"2016030207390824000_59.3.384.25","doi-asserted-by":"publisher","DOI":"10.1038\/nbt1053"},{"key":"2016030207390824000_59.3.384.26","unstructured":"Fogel G.B. and Corne D.W. (2003) Evolutionary Computation in Bioinformatics. The Morgan Kaufmann Series in Artificial Intelligence, pp. 1\u2013393."},{"key":"2016030207390824000_59.3.384.27","doi-asserted-by":"crossref","unstructured":"Lones M.A. and Tyrrell A.M. (2005) The Evolutionary Computation Approach to Motif Discovery in Biological Sequences. Proc. Workshops GECCO, pp. 1\u201311.","DOI":"10.1145\/1102256.1102258"},{"key":"2016030207390824000_59.3.384.28","unstructured":"Holland J.H. (1975) Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor."},{"key":"2016030207390824000_59.3.384.29","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/24.8.1515"},{"key":"2016030207390824000_59.3.384.30","doi-asserted-by":"crossref","unstructured":"Stine M. , Dasgupta D. and Mukatira S. (2003) Motif Discovery in Upstream Sequences of Coordinately Expressed Genes. The 2003 Congress on Evolutionary Computation (CEC'03), pp. 1596\u20131603.","DOI":"10.1109\/CEC.2003.1299863"},{"key":"2016030207390824000_59.3.384.31","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btm606"},{"key":"2016030207390824000_59.3.384.32","doi-asserted-by":"crossref","unstructured":"Shao L. and Chen Y. (2009) Bacterial Foraging Optimization Algorithm Integrating Tabu Search for Motif Discovery. IEEE Int. Conf. Bioinformatics and Biomedicine (BIBM'09), pp. 415\u2013418.","DOI":"10.1109\/BIBM.2009.12"},{"key":"2016030207390824000_59.3.384.33","doi-asserted-by":"crossref","unstructured":"Shao L. , Chen Y. and Abraham A. (2009) Motif Discovery Using Evolutionary Algorithms. Inte. Conf. Soft Computing and Pattern Recognition (SOCPAR'09), pp. 420\u2013425.","DOI":"10.1109\/SoCPaR.2009.88"},{"key":"2016030207390824000_59.3.384.34","doi-asserted-by":"publisher","DOI":"10.1109\/tcbb.2007.1044"},{"key":"2016030207390824000_59.3.384.35","unstructured":"Li G. , Chan T.-M. , Leung K.-S. and Lee K.-H. (2008) An Estimation of Distribution Algorithm for Motif Discovery. IEEE Congress on Evolutionary Computation (CEC'08), pp. 2411\u20132418."},{"key":"2016030207390824000_59.3.384.36","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkh713"},{"key":"2016030207390824000_59.3.384.37","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkm888"},{"key":"2016030207390824000_59.3.384.38","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2007.11.008"},{"key":"2016030207390824000_59.3.384.39","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1109\/TSMCC.2011.2172939","article-title":"Predicting DNA motifs by using evolutionary multiobjective optimization","volume":"42","author":"Gonz\u00e1lez-\u00c1lvarez","year":"2012","journal-title":"IEEE Trans. Syst. Man Cybern. C: Appl. Rev."},{"key":"2016030207390824000_59.3.384.40","first-page":"341","article-title":"Comparing multiobjective swarm intelligence metaheuristics for DNA motif discovery","volume":"26","author":"Gonz\u00e1lez-\u00c1lvarez","year":"2012","journal-title":"Eng. Appl. Artif. Intell."},{"key":"2016030207390824000_59.3.384.41","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-013-0069-7"},{"key":"2016030207390824000_59.3.384.42","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-013-1103-x"},{"key":"2016030207390824000_59.3.384.43","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-013-0951-6"},{"key":"2016030207390824000_59.3.384.44","doi-asserted-by":"crossref","unstructured":"Gonz\u00e1lez-\u00c1lvarez D.L. and Vega-Rodr\u00edguez M.A. (2013) A Multiobjective sfla-based Technique for Predicting Motifs in dna Sequences. Computer Aided Systems Theory, Lecture Notes in Computer Science 8111, pp. 235\u2013242.","DOI":"10.1007\/978-3-642-53856-8_30"},{"key":"2016030207390824000_59.3.384.45","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2008.16TT"},{"key":"2016030207390824000_59.3.384.46","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"2016030207390824000_59.3.384.47","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-8-193"},{"key":"2016030207390824000_59.3.384.48","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.bb.17.060188.001325"},{"key":"2016030207390824000_59.3.384.49","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/29.14.2905"},{"key":"2016030207390824000_59.3.384.50","doi-asserted-by":"publisher","DOI":"10.1006\/jmbi.2001.4650"},{"key":"2016030207390824000_59.3.384.51","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkj116"},{"key":"2016030207390824000_59.3.384.52","unstructured":"Sheskin D.J. (2011) Handbook of Parametric and Nonparametric Statistical Procedures (5th ed). Chapman & Hall\/CRC Press, New York."},{"key":"2016030207390824000_59.3.384.53","doi-asserted-by":"crossref","unstructured":"Lo L.-Y. , Chan T.-M. , Lee K.-H. and Leung K.-S. (2010) Challenges Rising from Learning Motif Evaluation Functions using Genetic Programming. Proc. 2010 Conf. Genetic and Evolutionary Computation (GECCO'10), pp. 171\u2013178.","DOI":"10.1145\/1830483.1830515"},{"key":"2016030207390824000_59.3.384.54","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/24.1.238"},{"key":"2016030207390824000_59.3.384.55","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btr189"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/59\/3\/384\/7902557\/bxv055.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,25]],"date-time":"2017-08-25T00:07:07Z","timestamp":1503619627000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxv055"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,23]]},"references-count":55,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2016,3,2]]},"published-print":{"date-parts":[[2016,3]]}},"alternative-id":["10.1093\/comjnl\/bxv055"],"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxv055","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,23]]}}}