{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T15:32:48Z","timestamp":1749915168271,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,3,21]],"date-time":"2024-03-21T00:00:00Z","timestamp":1710979200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,21]],"date-time":"2024-03-21T00:00:00Z","timestamp":1710979200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["Nos.62272418,62102058"],"award-info":[{"award-number":["Nos.62272418,62102058"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100017577","name":"Basic public welfare research program of Zhejiang Province","doi-asserted-by":"crossref","award":["No.LGG18E050011"],"award-info":[{"award-number":["No.LGG18E050011"]}],"id":[{"id":"10.13039\/501100017577","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1007\/s12065-024-00924-9","type":"journal-article","created":{"date-parts":[[2024,3,21]],"date-time":"2024-03-21T13:01:36Z","timestamp":1711026096000},"page":"3015-3029","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Enhanced DNA sequence design with learning PSO"],"prefix":"10.1007","volume":"17","author":[{"given":"Huichuang","family":"Wu","sequence":"first","affiliation":[]},{"given":"Donglin","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Zuwei","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Lin","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Changjun","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,21]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Adleman, Leonard M. \"Molecular computation of solutions to combinatorial problems.\"\u00a0science\u00a0266.5187 (1994): 1021\u20131024. Lipton, Richard J. \"DNA solution of hard computational problems.\"\u00a0science\u00a0268.5210 (1995): 542\u2013545.","key":"924_CR1","DOI":"10.1126\/science.7973651"},{"issue":"5210","key":"924_CR2","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1126\/science.7725098","volume":"268","author":"RJ Lipton","year":"1995","unstructured":"Lipton RJ (1995) DNA solution of hard computational problems. Science 268(5210):542\u2013545","journal-title":"Science"},{"issue":"5337","key":"924_CR3","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1126\/science.278.5337.446","volume":"278","author":"Q Ouyang","year":"1997","unstructured":"Ouyang Q et al (1997) DNA solution of the maximal clique problem. Science 278(5337):446\u2013449","journal-title":"Science"},{"issue":"6766","key":"924_CR4","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1038\/35003155","volume":"403","author":"Q Liu","year":"2000","unstructured":"Liu Q et al (2000) DNA computing on surfaces. Nature 403(6766):175\u2013179","journal-title":"Nature"},{"key":"924_CR5","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1023\/B:NACO.0000036818.27537.c9","volume":"3","author":"MH Garzon","year":"2004","unstructured":"Garzon MH, Deaton RJ (2004) Codeword design and information encoding in DNA ensembles. Nat Comput 3:253\u2013292","journal-title":"Nat Comput"},{"issue":"4","key":"924_CR6","first-page":"298","volume":"2","author":"K Liu","year":"2019","unstructured":"Liu K, Wang B (2019) Designing DNA code: quantity and quality. Int J Adap Innov Syst 2(4):298\u2013323","journal-title":"Int J Adap Innov Syst"},{"issue":"4598","key":"924_CR7","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD Jr, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"doi-asserted-by":"crossref","unstructured":"Holland JH (1984) Genetic algorithms and adaptation. Adapt Control Ill-Defin Syst 317\u2013333.","key":"924_CR8","DOI":"10.1007\/978-1-4684-8941-5_21"},{"issue":"4","key":"924_CR9","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/MCI.2006.329691","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization. IEEE Comput Intell Mag 1(4):28\u201339","journal-title":"IEEE Comput Intell Mag"},{"doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of ICNN'95-international conference on neural networks. Vol. 4. IEEE.","key":"924_CR10","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"2","key":"924_CR11","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1109\/TEVC.2005.844166","volume":"9","author":"SY Shin","year":"2005","unstructured":"Shin SY et al (2005) Multiobjective evolutionary optimization of DNA sequences for reliable DNA computing. IEEE Trans Evol Comput 9(2):143\u2013158","journal-title":"IEEE Trans Evol Comput"},{"key":"924_CR12","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1007\/s10732-015-9298-x","volume":"21","author":"JM Chaves-Gonz\u00e1lez","year":"2015","unstructured":"Chaves-Gonz\u00e1lez JM (2015) Hybrid multiobjective metaheuristics for the design of reliable DNA libraries. J Heuristics 21:751\u2013788","journal-title":"J Heuristics"},{"key":"924_CR13","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s12539-016-0160-0","volume":"9","author":"G Yang","year":"2017","unstructured":"Yang G et al (2017) IWO algorithm based on niche crowding for DNA sequence design. Interdiscip Sci Comput Life Sci 9:341\u2013349","journal-title":"Interdiscip Sci Comput Life Sci"},{"key":"924_CR14","doi-asserted-by":"publisher","first-page":"222684","DOI":"10.1109\/ACCESS.2020.3040752","volume":"8","author":"S Bano","year":"2020","unstructured":"Bano S, Bashir M, Younas I (2020) A many-objective memetic generalized differential evolution algorithm for DNA sequence design. IEEE Access 8:222684\u2013222699","journal-title":"IEEE Access"},{"key":"924_CR15","doi-asserted-by":"publisher","first-page":"644484","DOI":"10.3389\/fgene.2021.644484","volume":"12","author":"X Li","year":"2021","unstructured":"Li X et al (2021) Stable DNA sequence over close-ending and pairing sequences constraint. Front Genet 12:644484","journal-title":"Front Genet"},{"key":"924_CR16","doi-asserted-by":"publisher","DOI":"10.1109\/TNB.2022.3220795","author":"D Zhu","year":"2022","unstructured":"Zhu D et al (2022) Improved bare bones particle swarm optimization for DNA sequence design. IEEE Trans NanoBiosci. https:\/\/doi.org\/10.1109\/TNB.2022.3220795","journal-title":"IEEE Trans NanoBiosci"},{"unstructured":"Xie, L. et al. DNA sequence optimization design of arithmetic optimization algorithm based on billiard hitting strategy. Interdiscip Sci Comput Life Sci\u00a01\u201318.","key":"924_CR17"},{"issue":"11\u201312","key":"924_CR18","doi-asserted-by":"publisher","first-page":"2001","DOI":"10.1016\/j.camwa.2008.10.038","volume":"57","author":"X Zhang","year":"2009","unstructured":"Zhang X et al (2009) Application of a novel IWO to the design of encoding sequences for DNA computing. Comput Math Appl 57(11\u201312):2001\u20132008","journal-title":"Comput Math Appl"},{"key":"924_CR19","doi-asserted-by":"publisher","first-page":"63592","DOI":"10.1109\/ACCESS.2022.3150275","volume":"10","author":"D Zhu","year":"2022","unstructured":"Zhu D et al (2022) Improved particle swarm based on elastic collision for DNA coding optimization design. IEEE Access 10:63592\u201363605","journal-title":"IEEE Access"},{"doi-asserted-by":"crossref","unstructured":"Tizhoosh HR (2005) Opposition-based learning: a new scheme for machine intelligence. In: International conference on computational intelligence for modelling, control and automation and international conference on intelligent agents, web technologies and internet commerce (CIMCA-IAWTIC'06). vol. 1. IEEE","key":"924_CR20","DOI":"10.1109\/CIMCA.2005.1631427"},{"key":"924_CR21","doi-asserted-by":"publisher","first-page":"2631","DOI":"10.1007\/s00500-015-1963-3","volume":"21","author":"P Shao","year":"2017","unstructured":"Shao P et al (2017) FIR digital filter design using improved particle swarm optimization based on refraction principle. Soft Comput 21:2631\u20132642","journal-title":"Soft Comput"},{"doi-asserted-by":"crossref","unstructured":"Xiao Y et al. (2022) An enhanced honey badger algorithm based on L\u00e9vy flight and refraction opposition-based learning for engineering design problems. J Intell Fuzzy Syst 1\u201324","key":"924_CR22","DOI":"10.3233\/JIFS-213206"},{"doi-asserted-by":"crossref","unstructured":"Abed-Alguni BH et al. (2022) Opposition-based sine cosine optimizer utilizing refraction learning and variable neighborhood search for feature selection. Appl Intell 1\u201337.","key":"924_CR23","DOI":"10.1007\/s10489-022-04201-z"},{"doi-asserted-by":"crossref","unstructured":"Yang XS, Deb S (2009) Cuckoo search via L\u00e9vy flights. In: 2009 World congress on nature & biologically inspired computing (NaBIC). IEEE","key":"924_CR24","DOI":"10.1109\/NABIC.2009.5393690"},{"key":"924_CR25","doi-asserted-by":"publisher","first-page":"106729","DOI":"10.1016\/j.knosys.2020.106729","volume":"214","author":"H Peng","year":"2021","unstructured":"Peng H et al (2021) Multi-strategy serial cuckoo search algorithm for global optimization. Knowl Based Syst 214:106729","journal-title":"Knowl Based Syst"},{"unstructured":"Higashi N, Iba, H (2003) Particle swarm optimization with Gaussian mutation. In: Proceedings of the 2003 IEEE swarm intelligence symposium. SIS'03 (Cat. No. 03EX706). IEEE","key":"924_CR26"},{"issue":"2","key":"924_CR27","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1109\/TNB.2020.2971644","volume":"19","author":"X Li","year":"2020","unstructured":"Li X et al (2020) Constraining DNA sequences with a triplet-bases unpaired. IEEE Trans Nanobiosci 19(2):299\u2013307","journal-title":"IEEE Trans Nanobiosci"},{"issue":"4","key":"924_CR28","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1287\/inte.20.4.74","volume":"20","author":"F Glover","year":"1990","unstructured":"Glover F (1990) Tabu search: a tutorial. Interfaces 20(4):74\u201394","journal-title":"Interfaces"},{"issue":"1","key":"924_CR29","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1166\/jctn.2016.4825","volume":"13","author":"Y Liu","year":"2016","unstructured":"Liu Y et al (2016) The optimization of DNA encoding based on chaotic optimization particle swarm algorithm. J Comput Theor Nanosci 13(1):443\u2013449","journal-title":"J Comput Theor Nanosci"},{"issue":"13","key":"924_CR30","first-page":"3545","volume":"13","author":"DF Luo","year":"2013","unstructured":"Luo DF, Luo DJ (2013) The research of DNA coding sequences based on invasive weed optimization. Sci Tech Eng 13(13):3545\u20133551","journal-title":"Sci Tech Eng"},{"issue":"3","key":"924_CR31","first-page":"971","volume":"70","author":"JH Xiao","year":"2013","unstructured":"Xiao JH et al (2013) A dynamic membrane evolutionary algorithm for solving DNA sequences design with minimum free energy. MATCH Commun Math Comput Chem 70(3):971\u2013986","journal-title":"MATCH Commun Math Comput Chem"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-024-00924-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-024-00924-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-024-00924-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,14]],"date-time":"2024-11-14T20:37:45Z","timestamp":1731616665000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-024-00924-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,21]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["924"],"URL":"https:\/\/doi.org\/10.1007\/s12065-024-00924-9","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"type":"print","value":"1864-5909"},{"type":"electronic","value":"1864-5917"}],"subject":[],"published":{"date-parts":[[2024,3,21]]},"assertion":[{"value":"11 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 February 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}