{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T19:19:44Z","timestamp":1774293584645,"version":"3.50.1"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"14","license":[{"start":{"date-parts":[[2019,11,25]],"date-time":"2019-11-25T00:00:00Z","timestamp":1574640000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,25]],"date-time":"2019-11-25T00:00:00Z","timestamp":1574640000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s00521-019-04611-0","type":"journal-article","created":{"date-parts":[[2019,11,25]],"date-time":"2019-11-25T09:05:36Z","timestamp":1574672736000},"page":"10759-10771","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":83,"title":["A modified Henry gas solubility optimization for solving motif discovery problem"],"prefix":"10.1007","volume":"32","author":[{"given":"Fatma A.","family":"Hashim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8127-7233","authenticated-orcid":false,"given":"Essam H.","family":"Houssein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kashif","family":"Hussain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mai S.","family":"Mabrouk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walid","family":"Al-Atabany","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,25]]},"reference":[{"issue":"3","key":"4611_CR1","doi-asserted-by":"crossref","first-page":"1575","DOI":"10.3934\/mbe.2019075","volume":"16","author":"SA Gohardani","year":"2019","unstructured":"Gohardani SA, Bagherian M, Vaziri H (2019) A multi-objective imperialist competitive algorithm (moica) for finding motifs in dna sequences. Math Biosci Eng MBE 16(3):1575","journal-title":"Math Biosci Eng MBE"},{"issue":"2","key":"4611_CR2","first-page":"130","volume":"11","author":"FA Hashim","year":"2019","unstructured":"Hashim FA, Mabrouk MS, Atabany WAL (2019) Review of different sequence motif finding algorithms. Avicenna J Med Biotechnol 11(2):130\u2013148","journal-title":"Avicenna J Med Biotechnol"},{"key":"4611_CR3","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2018.2872978","author":"S Som-in","year":"2018","unstructured":"Som-in S, Kimpan W (2018) Enhancing of particle swarm optimization based method for multiple motifs detection in DNA sequences collections. IEEE ACM Trans Comput Biol Bioinform. https:\/\/doi.org\/10.1109\/TCBB.2018.2872978","journal-title":"IEEE ACM Trans Comput Biol Bioinform"},{"key":"4611_CR4","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.ins.2018.07.004","volume":"466","author":"NK Lee","year":"2018","unstructured":"Lee NK, Li X, Wang D (2018) A comprehensive survey on genetic algorithms for dna motif prediction. Inf Sci 466:25\u201343","journal-title":"Inf Sci"},{"issue":"2","key":"4611_CR5","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/322063.322075","volume":"25","author":"D Maier","year":"1978","unstructured":"Maier D (1978) The complexity of some problems on subsequences and supersequences. J ACM 25(2):322\u2013336","journal-title":"J ACM"},{"issue":"2","key":"4611_CR6","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/j.jda.2007.06.001","volume":"6","author":"R Rivi\u00e8re","year":"2008","unstructured":"Rivi\u00e8re R, Barth D, Cohen J, Denise A (2008) Shuffling biological sequences with motif constraints. J Discrete Algorithms 6(2):192\u2013204","journal-title":"J Discrete Algorithms"},{"issue":"4","key":"4611_CR7","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1504\/IJCBDD.2009.030764","volume":"2","author":"C Lei","year":"2009","unstructured":"Lei C, Ruan J (2009) A novel swarm intelligence algorithm for finding dna motifs. Int J Comput Biol Drug Design 2(4):323","journal-title":"Int J Comput Biol Drug Design"},{"key":"4611_CR8","doi-asserted-by":"crossref","unstructured":"Shao L, Chen Y (2009) Bacterial foraging optimization algorithm integrating Tabu search for motif discovery. In: 2009 IEEE international conference on bioinformatics and biomedicine. pp 415\u2013418. IEEE","DOI":"10.1109\/BIBM.2009.12"},{"key":"4611_CR9","doi-asserted-by":"crossref","unstructured":"Hashim F, Mabrouk MS, Al-Atabany W (2017) Gwomf: grey wolf optimization for motif finding. In 2017 13th international computer engineering conference (ICENCO)","DOI":"10.1109\/ICENCO.2017.8289778"},{"key":"4611_CR10","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1016\/j.future.2019.07.015","volume":"101","author":"FA Hashim","year":"2019","unstructured":"Hashim FA, Houssein EH, Mabrouk MS, Al-Atabany W, Mirjalili S (2019) Henry gas solubility optimization: a novel physics-based algorithm. Future Gener Comput Syst 101:646\u2013667","journal-title":"Future Gener Comput Syst"},{"key":"4611_CR11","unstructured":"Bailey TL, Elkan C (1995) The value of prior knowledge in discovering motifs with meme. In: Ismb, vol 3, pp 21\u201329"},{"issue":"12","key":"4611_CR12","doi-asserted-by":"crossref","first-page":"1653","DOI":"10.1093\/bioinformatics\/btr261","volume":"27","author":"TL Bailey","year":"2011","unstructured":"Bailey TL (2011) Dreme: motif discovery in transcription factor chip-seq data. Bioinformatics 27(12):1653\u20131659","journal-title":"Bioinformatics"},{"issue":"1","key":"4611_CR13","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1101\/gr.139881.112","volume":"23","author":"H Holger","year":"2013","unstructured":"Holger H, Guth\u00f6hrlein EW, Siebert M, Luehr S, S\u00f6ding J (2013) P-value-based regulatory motif discovery using positional weight matrices. Genome Res 23(1):181\u2013194","journal-title":"Genome Res"},{"key":"4611_CR14","first-page":"51","volume":"2","author":"US Reddy","year":"2010","unstructured":"Reddy US, Arock M, Reddy AV (2010) Planted (l, d)-motif finding using particle swarm optimization. IJCA Special Issue ECQT 2:51\u201356","journal-title":"IJCA Special Issue ECQT"},{"key":"4611_CR15","doi-asserted-by":"crossref","unstructured":"Elewa ES, Abdelhalim MB, Mabrouk MS (2014) Adaptation of cuckoo search algorithm for the motif finding problem. In: 2014 10th international computer engineering conference (ICENCO). IEEE, pp 87\u201391","DOI":"10.1109\/ICENCO.2014.7050437"},{"key":"4611_CR16","first-page":"9127474","volume":"2016","author":"Y Zhang","year":"2016","unstructured":"Zhang Y, Wang P, Yan M (2016) An entropy-based position projection algorithm for motif discovery. BioMed Res Int 2016:9127474","journal-title":"BioMed Res Int"},{"issue":"13","key":"4611_CR17","doi-asserted-by":"crossref","first-page":"3586","DOI":"10.1093\/nar\/gkg618","volume":"31","author":"S Sinha","year":"2003","unstructured":"Sinha S, Tompa M (2003) Ymf: a program for discovery of novel transcription factor binding sites by statistical overrepresentation. Nucleic Acids Res 31(13):3586\u20133588","journal-title":"Nucleic Acids Res"},{"issue":"suppl\u20132","key":"4611_CR18","doi-asserted-by":"crossref","first-page":"W199","DOI":"10.1093\/nar\/gkh465","volume":"32","author":"G Pavesi","year":"2004","unstructured":"Pavesi G, Mereghetti P, Mauri G, Pesole G (2004) Weeder web: discovery of transcription factor binding sites in a set of sequences from co-regulated genes. Nucleic Acids Res 32(suppl\u20132):W199\u2013W203","journal-title":"Nucleic Acids Res"},{"issue":"5","key":"4611_CR19","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1109\/TNB.2015.2421340","volume":"14","author":"Y Qiang","year":"2015","unstructured":"Qiang Y, Huo H, Chen X, Guo H, Vitter JS, Huan J (2015) An efficient algorithm for discovering motifs in large dna data sets. IEEE Trans Nanobiosci 14(5):535\u2013544","journal-title":"IEEE Trans Nanobiosci"},{"issue":"18","key":"4611_CR20","doi-asserted-by":"crossref","first-page":"e126","DOI":"10.1093\/nar\/gkr574","volume":"39","author":"JE Reid","year":"2011","unstructured":"Reid JE, Wernisch L (2011) Steme: efficient em to find motifs in large data sets. Nucleic Acids Res 39(18):e126\u2013e126","journal-title":"Nucleic Acids Res"},{"issue":"12","key":"4611_CR21","doi-asserted-by":"crossref","first-page":"1667","DOI":"10.1093\/bioinformatics\/btu093","volume":"30","author":"D Quang","year":"2014","unstructured":"Quang D, Xie X (2014) Extreme: an online em algorithm for motif discovery. Bioinformatics 30(12):1667\u20131673","journal-title":"Bioinformatics"},{"issue":"5","key":"4611_CR22","doi-asserted-by":"crossref","first-page":"1205","DOI":"10.1006\/jmbi.2000.3519","volume":"296","author":"JD Hughes","year":"2000","unstructured":"Hughes JD, Estep PW, Tavazoie S, Church GM (2000) Computational identification of cis-regulatory elements associated with groups of functionally related genes in saccharomyces cerevisiae. J Mol Biol 296(5):1205\u20131214","journal-title":"J Mol Biol"},{"key":"4611_CR23","doi-asserted-by":"crossref","unstructured":"Liu X, Brutlag DL, Liu JS (2000) Bioprospector: discovering conserved dna motifs in upstream regulatory regions of co-expressed genes. In Biocomputing 2001. World Scientific, pp 127\u2013138","DOI":"10.1142\/9789814447362_0014"},{"issue":"5","key":"4611_CR24","first-page":"261","volume":"16","author":"AA Sharov","year":"2009","unstructured":"Sharov AA, Ko MSH (2009) Exhaustive search for over-represented dna sequence motifs with cisfinder. J Mol Biol 16(5):261\u2013273","journal-title":"J Mol Biol"},{"issue":"4","key":"4611_CR25","doi-asserted-by":"crossref","first-page":"e31","DOI":"10.1093\/nar\/gkr1104","volume":"40","author":"M Thomas-Chollier","year":"2011","unstructured":"Thomas-Chollier M, Herrmann C, Defrance M, Sand O, Thieffry D, van Helden J (2011) Rsat peak-motifs: motif analysis in full-size chip-seq datasets. Nucleic Acids Res 40(4):e31","journal-title":"Nucleic Acids Res"},{"issue":"1","key":"4611_CR26","first-page":"1","volume":"9","author":"C Jia","year":"2014","unstructured":"Jia C, Carson MB, Wang Y, Lin Y, Lu H (2014) A new exhaustive method and strategy for finding motifs in chip-enriched regions. PLOS ONE 9(1):1\u201313","journal-title":"PLOS ONE"},{"key":"4611_CR27","unstructured":"Pevzner PA, Sze SH et\u00a0al (2000) Combinatorial approaches to finding subtle signals in dna sequences. In: ISMB, vol 8, pp 269\u2013278"},{"key":"4611_CR28","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/978-3-540-30213-1_40","volume-title":"String processing and information retrieval","author":"RV Satya","year":"2004","unstructured":"Satya RV, Mukherjee A (2004) New algorithms for finding monad patterns in dna sequences. In: Apostolico A, Melucci M (eds) String processing and information retrieval. Springer, Berlin, pp 273\u2013285"},{"key":"4611_CR29","doi-asserted-by":"crossref","unstructured":"Liang S (2003) Cwinnower algorithm for finding fuzzy dna motifs. In: Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE bioinformatics conference (CSB2003), pp 260\u2013265","DOI":"10.1109\/CSB.2003.1227326"},{"issue":"2","key":"4611_CR30","first-page":"225","volume":"9","author":"B Jeremy","year":"2001","unstructured":"Jeremy B, Martin T (2001) Finding motifs using random projections. J Comput Biol 9(2):225\u2013242","journal-title":"J Comput Biol"},{"issue":"2","key":"4611_CR31","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1109\/TCBB.2004.14","volume":"1","author":"B Raphael","year":"2004","unstructured":"Raphael B, Liu L-T, Varghese G (2004) A uniform projection method for motif discovery in dna sequences. IEEE\/ACM Trans Comput Biol Bioinform 1(2):91\u201394","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"issue":"1","key":"4611_CR32","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1214\/088342304000000107","volume":"19","author":"T Jensen Shane","year":"2004","unstructured":"Jensen Shane T, Shirley LX, Qing Z, Liu Jun S (2004) Computational discovery of gene regulatory binding motifs: a Bayesian perspective. Stat Sci 19(1):188\u2013204","journal-title":"Stat Sci"},{"key":"4611_CR33","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.ins.2013.02.041","volume":"237","author":"I Boussa\u00efD","year":"2013","unstructured":"Boussa\u00efD I, Lepagnot J, Siarry P (2013) A survey on optimization metaheuristics. Inf. Sci. 237:82\u2013117","journal-title":"Inf. Sci."},{"key":"4611_CR34","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/978-3-642-29066-4_10","volume-title":"Evolutionary computation, machine learning and data mining in bioinformatics","author":"DL Gonz\u00e1lez-\u00c1lvarez","year":"2012","unstructured":"Gonz\u00e1lez-\u00c1lvarez DL, Vega-Rodr\u00edguez MA, G\u00f3mez-Pulido JA, S\u00e1nchez-P\u00e9rez JM (2012) Comparing multiobjective artificial bee colony adaptations for discovering dna motifs. In: Giacobini M, Vanneschi L, Bush WS (eds) Evolutionary computation, machine learning and data mining in bioinformatics. Springer, Berlin, pp 110\u2013121"},{"issue":"15","key":"4611_CR35","first-page":"7","volume":"120","author":"M Vilas","year":"2015","unstructured":"Vilas M, Patel Maulika S, Jyoti D (2015) Motif finding with application to the transcription factor binding sites problem. Int J Comput Appl 120(15):7\u201310","journal-title":"Int J Comput Appl"},{"issue":"3","key":"4611_CR36","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1109\/TEVC.2009.2033580","volume":"14","author":"AYS Lam","year":"2010","unstructured":"Lam AYS, Li VOK (2010) Chemical-reaction-inspired metaheuristic for optimization. IEEE Trans Evol Comput 14(3):381\u2013399","journal-title":"IEEE Trans Evol Comput"},{"issue":"5","key":"4611_CR37","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1006\/jmbi.1998.1947","volume":"281","author":"J van Helden","year":"1998","unstructured":"van Helden J, Andr\u00e9 B, Collado-Vides J (1998) Extracting regulatory sites from the upstream region of yeast genes by computational analysis of oligonucleotide frequencies 11 edited by g. von Heijne. J Mol Biol 281(5):827\u2013842","journal-title":"J Mol Biol"},{"issue":"7","key":"4611_CR38","doi-asserted-by":"crossref","first-page":"e50","DOI":"10.1093\/nar\/gkr1135","volume":"40","author":"X Ma","year":"2011","unstructured":"Ma X, Kulkarni A, Zhang Z, Xuan Z, Serfling R, Zhang MQ (2011) A highly efficient and effective motif discovery method for chip-seq\/chip-chip data using positional information. Nucleic Acids Res 40(7):e50","journal-title":"Nucleic Acids Res"},{"issue":"1","key":"4611_CR39","first-page":"S207","volume":"17","author":"P Giulio","year":"2001","unstructured":"Giulio P, Giancarlo M, MauriGraziano P (2001) An algorithm for finding signals of unknown length in dna sequences. Bioinformatics 17(1):S207\u2013S214","journal-title":"Bioinformatics"},{"issue":"1","key":"4611_CR40","first-page":"S354","volume":"18","author":"E Eleazar","year":"2002","unstructured":"Eleazar E, Pevzner Pavel A (2002) Finding composite regulatory patterns in dna sequences. Bioinformatics 18(1):S354\u2013S363","journal-title":"Bioinformatics"},{"issue":"W1","key":"4611_CR41","doi-asserted-by":"crossref","first-page":"W174","DOI":"10.1093\/nar\/gkt407","volume":"41","author":"L Limor","year":"2013","unstructured":"Limor L, Inbal P, Zohar Y, Yael M-G (2013) Drimust: a web server for discovering rank imbalanced motifs using suffix trees. Nucleic Acids Res 41(W1):W174\u2013W179","journal-title":"Nucleic Acids Res"},{"key":"4611_CR42","unstructured":"Sun HQ, Low MY, Hsu WJ, Rajapakse JC (2010) Listmotif: a time and memory efficient algorithm for weak motif discovery. In: 2010 IEEE international conference on intelligent systems and knowledge engineering, pp 254\u2013260"},{"issue":"8","key":"4611_CR43","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.1089\/cmb.2005.12.1117","volume":"12","author":"S Rajasekaran","year":"2005","unstructured":"Rajasekaran S, Balla S, Huang C-H (2005) Exact algorithms for planted motif problems. J Comput Biol 12(8):1117\u20131128","journal-title":"J Comput Biol"},{"key":"4611_CR44","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/978-3-540-48540-7_17","volume-title":"Systems biology and regulatory genomics","author":"SH Sze","year":"2006","unstructured":"Sze SH, Zhao X (2006) Improved pattern-driven algorithms for motif finding in dna sequences. In: Eskin E, Ideker T, Raphael B, Workman C (eds) Systems biology and regulatory genomics. Springer, Berlin, pp 198\u2013211"},{"key":"4611_CR45","doi-asserted-by":"crossref","first-page":"822","DOI":"10.1007\/11758525_110","volume-title":"Computational science\u2014ICCS 2006","author":"J Davila","year":"2006","unstructured":"Davila J, Balla S, Rajasekaran S (2006) Space and time efficient algorithms for planted motif search. In: Alexandrov VN, van Albada GD, Sloot PMA, Dongarra J (eds) Computational science\u2014ICCS 2006. Springer, Berlin, pp 822\u2013829"},{"issue":"10","key":"4611_CR46","doi-asserted-by":"crossref","first-page":"e48442","DOI":"10.1371\/journal.pone.0048442","volume":"7","author":"Y Qiang","year":"2012","unstructured":"Qiang Y, Hongwei H, Yipu Z, Hongzhi G (2012) Pairmotif: a new pattern-driven algorithm for planted (l, d) dna motif search. PLoS ONE 7(10):e48442","journal-title":"PLoS ONE"},{"issue":"4","key":"4611_CR47","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1109\/TCBB.2007.70241","volume":"4","author":"D Jaime","year":"2007","unstructured":"Jaime D, Sudha B, Sanguthevar R (2007) Fast and practical algorithms for planted (l, d) motif search. IEEE\/ACM Trans Comput Biol Bioinform 4(4):544\u2013552","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"issue":"10","key":"4611_CR48","first-page":"e41425","volume":"7","author":"D Jaime","year":"2012","unstructured":"Jaime D, Dinh H, Sanguthevar R (2012) A fast algorithm for finding (l, d)-motifs in dna and protein sequences. PLoS ONE 7(10):e41425","journal-title":"PLoS ONE"},{"issue":"2","key":"4611_CR49","first-page":"103","volume":"2","author":"W Huihai","year":"2013","unstructured":"Huihai W, Wong PWH, Caddick MX, Sibthorp C (2013) Finding dna regulatory motifs with position-dependent models. J Med Bioeng 2(2):103\u2013109","journal-title":"J Med Bioeng"},{"issue":"5131","key":"4611_CR50","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1126\/science.8211139","volume":"262","author":"CE Lawrence","year":"1993","unstructured":"Lawrence CE, Altschul SF, Boguski MS, Liu JS, Neuwald AF, Wootton JC (1993) Detecting subtle sequence signals: a gibbs sampling strategy for multiple alignment. Science 262(5131):208\u2013214","journal-title":"Science"},{"issue":"2","key":"4611_CR51","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1089\/10665270252935566","volume":"9","author":"G Thijs","year":"2002","unstructured":"Thijs G, Marchal K, Lescot M, Rombauts S, De Moor B, Rouz\u00e9 P, Moreau Y (2002) A gibbs sampling method to detect overrepresented motifs in the upstream regions of coexpressed genes. J Comput Biol 9(2):447\u2013464","journal-title":"J Comput Biol"},{"issue":"01","key":"4611_CR52","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1142\/S0219720004000508","volume":"02","author":"EP Xing","year":"2004","unstructured":"Xing EP, Wu W, Jordan MI, Karp RM (2004) Logos: a modular Bayesian model for de novo motif detection. J Bioinform Comput Biol 02(01):127\u2013154","journal-title":"J Bioinform Comput Biol"},{"key":"4611_CR53","doi-asserted-by":"crossref","first-page":"6055","DOI":"10.1093\/nar\/gkw521","volume":"44","author":"M Siebert","year":"2016","unstructured":"Siebert M, S\u00f6ding J (2016) Bayesian markov models consistently outperform pwms at predicting motifs in nucleotide sequences. Nucleic Acids Res. 44:6055\u20136069","journal-title":"Nucleic Acids Res."},{"key":"4611_CR54","doi-asserted-by":"crossref","unstructured":"Congdon CB, Fizer CW, Smith NW, Gaskins HR, Aman J, Nava GM, Mattingly C (2005) 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, p 12","DOI":"10.1109\/CIBCB.2005.1594904"},{"key":"4611_CR55","doi-asserted-by":"crossref","unstructured":"Liu FF, Tsai JJ, Chen RM, Chen SN, Shih SH (2004) Fmga: finding motifs by genetic algorithm. In: Proceedings 4th IEEE symposium on bioinformatics and bioengineering, pp 459\u2013466","DOI":"10.1109\/BIBE.2004.1317378"},{"key":"4611_CR56","doi-asserted-by":"crossref","unstructured":"Che D, Song Y, Rasheed K (2005) Mdga: motif discovery using a genetic algorithm. In: GECCO\u201905: proceedings of the 2005 conference on Genetic and evolutionary computation, pp 447\u2013452","DOI":"10.1145\/1068009.1068080"},{"key":"4611_CR57","doi-asserted-by":"crossref","unstructured":"Verma RS, Sanjay K (2012) Dsapso: DNA sequence assembly using continuous particle swarm optimization with smallest position value rule. In: 2012 1st international conference on recent advances in information technology (RAIT)","DOI":"10.1109\/RAIT.2012.6194455"},{"key":"4611_CR58","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/978-3-642-37189-9_7","volume-title":"Evolutionary computation, machine learning and data mining in bioinformatics","author":"DL Gonz\u00e1lez-\u00c1lvarez","year":"2013","unstructured":"Gonz\u00e1lez-\u00c1lvarez DL, Vega-Rodr\u00edguez MA (2013) Hybrid multiobjective artificial bee colony with differential evolution applied to motif finding. In: Vanneschi L, Bush WS, Giacobini M (eds) Evolutionary computation, machine learning and data mining in bioinformatics. Springer, Berlin, pp 68\u201379"},{"issue":"2","key":"4611_CR59","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4238\/gmr.15028645","volume":"15","author":"D Karaboga","year":"2016","unstructured":"Karaboga D, Aslan S (2016) A discrete artificial bee colony algorithm for detecting transcription factor binding sites in dna sequences. Genet Mol Res 15(2):1\u201311","journal-title":"Genet Mol Res"},{"key":"4611_CR60","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1007\/978-3-642-15461-4_45","volume-title":"Swarm intelligence","author":"S Bouamama","year":"2010","unstructured":"Bouamama S, Boukerram A, Al-Badarneh AF (2010) Motif finding using ant colony optimization. In: Dorigo M, Birattari M, Di Caro GA, Doursat R, Engelbrecht AP, Floreano D, Gambardella LM, Gro\u00df R, \u015eahin E, Sayama H, St\u00fctzle T (eds) Swarm intelligence. Springer, Berlin, pp 464\u2013471"},{"key":"4611_CR61","doi-asserted-by":"crossref","unstructured":"Elewa Ebtehal S, Abdelhalim MB, Mabrouk Mai S (2014) Adaptation of cuckoo search algorithm for the motif finding problem. In: 2014 10th international computer engineering conference (ICENCO), pp 87\u201391","DOI":"10.1109\/ICENCO.2014.7050437"},{"issue":"suppl\u20131","key":"4611_CR62","doi-asserted-by":"crossref","first-page":"D63","DOI":"10.1093\/nar\/gkj116","volume":"34","author":"E Blanco","year":"2006","unstructured":"Blanco E, Farre D, Mar Alba M, Messeguer X, Guigo R (2006) Abs: a database of annotated regulatory binding sites from orthologous promoters. Nucleic Acids Res 34(suppl\u20131):D63\u2013D67","journal-title":"Nucleic Acids Res"},{"key":"4611_CR63","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.plrev.2004.01.002","volume":"1","author":"C Adami","year":"2004","unstructured":"Adami C (2004) Information theory in molecular biology. Phys Life Rev 1:3\u201322","journal-title":"Phys Life Rev"},{"issue":"1","key":"4611_CR64","doi-asserted-by":"crossref","first-page":"159","DOI":"10.2307\/2529310","volume":"33","author":"JR Landis","year":"1977","unstructured":"Landis JR, Koch GG (1977) The measurement of observer agreement for categorical data. Biometrics 33(1):159\u2013174","journal-title":"Biometrics"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-019-04611-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-019-04611-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-019-04611-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,6]],"date-time":"2022-10-06T21:27:21Z","timestamp":1665091641000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-019-04611-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,25]]},"references-count":64,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["4611"],"URL":"https:\/\/doi.org\/10.1007\/s00521-019-04611-0","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,25]]},"assertion":[{"value":"31 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 November 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}