{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:30:28Z","timestamp":1782970228890,"version":"3.54.5"},"reference-count":77,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T00:00:00Z","timestamp":1742515200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T00:00:00Z","timestamp":1742515200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62427811"],"award-info":[{"award-number":["62427811"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272115"],"award-info":[{"award-number":["62272115"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2019YFA0706401"],"award-info":[{"award-number":["2019YFA0706401"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Artif Intell Rev"],"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>DNA computing is an emerging computational model that has garnered significant attention due to its distinctive advantages at the molecular biological level. Since it was introduced by Adelman in 1994, this field has made remarkable progress in solving <jats:bold>NP<\/jats:bold>-complete problems, enhancing information security, encrypting images, controlling diseases, and advancing nanotechnology. A key challenge in DNA computing is the design of DNA coding, which aims to minimize nonspecific hybridization and enhance computational reliability. The DNA coding design is a classical combinatorial optimization problem focused on generating high-quality DNA sequences that meet specific constraints, including distance, thermodynamics, secondary structure, and sequence requirements. This paper comprehensively examines the advances in DNA coding design, highlighting mathematical models, counting theory, and commonly used DNA coding methods. These methods include the template method, multi-objective evolutionary methods, and implicit enumeration techniques.<\/jats:p>","DOI":"10.1007\/s10462-025-11132-x","type":"journal-article","created":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T15:28:13Z","timestamp":1742657293000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Dna coding theory and algorithms"],"prefix":"10.1007","volume":"58","author":[{"given":"Jin","family":"Xu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenbin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kai","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Enqiang","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,3,21]]},"reference":[{"issue":"5187","key":"11132_CR1","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"LM Adleman","year":"1994","unstructured":"Adleman LM (1994) Molecular computation of solutions to combinatorial problems. Science 266(5187):1021\u20131024","journal-title":"Science"},{"key":"11132_CR2","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF03037360","volume":"20","author":"M Arita","year":"2002","unstructured":"Arita M, Kobayashi S (2002) DNA sequence design using templates. N Gener Comput 20:263\u2013277","journal-title":"N Gener Comput"},{"key":"11132_CR3","unstructured":"Arita M, Nishikawa A, Hagiya M, Komiya K, Gouzu H, Sakamoto K (2000) Improving sequence design for DNA computing. In: Proceedings of the 2nd annual conference on genetic and evolutionary computation, pp. 875\u2013882"},{"issue":"4","key":"11132_CR4","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1287\/opre.13.4.517","volume":"13","author":"E Balas","year":"1965","unstructured":"Balas E (1965) An additive algorithm for solving linear programs with zero-one variables. Oper Res 13(4):517\u2013546","journal-title":"Oper Res"},{"issue":"3","key":"11132_CR5","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1287\/mnsc.12.3.253","volume":"12","author":"ML Balinski","year":"1965","unstructured":"Balinski ML (1965) Integer programming: methods, uses, computations. Manag Sci 12(3):253\u2013313","journal-title":"Manag Sci"},{"key":"11132_CR6","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":"11132_CR7","doi-asserted-by":"crossref","unstructured":"Braich RS, Johnson C, Rothemund PW, Hwang D, Chelyapov N, Adleman LM (2001) Solution of a satisfiability problem on a gel-based DNA computer. In: DNA Computing: 6th international workshop on DNA-based computers, DNA 2000 Leiden, The Netherlands, June 13\u201317, 2000 Revised Papers 6. Springer, pp. 27\u201342","DOI":"10.1007\/3-540-44992-2_3"},{"issue":"5567","key":"11132_CR8","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1126\/science.1069528","volume":"296","author":"RS Braich","year":"2002","unstructured":"Braich RS, Chelyapov N, Johnson C, Rothemund PW, Adleman L (2002) Solution of a 20-variable 3-sat problem on a DNA computer. Science 296(5567):499\u2013502","journal-title":"Science"},{"key":"11132_CR9","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.dam.2012.08.025","volume":"163","author":"M Caserta","year":"2014","unstructured":"Caserta M, Vo\u00df S (2014) A hybrid algorithm for the DNA sequencing problem. Discret Appl Math 163:87\u201399","journal-title":"Discret Appl Math"},{"key":"11132_CR10","doi-asserted-by":"crossref","unstructured":"Caserta M, Vo\u00df S (2010) A math-heuristic algorithm for the DNA sequencing problem. In: International conference on learning and intelligent optimization. Springer, pp. 25\u201336","DOI":"10.1007\/978-3-642-13800-3_3"},{"key":"11132_CR11","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/s12539-018-0303-6","volume":"11","author":"JM Chaves-Gonz\u00e1lez","year":"2019","unstructured":"Chaves-Gonz\u00e1lez JM, Mart\u00ednez-Gil J (2019) An efficient design for a multi-objective evolutionary algorithm to generate DNA libraries suitable for computation. Interdiscip Sci: Comput Life Sci 11:542\u2013558","journal-title":"Interdiscip Sci: Comput Life Sci"},{"key":"11132_CR12","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.amc.2013.11.032","volume":"227","author":"JM Chaves-Gonz\u00e1lez","year":"2014","unstructured":"Chaves-Gonz\u00e1lez JM, Vega-Rodr\u00edguez MA (2014) A multiobjective approach based on the behavior of fireflies to generate reliable DNA sequences for molecular computing. Appl Math Comput 227:291\u2013308","journal-title":"Appl Math Comput"},{"issue":"9","key":"11132_CR13","doi-asserted-by":"publisher","first-page":"2045","DOI":"10.1016\/j.engappai.2013.04.011","volume":"26","author":"JM Chaves-Gonz\u00e1lez","year":"2013","unstructured":"Chaves-Gonz\u00e1lez JM, Vega-Rodr\u00edguez MA, Granado-Criado JM (2013) A multiobjective swarm intelligence approach based on artificial bee colony for reliable DNA sequence design. Eng Appl Artif Intell 26(9):2045\u20132057","journal-title":"Eng Appl Artif Intell"},{"key":"11132_CR14","doi-asserted-by":"crossref","unstructured":"Deaton RJ, Murphy RC, Garzon MH, Franceschetti DR, Stevens\u00a0Jr SE (1996) Good encodings for DNA-based solutions to combinatorial problems. In: DNA based computers, pp. 247\u2013258","DOI":"10.1090\/dimacs\/044\/20"},{"issue":"2","key":"11132_CR15","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1103\/PhysRevLett.80.417","volume":"80","author":"R Deaton","year":"1998","unstructured":"Deaton R, Garzon M, Murphy R, Rose J, Franceschetti D, Stevens SE Jr (1998) Reliability and efficiency of a DNA-based computation. Phys Rev Lett 80(2):417","journal-title":"Phys Rev Lett"},{"key":"11132_CR16","doi-asserted-by":"crossref","unstructured":"Deaton R, Chen J, Bi H, Garzon M, Rubin H, Harlan\u00a0Wood D (2003) A pcr-based protocol for in vitro selection of non-crosshybridizing oligonucleotides. In: DNA Computing: 8th International workshop on DNA-based computers, DNA8 Sapporo, Japan, June 10\u201313, 2002 Revised Papers 8. Springer, pp. 196\u2013204","DOI":"10.1007\/3-540-36440-4_17"},{"key":"11132_CR17","doi-asserted-by":"crossref","unstructured":"Deaton R, Chen J, Bi H, Rose JA (2002) A software tool for generating non-crosshybridizing libraries of DNA oligonucleotides. In: International workshop on DNA-based computers. Springer, pp. 252\u2013261","DOI":"10.1007\/3-540-36440-4_22"},{"key":"11132_CR18","unstructured":"Deaton R, Garzon M (1998) Thermodynamic constraints on DNA-based computing. Comput Bio-Mol, pp 138\u2013152"},{"key":"11132_CR19","first-page":"421","volume":"419","author":"R Deaton","year":"1996","unstructured":"Deaton R, Garzon M, Murphy R, Rose J, Franceschetti D, Stevens S Jr (1996) Genetic search of reliable encodings for DNA-based computation. Proc First Ann Conf Genetic Program 419:421","journal-title":"Proc First Ann Conf Genetic Program"},{"key":"11132_CR20","doi-asserted-by":"crossref","unstructured":"Duan H, Zhang K, Zhang X (2023) A DNA coding design based on multi-objective evolutionary algorithm with constraint. In: Proceedings of the 2023 7th international conference on machine learning and soft computing, pp. 40\u201345","DOI":"10.1145\/3583788.3583794"},{"issue":"4","key":"11132_CR21","doi-asserted-by":"publisher","first-page":"1385","DOI":"10.1073\/pnas.97.4.1385","volume":"97","author":"D Faulhammer","year":"2000","unstructured":"Faulhammer D, Cukras AR, Lipton RJ, Landweber LF (2000) Molecular computation: RNA solutions to chess problems. Proc Natl Acad Sci USA 97(4):1385\u20131389","journal-title":"Proc Natl Acad Sci USA"},{"key":"11132_CR22","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1023\/A:1023985029398","volume":"4","author":"U Feldkamp","year":"2003","unstructured":"Feldkamp U, Rauhe H, Banzhaf W (2003) Software tools for DNA sequence design. Genet Program Evolv Mach 4:153\u2013171","journal-title":"Genet Program Evolv Mach"},{"key":"11132_CR23","unstructured":"Feldkamp U, Banzhaf W, Rauhe H etal (2000) A DNA sequence compiler. In: Poster presented at the 6th international meeting on dna based computers, Leiden"},{"key":"11132_CR24","doi-asserted-by":"crossref","unstructured":"Feldkamp U, Saghafi S, Banzhaf W, Rauhe H (2002) DNAsequencegenerator: a program for the construction of DNA sequences. In: DNA Computing: 7th International workshop on DNA-based computers, DNA7 Tampa, FL, USA, June 10\u201313, 2001 Revised Papers 7. Springer, pp. 23\u201332","DOI":"10.1007\/3-540-48017-X_3"},{"key":"11132_CR25","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1007\/s10589-010-9355-1","volume":"51","author":"P Fouilhoux","year":"2012","unstructured":"Fouilhoux P, Mahjoub AR (2012) Solving vlsi design and DNA sequencing problems using bipartization of graphs. Comput Optim Appl 51:749\u2013781","journal-title":"Comput Optim Appl"},{"issue":"23","key":"11132_CR26","doi-asserted-by":"publisher","first-page":"4748","DOI":"10.1093\/nar\/25.23.4748","volume":"25","author":"AG Frutos","year":"1997","unstructured":"Frutos AG, Liu Q, Thiel AJ, Sanner AMW, Condon AE, Smith LM, Corn RM (1997) Demonstration of a word design strategy for DNA computing on surfaces. Nucleic Acids Res 25(23):4748\u20134757","journal-title":"Nucleic Acids Res"},{"issue":"02","key":"11132_CR27","doi-asserted-by":"publisher","first-page":"1440001","DOI":"10.1142\/S0129626414400015","volume":"24","author":"MH Garzon","year":"2014","unstructured":"Garzon MH (2014) DNA codeword design: theory and applications. Parallel Process Lett 24(02):1440001","journal-title":"Parallel Process Lett"},{"key":"11132_CR28","unstructured":"Garzon M, Neathery P, Deaton R, Murphy RC, Franceschetti DR, Stevens\u00a0Jr S (1997) A new metric for DNA computing. In: Proceedings of the 2nd genetic programming conference. Morgan Kaufman, vol. 32, pp. 636\u2013638"},{"issue":"6","key":"11132_CR29","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1080\/10002007088537464","volume":"17","author":"C Guangzhao","year":"2007","unstructured":"Guangzhao C, Yunyun N, Yanfeng W, Xuncai Z, Linqiang P (2007) A new approach based on pso algorithm to find good computational encoding sequences. Prog Nat Sci 17(6):712\u2013716","journal-title":"Prog Nat Sci"},{"issue":"1\u20133","key":"11132_CR30","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/S0303-2647(99)00050-7","volume":"52","author":"AJ Hartemink","year":"1999","unstructured":"Hartemink AJ, Gifford DK, Khodor J (1999) Automated constraint-based nucleotide sequence selection for DNA computation. Biosystems 52(1\u20133):227\u2013235","journal-title":"Biosystems"},{"issue":"12","key":"11132_CR31","first-page":"1515","volume":"17","author":"X Jianhua","year":"2007","unstructured":"Jianhua X, Jin X, Xiutang G, Linqiang P (2007) Multi-objective carrier chaotic evolutionary algorithm for DNA sequences design. Prog Nat Sci 17(12):1515\u20131520","journal-title":"Prog Nat Sci"},{"issue":"6","key":"11132_CR32","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1080\/10002007088537469","volume":"17","author":"Z Kai","year":"2007","unstructured":"Kai Z, Linqiang P, Jin X (2007) A global heuristically search algorithm for DNA encoding. Prog Nat Sci 17(6):745\u2013749","journal-title":"Prog Nat Sci"},{"key":"11132_CR33","doi-asserted-by":"crossref","unstructured":"Kawashimo S, Ono H, Sadakane K, Yamashita M (2008) Dynamic neighborhood searches for thermodynamically designing DNA sequence. In: DNA Computing: 13th international meeting on DNA computing, DNA13, Memphis, TN, USA, June 4-8, 2007, Revised Selected Papers 13. Springer, pp. 130\u2013139","DOI":"10.1007\/978-3-540-77962-9_13"},{"key":"11132_CR34","doi-asserted-by":"crossref","unstructured":"Khalid NK, Kurniawan TB, Ibrahim Z, Yusof ZM, Khalid M, Engelbrecht AP (2008) A model to optimize DNA sequences based on particle swarm optimization. In: 2008 Second Asia international conference on modelling & simulation (AMS). IEEE, pp. 534\u2013539","DOI":"10.1109\/AMS.2008.25"},{"key":"11132_CR35","doi-asserted-by":"crossref","unstructured":"Kim D, Soo-Yong S, In-Hee L, Byoung-Tak Z (2003) Nacst\/seq: A sequence design system with multiobjective optimization. In: DNA Computing: 8th international workshop on DNA-based computers, DNA8 Sapporo, Japan, June 10\u201313, 2002 Revised Papers 8. Springer, pp. 242\u2013251","DOI":"10.1007\/3-540-36440-4_21"},{"key":"11132_CR36","doi-asserted-by":"crossref","unstructured":"Kurniawan TB, Ibrahim Z, Khalid NK, Khalid M (2009) A population-based ant colony optimization approach for DNA sequence optimization. In: 2009 Third Asia international conference on modelling & simulation. IEEE, pp. 246\u2013251","DOI":"10.1109\/AMS.2009.79"},{"key":"11132_CR37","unstructured":"Kurniawan TB, Khalid NK, Ibrahim Z, Khalid M, Middendorf M (2008) An ant colony system for DNA sequence design based on thermodynamics. In: Proc. of the 4th IASTED international conference advances in computer science and technology, pp. 144\u2013149"},{"issue":"2","key":"11132_CR38","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1109\/TNB.2020.2971644","volume":"19","author":"X Li","year":"2020","unstructured":"Li X, Wang B, Lv H, Yin Q, Zhang Q, Wei X (2020) Constraining DNA sequences with a triplet-bases unpaired. IEEE Trans Nanobiosci 19(2):299\u2013307","journal-title":"IEEE Trans Nanobiosci"},{"key":"11132_CR39","doi-asserted-by":"publisher","DOI":"10.3389\/fgene.2021.644484","volume":"12","author":"X Li","year":"2021","unstructured":"Li X, Wei Z, Wang B, Song T (2021) Stable DNA sequence over close-ending and pairing sequences constraint. Front Genet 12:644484","journal-title":"Front Genet"},{"issue":"5210","key":"11132_CR40","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":"6","key":"11132_CR41","doi-asserted-by":"publisher","first-page":"2014","DOI":"10.1021\/ci025645s","volume":"43","author":"W Liu","year":"2003","unstructured":"Liu W, Wang S, Gao L, Zhang F, Xu J (2003) DNA sequence design based on template strategy. J Chem Inf Comput Sci 43(6):2014\u20132018","journal-title":"J Chem Inf Comput Sci"},{"issue":"6","key":"11132_CR42","doi-asserted-by":"publisher","first-page":"1872","DOI":"10.1021\/ci034113o","volume":"43","author":"W Liu","year":"2003","unstructured":"Liu W, Gao L, Liu X, Wang S, Xu J (2003) Solving the 3-sat problem based on DNA computing. J Chem Inf Comput Sci 43(6):1872\u20131875","journal-title":"J Chem Inf Comput Sci"},{"issue":"8","key":"11132_CR43","first-page":"1490","volume":"35","author":"W Liu","year":"2007","unstructured":"Liu W, Chen L, Bai B, Zhu X, Zhang Q, Ma R (2007) Research on optimizing the template frame in DNA computing. Acta Electron Sin 35(8):1490\u20131494","journal-title":"Acta Electron Sin"},{"issue":"5","key":"11132_CR44","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.3724\/SP.J.1146.2006.01640","volume":"30","author":"W Liu","year":"2008","unstructured":"Liu W, Zhu X, Wang X, Zhang Q, Ma R (2008) A new method to optimize the template set in DNA computing. J Electron Inf Technol 30(5):1131\u20131135","journal-title":"J Electron Inf Technol"},{"issue":"19","key":"11132_CR45","doi-asserted-by":"publisher","first-page":"10691","DOI":"10.1093\/nar\/gkaa835","volume":"48","author":"C Liu","year":"2020","unstructured":"Liu C, Liu Y, Zhu E, Zhang Q, Wei X, Wang B (2020) Cross-inhibitor: a time-sensitive molecular circuit based on DNA strand displacement. Nucleic Acids Res 48(19):10691\u201310701","journal-title":"Nucleic Acids Res"},{"issue":"3","key":"11132_CR46","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1089\/10665270152530818","volume":"8","author":"A Marathe","year":"2001","unstructured":"Marathe A, Condon AE, Corn RM (2001) On combinatorial DNA word design. J Comput Biol 8(3):201\u2013219","journal-title":"J Comput Biol"},{"key":"11132_CR47","doi-asserted-by":"crossref","unstructured":"Mustaza SM, Abidin AFZ, Ibrahim Z, Shamsudin MA, Husain AR, Mukred JAA (2011) A modified computational model of ant colony system in DNA sequence design. In: 2011 IEEE student conference on research and development. IEEE, pp. 169\u2013173","DOI":"10.1109\/SCOReD.2011.6148729"},{"issue":"2","key":"11132_CR48","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1089\/106652703321825973","volume":"10","author":"R Penchovsky","year":"2003","unstructured":"Penchovsky R, Ackermann J (2003) DNA library design for molecular computation. J Comput Biol 10(2):215\u2013229","journal-title":"J Comput Biol"},{"key":"11132_CR49","doi-asserted-by":"crossref","unstructured":"Reif JH, LaBean TH, Pirrung M, Rana VS, Guo B, Kingsford C, Wickham GS (2002) Experimental construction of very large scale DNA databases with associative search capability. In: DNA Computing: 7th international workshop on DNA-based computers, DNA7 Tampa, FL, USA, June 10\u201313, 2001 Revised Papers 7. Springer, pp. 231\u2013247","DOI":"10.1007\/3-540-48017-X_22"},{"issue":"4","key":"11132_CR50","doi-asserted-by":"publisher","first-page":"1460","DOI":"10.1073\/pnas.95.4.1460","volume":"95","author":"J SantaLucia Jr","year":"1998","unstructured":"SantaLucia J Jr (1998) A unified view of polymer, dumbbell, and oligonucleotide DNA nearest-neighbor thermodynamics. Proc Natl Acad Sci USA 95(4):1460\u20131465","journal-title":"Proc Natl Acad Sci USA"},{"issue":"1","key":"11132_CR51","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1146\/annurev.biophys.32.110601.141800","volume":"33","author":"J SantaLucia Jr","year":"2004","unstructured":"SantaLucia J Jr, Hicks D (2004) The thermodynamics of DNA structural motifs. Annu Rev Biophys Biomol Struct 33(1):415\u2013440","journal-title":"Annu Rev Biophys Biomol Struct"},{"key":"11132_CR52","doi-asserted-by":"crossref","unstructured":"Shin S-Y, Kim D-M, Lee I-H, Zhang B-T (2002) Evolutionary sequence generation for reliable DNA computing. In: Proceedings of the 2002 congress on evolutionary computation. CEC\u201902 (Cat. No. 02TH8600). IEEE, vol. 1, pp. 79\u201384","DOI":"10.1109\/CEC.2002.1006213"},{"issue":"2","key":"11132_CR53","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1109\/TEVC.2005.844166","volume":"9","author":"S-Y Shin","year":"2005","unstructured":"Shin S-Y, Lee I-H, Kim D, Zhang B-T (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"},{"issue":"3","key":"11132_CR54","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1093\/nar\/gki235","volume":"33","author":"F Tanaka","year":"2005","unstructured":"Tanaka F, Kameda A, Yamamoto M, Ohuchi A (2005) Design of nucleic acid sequences for DNA computing based on a thermodynamic approach. Nucleic Acids Res 33(3):903\u2013911","journal-title":"Nucleic Acids Res"},{"key":"11132_CR55","doi-asserted-by":"crossref","unstructured":"Tanaka F, Nakatsugawa M, Yamamoto M, Shiba T, Ohuchi1 A (2002) Developing support system for sequence design in DNA computing. In: DNA Computing: 7th international workshop on DNA-based computers, DNA7 Tampa, FL, USA, June 10\u201313, 2001 Revised Papers 7. Springer, pp. 129\u2013137","DOI":"10.1007\/3-540-48017-X_12"},{"key":"11132_CR56","doi-asserted-by":"crossref","unstructured":"Tulpan DC, Hoos HH, Condon AE (2003) Stochastic local search algorithms for DNA word design. In: DNA Computing: 8th international workshop on DNA-based computers, DNA8 Sapporo, Japan, June 10\u201313, 2002 Revised Papers 8. Springer, pp. 229\u2013241","DOI":"10.1007\/3-540-36440-4_20"},{"issue":"12","key":"11132_CR57","first-page":"2720","volume":"37","author":"X Wang","year":"2009","unstructured":"Wang X, Liu W, Zhu X, Zhang L (2009) Improving the single template method in DNA computing. Acta Electron Sin 37(12):2720\u20132724","journal-title":"Acta Electron Sin"},{"issue":"6","key":"11132_CR58","doi-asserted-by":"publisher","first-page":"1538","DOI":"10.23919\/cje.2022.00.042","volume":"33","author":"F Wang","year":"2024","unstructured":"Wang F, Zhang X, Chen X, Lyu S, Chen C, Shi X (2024) Priority encoder based on DNA strand displacement. Chin J Electron 33(6):1538\u20131544","journal-title":"Chin J Electron"},{"issue":"6","key":"11132_CR59","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1080\/10002007088537468","volume":"17","author":"W Wei","year":"2007","unstructured":"Wei W, Xuedong Z, Qiang Z, Jin X (2007) The optimization of DNA encodings based on ga\/sa algorithms. Prog Nat Sci 17(6):739\u2013744","journal-title":"Prog Nat Sci"},{"issue":"11","key":"11132_CR60","doi-asserted-by":"publisher","first-page":"1710","DOI":"10.1093\/bioinformatics\/bth147","volume":"20","author":"J-S Wu","year":"2004","unstructured":"Wu J-S, Lee C, Wu C-C, Shiue Y-L (2004) Primer design using genetic algorithm. Bioinformatics 20(11):1710\u20131717","journal-title":"Bioinformatics"},{"key":"11132_CR61","doi-asserted-by":"crossref","unstructured":"Wu H, Zhu D, Huang Z, Zhang L, Zhou C (2024) Enhanced DNA sequence design with learning pso. Evol Intell, pp 1\u201315","DOI":"10.1007\/s12065-024-00924-9"},{"issue":"3","key":"11132_CR62","first-page":"971","volume":"70","author":"J Xiao","year":"2013","unstructured":"Xiao J, Jiang Y, He J, Cheng Z (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"},{"issue":"2","key":"11132_CR63","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s12539-023-00559-x","volume":"15","author":"L Xie","year":"2023","unstructured":"Xie L, Wang S, Zhu D, Hu G, Zhou C (2023) DNA sequence optimization design of arithmetic optimization algorithm based on billiard hitting strategy. Interdiscip Sci: Comput Life Sci 15(2):231\u2013248","journal-title":"Interdiscip Sci: Comput Life Sci"},{"issue":"1","key":"11132_CR64","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.eng.2018.02.011","volume":"4","author":"J Xu","year":"2018","unstructured":"Xu J, Qiang X, Zhang K, Zhang C, Yang J (2018) A DNA computing model for the graph vertex coloring problem based on a probe graph. Engineering 4(1):61\u201377","journal-title":"Engineering"},{"issue":"10","key":"11132_CR65","first-page":"7329","volume":"8","author":"F Yakop","year":"2012","unstructured":"Yakop F, Ibrahim Z, Abidin AFZ, Yusof ZM, Mohamad MS, Wan K, Watada J (2012) An ant colony system for solving DNA sequence design problem in DNA computing. Int J Innov Comput, Inform Control 8(10):7329\u20137339","journal-title":"Int J Innov Comput, Inform Control"},{"key":"11132_CR66","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s12539-016-0160-0","volume":"9","author":"G Yang","year":"2017","unstructured":"Yang G, Wang B, Zheng X, Zhou C, Zhang Q (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":"11132_CR67","doi-asserted-by":"crossref","unstructured":"Yang X, Zhu D, Yang C, Zhou C (2024) H-ACO with consecutive bases pairing constraint for designing DNA sequences. Interdiscip Sci: Comput Life Sci, pp 1\u201315","DOI":"10.1007\/s12539-024-00614-1"},{"key":"11132_CR68","first-page":"735","volume":"98","author":"B-T Zhang","year":"1998","unstructured":"Zhang B-T, Shin S-Y (1998) Molecular algorithms for efficient and reliable DNA computing. Genetic Program 98:735\u2013742","journal-title":"Genetic Program"},{"issue":"3","key":"11132_CR69","doi-asserted-by":"publisher","first-page":"547","DOI":"10.3390\/electronics12030547","volume":"12","author":"W Zhang","year":"2023","unstructured":"Zhang W, Zhu D, Huang Z, Zhou C (2023) Improved multi-strategy matrix particle swarm optimization for DNA sequence design. Electronics 12(3):547","journal-title":"Electronics"},{"key":"11132_CR70","doi-asserted-by":"crossref","unstructured":"Zhang X, Zhang K, Wu N, Duan H (2023) A two-stage constrained multi-objective evolutionary algorithm for DNA encoding problem. In: 2023 IEEE International conference on systems, man, and cybernetics (SMC). IEEE, pp. 548\u2013555","DOI":"10.1109\/SMC53992.2023.10394102"},{"issue":"7","key":"11132_CR71","first-page":"1169","volume":"34","author":"X Zhu","year":"2006","unstructured":"Zhu X, Liu W, Sun C (2006) Research on the DNA words and algorithm. Acta Electron Sin 34(7):1169","journal-title":"Acta Electron Sin"},{"issue":"6","key":"11132_CR72","doi-asserted-by":"publisher","first-page":"4960","DOI":"10.1109\/TCYB.2020.3025819","volume":"52","author":"E Zhu","year":"2020","unstructured":"Zhu E, Jiang F, Liu C, Xu J (2020) Partition independent set and reduction-based approach for partition coloring problem. IEEE Trans Cybernet 52(6):4960\u20134969","journal-title":"IEEE Trans Cybernet"},{"issue":"3","key":"11132_CR73","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1109\/TNB.2022.3220795","volume":"22","author":"D Zhu","year":"2022","unstructured":"Zhu D, Huang Z, Liao S, Zhou C, Yan S, Chen G (2022) Improved bare bones particle swarm optimization for DNA sequence design. IEEE Trans Nanobiosci 22(3):603\u2013613","journal-title":"IEEE Trans Nanobiosci"},{"issue":"5","key":"11132_CR74","doi-asserted-by":"publisher","first-page":"877","DOI":"10.3390\/nano12050877","volume":"12","author":"E Zhu","year":"2022","unstructured":"Zhu E, Luo X, Liu C, Chen C (2022) An operational DNA strand displacement encryption approach. Nanomaterials 12(5):877","journal-title":"Nanomaterials"},{"key":"11132_CR75","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2024.111950","volume":"298","author":"E Zhu","year":"2024","unstructured":"Zhu E, Zhang Y, Wang S, Strash D, Liu C (2024) A dual-mode local search algorithm for solving the minimum dominating set problem. Knowl-Based Syst 298:111950","journal-title":"Knowl-Based Syst"},{"issue":"2","key":"11132_CR76","doi-asserted-by":"publisher","first-page":"2133","DOI":"10.1007\/s10586-023-04083-x","volume":"27","author":"D Zhu","year":"2024","unstructured":"Zhu D, Wang S, Huang Z, Zhou C, Zhang L (2024) A jaya algorithm based on normal clouds for DNA sequence optimization. Clust Comput 27(2):2133\u20132149","journal-title":"Clust Comput"},{"issue":"3","key":"11132_CR77","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S0010-4655(02)00270-9","volume":"144","author":"K-H Zimmermann","year":"2002","unstructured":"Zimmermann K-H (2002) Efficient DNA sticker algorithms for NP-complete graph problems. Comput Phys Commun 144(3):297\u2013309","journal-title":"Comput Phys Commun"}],"container-title":["Artificial Intelligence Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-025-11132-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10462-025-11132-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-025-11132-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T20:06:30Z","timestamp":1744920390000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10462-025-11132-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,21]]},"references-count":77,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2025,6]]}},"alternative-id":["11132"],"URL":"https:\/\/doi.org\/10.1007\/s10462-025-11132-x","relation":{},"ISSN":["1573-7462"],"issn-type":[{"value":"1573-7462","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,21]]},"assertion":[{"value":"5 February 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2025","order":2,"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":"Conflicting interests"}}],"article-number":"178"}}