{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:12:54Z","timestamp":1750219974820,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T00:00:00Z","timestamp":1666310400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Natural Science Foundation of China","award":["62272418, 62102058"],"award-info":[{"award-number":["62272418, 62102058"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,10,21]]},"DOI":"10.1145\/3569966.3570078","type":"proceedings-article","created":{"date-parts":[[2022,12,20]],"date-time":"2022-12-20T22:24:41Z","timestamp":1671575081000},"page":"397-401","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved Simulated Annealing Based on Quantum Genetics for DNA Coding Optimization Design"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0417-9605","authenticated-orcid":false,"given":"Haojie","family":"Wu","sequence":"first","affiliation":[{"name":"College of Mathematics and Computer Science, Zhejiang Normal University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0129-2231","authenticated-orcid":false,"given":"Changjun","family":"Zhou","sequence":"additional","affiliation":[{"name":"College of Mathematics and Computer Science, Zhejiang Normal University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,12,20]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Computing with DNA. Scientific american 279, 2","author":"Adleman M","year":"1998","unstructured":"Leonard\u00a0 M Adleman . 1998. Computing with DNA. Scientific american 279, 2 ( 1998 ), 54\u201361. Leonard\u00a0M Adleman. 1998. Computing with DNA. Scientific american 279, 2 (1998), 54\u201361."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNB.2021.3056351"},{"key":"e_1_3_2_1_3_1","first-page":"152","article-title":"Particle swarm optimization algorithm based on the idea of simulated annealing","volume":"6","author":"Chaojun DONG","year":"2006","unstructured":"DONG Chaojun and Z Qiu . 2006 . Particle swarm optimization algorithm based on the idea of simulated annealing . International Journal of Computer Science and Network Security 6 , 10(2006), 152 \u2013 157 . DONG Chaojun and Z Qiu. 2006. Particle swarm optimization algorithm based on the idea of simulated annealing. International Journal of Computer Science and Network Security 6, 10(2006), 152\u2013157.","journal-title":"International Journal of Computer Science and Network Security"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911167"},{"volume-title":"An introduction to chaotic dynamical systems","author":"Devaney L","key":"e_1_3_2_1_5_1","unstructured":"Robert\u00a0 L Devaney . 2018. An introduction to chaotic dynamical systems . CRC press . Robert\u00a0L Devaney. 2018. An introduction to chaotic dynamical systems. CRC press."},{"key":"e_1_3_2_1_6_1","volume-title":"Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. Bulletin of mathematical biology 49, 6","author":"Head Tom","year":"1987","unstructured":"Tom Head . 1987. Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. Bulletin of mathematical biology 49, 6 ( 1987 ), 737\u2013759. Tom Head. 1987. Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. Bulletin of mathematical biology 49, 6 (1987), 737\u2013759."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2020.112159"},{"key":"e_1_3_2_1_8_1","volume-title":"Optimization by simulated annealing. science 220, 4598","author":"Kirkpatrick Scott","year":"1983","unstructured":"Scott Kirkpatrick , C\u00a0Daniel Gelatt\u00a0Jr , and Mario\u00a0 P Vecchi . 1983. Optimization by simulated annealing. science 220, 4598 ( 1983 ), 671\u2013680. Scott Kirkpatrick, C\u00a0Daniel Gelatt\u00a0Jr, and Mario\u00a0P Vecchi. 1983. Optimization by simulated annealing. science 220, 4598 (1983), 671\u2013680."},{"key":"e_1_3_2_1_9_1","volume-title":"Molecular computation of solutions to combinatorial problems. science 266, 5187","author":"Adleman Leonard","year":"1994","unstructured":"Leonard M.\u00a0 Adleman . 1994. Molecular computation of solutions to combinatorial problems. science 266, 5187 ( 1994 ), 1021\u20131024. Leonard M.\u00a0Adleman. 1994. Molecular computation of solutions to combinatorial problems. science 266, 5187 (1994), 1021\u20131024."},{"key":"e_1_3_2_1_10_1","volume-title":"When will a genetic algorithm outperform hill climbing. Advances in neural information processing systems 6","author":"Mitchell Melanie","year":"1993","unstructured":"Melanie Mitchell , John Holland , and Stephanie Forrest . 1993. When will a genetic algorithm outperform hill climbing. Advances in neural information processing systems 6 ( 1993 ). Melanie Mitchell, John Holland, and Stephanie Forrest. 1993. When will a genetic algorithm outperform hill climbing. Advances in neural information processing systems 6 (1993)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.94.20.10506"},{"key":"e_1_3_2_1_12_1","volume-title":"PCR amplification of long DNA fragments. Nucleic acids research 20, 3","author":"Ponce R","year":"1992","unstructured":"Maria\u00a0 R Ponce and Jose\u00a0 L Micol . 1992. PCR amplification of long DNA fragments. Nucleic acids research 20, 3 ( 1992 ), 623\u2013623. Maria\u00a0R Ponce and Jose\u00a0L Micol. 1992. PCR amplification of long DNA fragments. Nucleic acids research 20, 3 (1992), 623\u2013623."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174468"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3094876"}],"event":{"name":"CSSE 2022: 2022 5th International Conference on Computer Science and Software Engineering","acronym":"CSSE 2022","location":"Guilin China"},"container-title":["Proceedings of the 5th International Conference on Computer Science and Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3569966.3570078","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3569966.3570078","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:20Z","timestamp":1750182560000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3569966.3570078"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,21]]},"references-count":14,"alternative-id":["10.1145\/3569966.3570078","10.1145\/3569966"],"URL":"https:\/\/doi.org\/10.1145\/3569966.3570078","relation":{},"subject":[],"published":{"date-parts":[[2022,10,21]]},"assertion":[{"value":"2022-12-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}