{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:31:26Z","timestamp":1742952686103,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":35,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819981373"},{"type":"electronic","value":"9789819981380"}],"license":[{"start":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T00:00:00Z","timestamp":1700956800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T00:00:00Z","timestamp":1700956800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-99-8138-0_36","type":"book-chapter","created":{"date-parts":[[2023,11,25]],"date-time":"2023-11-25T10:02:23Z","timestamp":1700906543000},"page":"455-469","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Construction of\u00a0DNA Coding Sets by\u00a0an\u00a0Intelligent Optimization Algorithm: TMOL-TSO"],"prefix":"10.1007","author":[{"given":"Yongxu","family":"Yan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wentao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhihui","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,26]]},"reference":[{"issue":"5187","key":"36_CR1","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"LM Adleman","year":"1994","unstructured":"Adleman, L.M.: Molecular computation of solutions to combinatorial problems. Science 266(5187), 1021\u20131024 (1994)","journal-title":"Science"},{"issue":"5210","key":"36_CR2","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1126\/science.7725109","volume":"268","author":"EB Baum","year":"1995","unstructured":"Baum, E.B.: Building an associative memory vastly larger than the brain. Science 268(5210), 583\u2013585 (1995)","journal-title":"Science"},{"issue":"6862","key":"36_CR3","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1038\/35106533","volume":"414","author":"Y Benenson","year":"2001","unstructured":"Benenson, Y., Paz-Elizur, T., Adar, R., Keinan, E., Livneh, Z., Shapiro, E.: Programmable and autonomous computing machine made of biomolecules. Nature 414(6862), 430\u2013434 (2001)","journal-title":"Nature"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Bornholt, J., Lopez, R., Carmean, D.M., Ceze, L., Seelig, G., Strauss, K.: A DNA-based archival storage system. In: Proceedings of the Twenty-First International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 637\u2013649 (2016)","DOI":"10.1145\/2954680.2872397"},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"29547","DOI":"10.1109\/ACCESS.2020.2970838","volume":"8","author":"B Cao","year":"2020","unstructured":"Cao, B., Zhao, S., Li, X., Wang, B.: K-means multi-verse optimizer (KMVO) algorithm to construct DNA storage codes. Ieee Access 8, 29547\u201329556 (2020)","journal-title":"Ieee Access"},{"issue":"2","key":"36_CR6","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1109\/TNB.2005.850474","volume":"4","author":"WL Chang","year":"2005","unstructured":"Chang, W.L., Guo, M., Ho, M.H.: Fast parallel molecular algorithms for DNA-based computation: factoring integers. IEEE Trans. Nanobiosci. 4(2), 149\u2013163 (2005)","journal-title":"IEEE Trans. Nanobiosci."},{"issue":"6102","key":"36_CR7","doi-asserted-by":"publisher","first-page":"1628","DOI":"10.1126\/science.1226355","volume":"337","author":"GM Church","year":"2012","unstructured":"Church, G.M., Gao, Y., Kosuri, S.: Next-generation digital information storage in DNA. Science 337(6102), 1628\u20131628 (2012)","journal-title":"Science"},{"issue":"3","key":"36_CR8","doi-asserted-by":"publisher","first-page":"1588","DOI":"10.1109\/TIT.2022.3217518","volume":"69","author":"ST Dougherty","year":"2022","unstructured":"Dougherty, S.T., Korban, A., \u015eahinkaya, S., Ustun, D.: Construction of DNA Codes from composite matrices and a bio-inspired optimization algorithm. IEEE Trans. Inf. Theory 69(3), 1588\u20131603 (2022)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"23","key":"36_CR9","doi-asserted-by":"publisher","first-page":"4748","DOI":"10.1093\/nar\/25.23.4748","volume":"25","author":"AG Frutos","year":"1997","unstructured":"Frutos, A.G., et al.: Demonstration of a word design strategy for DNA computing on surfaces. Nucleic Acids Res. 25(23), 4748\u20134757 (1997)","journal-title":"Nucleic Acids Res."},{"issue":"8","key":"36_CR10","doi-asserted-by":"publisher","first-page":"2552","DOI":"10.1002\/anie.201411378","volume":"54","author":"RN Grass","year":"2015","unstructured":"Grass, R.N., Heckel, R., Puddu, M., Paunescu, D., Stark, W.J.: Robust chemical preservation of digital information on DNA in silica with error-correcting codes. Angew. Chem. Int. Ed. 54(8), 2552\u20132555 (2015)","journal-title":"Angew. Chem. Int. Ed."},{"issue":"1","key":"36_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-019-45832-6","volume":"9","author":"R Heckel","year":"2019","unstructured":"Heckel, R., Mikutis, G., Grass, R.N.: A characterization of the DNA data storage channel. Sci. Rep. 9(1), 1\u201312 (2019)","journal-title":"Sci. Rep."},{"key":"36_CR12","unstructured":"Kashiwamura, S., Yamamoto, M., Kameda, A., Ohuchi, A.: Experimental challenge of scaled-up hierarchical DNA memory expressing a 10, 000-address space. In: Preliminary Proceeding of 11th International Meeting on DNA based Computers, London, UK (2005)"},{"issue":"1","key":"36_CR13","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.biosystems.2004.10.007","volume":"80","author":"S Kashiwamura","year":"2005","unstructured":"Kashiwamura, S., Yamamoto, M., Kameda, A., Shiba, T., Ohuchi, A.: Potential for enlarging DNA memory: the validity of experimental operations of scaled-up nested primer molecular memory. Biosystems 80(1), 99\u2013112 (2005)","journal-title":"Biosystems"},{"issue":"8","key":"36_CR14","doi-asserted-by":"publisher","first-page":"1151","DOI":"10.3390\/e24081151","volume":"24","author":"X Li","year":"2022","unstructured":"Li, X., Zhou, S., Zou, L.: Design of DNA storage coding with enhanced constraints. Entropy 24(8), 1151 (2022)","journal-title":"Entropy"},{"issue":"10","key":"36_CR15","doi-asserted-by":"publisher","first-page":"1972","DOI":"10.1109\/LCOMM.2018.2861867","volume":"22","author":"D Limbachiya","year":"2018","unstructured":"Limbachiya, D., Gupta, M.K., Aggarwal, V.: Family of constrained codes for archival DNA data storage. IEEE Commun. Lett. 22(10), 1972\u20131975 (2018)","journal-title":"IEEE Commun. Lett."},{"issue":"5210","key":"36_CR16","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1126\/science.7725098","volume":"268","author":"RJ Lipton","year":"1995","unstructured":"Lipton, R.J.: DNA solution of hard computational problems. Science 268(5210), 542\u2013545 (1995)","journal-title":"Science"},{"issue":"6766","key":"36_CR17","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1038\/35003155","volume":"403","author":"Q Liu","year":"2000","unstructured":"Liu, Q., Wang, L., Frutos, A.G., Condon, A.E., Corn, R.M., Smith, L.M.: DNA computing on surfaces. Nature 403(6766), 175\u2013179 (2000)","journal-title":"Nature"},{"issue":"7","key":"36_CR18","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1038\/nbt.4173","volume":"36","author":"S Palluk","year":"2018","unstructured":"Palluk, S., et al.: De novo DNA synthesis using polymerase-nucleotide conjugates. Nat. Biotechnol. 36(7), 645\u2013650 (2018)","journal-title":"Nat. Biotechnol."},{"issue":"62","key":"36_CR19","doi-asserted-by":"publisher","first-page":"1281","DOI":"10.1098\/rsif.2010.0729","volume":"8","author":"L Qian","year":"2011","unstructured":"Qian, L., Winfree, E.: A simple DNA gate motif for synthesizing large-scale circuits. J. R. Soc. Interface 8(62), 1281\u20131297 (2011)","journal-title":"J. R. Soc. Interface"},{"issue":"6034","key":"36_CR20","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1126\/science.1200520","volume":"332","author":"L Qian","year":"2011","unstructured":"Qian, L., Winfree, E.: Scaling up digital circuit computation with DNA strand displacement cascades. Science 332(6034), 1196\u20131201 (2011)","journal-title":"Science"},{"issue":"7356","key":"36_CR21","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1038\/nature10262","volume":"475","author":"L Qian","year":"2011","unstructured":"Qian, L., Winfree, E., Bruck, J.: Neural network computation with DNA strand displacement cascades. Nature 475(7356), 368\u2013372 (2011)","journal-title":"Nature"},{"key":"36_CR22","doi-asserted-by":"publisher","first-page":"415","DOI":"10.3389\/fgene.2023.1158337","volume":"14","author":"A Rasool","year":"2023","unstructured":"Rasool, A., Jiang, Q., Wang, Y., Huang, X., Qu, Q., Dai, J.: Evolutionary approach to construct robust codes for DNA-based data storage. Front. Genet. 14, 415 (2023)","journal-title":"Front. Genet."},{"key":"36_CR23","first-page":"33","volume":"11","author":"Y Sakakibara","year":"2000","unstructured":"Sakakibara, Y., Suyama, A.: Intelligent DNA chips logical operation of gene expression profiles on DNA computers. Genome Inform. 11, 33\u201342 (2000)","journal-title":"Genome Inform."},{"issue":"7676","key":"36_CR24","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1038\/nature24286","volume":"550","author":"J Shendure","year":"2017","unstructured":"Shendure, J., et al.: DNA sequencing at 40: past, present and future. Nature 550(7676), 345\u2013353 (2017)","journal-title":"Nature"},{"issue":"11","key":"36_CR25","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1038\/s41565-019-0544-5","volume":"14","author":"T Song","year":"2019","unstructured":"Song, T., et al.: Fast and compact DNA logic circuits based on single-stranded gates using strand-displacing polymerase. Nat. Nanotechnol. 14(11), 1075\u20131081 (2019)","journal-title":"Nat. Nanotechnol."},{"key":"36_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-030-00030-1_4","volume-title":"DNA Computing and Molecular Programming","author":"K Stewart","year":"2018","unstructured":"Stewart, K., et al.: A content-addressable DNA database with learned sequence encodings. In: Doty, D., Dietz, H. (eds.) DNA 2018. LNCS, vol. 11145, pp. 55\u201370. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00030-1_4"},{"issue":"1","key":"36_CR27","doi-asserted-by":"publisher","first-page":"14138","DOI":"10.1038\/srep14138","volume":"5","author":"SH Tabatabaei Yazdi","year":"2015","unstructured":"Tabatabaei Yazdi, S.H., Yuan, Y., Ma, J., Zhao, H., Milenkovic, O.: A rewritable, random-access DNA-based storage system. Sci. Rep. 5(1), 14138 (2015)","journal-title":"Sci. Rep."},{"key":"36_CR28","doi-asserted-by":"crossref","unstructured":"Tizhoosh, H.R.: 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 2006), vol.\u00a01, pp. 695\u2013701. IEEE (2005)","DOI":"10.1109\/CIMCA.2005.1631345"},{"issue":"6","key":"36_CR29","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1109\/LCOMM.2019.2912572","volume":"23","author":"Y Wang","year":"2019","unstructured":"Wang, Y., Noor-A-Rahim, M., Gunawan, E., Guan, Y.L., Poh, C.L.: Construction of bio-constrained code for DNA data storage. IEEE Commun. Lett. 23(6), 963\u2013966 (2019)","journal-title":"IEEE Commun. Lett."},{"issue":"1","key":"36_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0303-2647(00)00133-7","volume":"59","author":"H Wu","year":"2001","unstructured":"Wu, H.: An improved surface-based method for DNA computation. Biosystems 59(1), 1\u20135 (2001)","journal-title":"Biosystems"},{"issue":"7","key":"36_CR31","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0255376","volume":"16","author":"L Xiaoru","year":"2021","unstructured":"Xiaoru, L., Ling, G.: Combinatorial constraint coding based on the EORS algorithm in DNA storage. PLoS ONE 16(7), e0255376 (2021)","journal-title":"PLoS ONE"},{"key":"36_CR32","doi-asserted-by":"crossref","unstructured":"Xie, L., Wang, S., Zhu, D., Hu, G., Zhou, C.: DNA sequence optimization design of arithmetic optimization algorithm based on billiard hitting strategy. In: Interdisciplinary Sciences: Computational Life Science, pp. 1\u201318 (2023)","DOI":"10.1007\/s12539-023-00559-x"},{"key":"36_CR33","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s11047-008-9076-x","volume":"7","author":"M Yamamoto","year":"2008","unstructured":"Yamamoto, M., Kashiwamura, S., Ohuchi, A., Furukawa, M.: Large-scale DNA memory based on the nested PCR. Nat. Comput. 7, 335\u2013346 (2008)","journal-title":"Nat. Comput."},{"issue":"6","key":"36_CR34","doi-asserted-by":"publisher","first-page":"2191","DOI":"10.3390\/ijms21062191","volume":"21","author":"Q Yin","year":"2020","unstructured":"Yin, Q., Cao, B., Li, X., Wang, B., Zhang, Q., Wei, X.: An intelligent optimization algorithm for constructing a DNA storage code: NOL-HHO. Int. J. Mol. Sci. 21(6), 2191 (2020)","journal-title":"Int. J. Mol. Sci."},{"key":"36_CR35","doi-asserted-by":"publisher","first-page":"104513","DOI":"10.1109\/ACCESS.2021.3094876","volume":"9","author":"Q Zhou","year":"2021","unstructured":"Zhou, Q., Wang, X., Zhou, C.: DNA design based on improved ant colony optimization algorithm with bloch sphere. IEEE Access 9, 104513\u2013104521 (2021)","journal-title":"IEEE Access"}],"container-title":["Communications in Computer and Information Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8138-0_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,3]],"date-time":"2024-11-03T09:36:35Z","timestamp":1730626595000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8138-0_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,26]]},"ISBN":["9789819981373","9789819981380"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8138-0_36","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023,11,26]]},"assertion":[{"value":"26 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICONIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Changsha","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iconip2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iconip2023.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1274","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"650","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.14","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.46","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}