{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T02:07:52Z","timestamp":1769047672432,"version":"3.49.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T00:00:00Z","timestamp":1721088000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T00:00:00Z","timestamp":1721088000000},"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":["62272418"],"award-info":[{"award-number":["62272418"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62102058"],"award-info":[{"award-number":["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":["LGG18E050011"],"award-info":[{"award-number":["LGG18E050011"]}],"id":[{"id":"10.13039\/501100017577","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10586-024-04675-1","type":"journal-article","created":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T16:02:21Z","timestamp":1721145741000},"page":"14167-14183","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["DNA sequences design under many objective evolutionary algorithm"],"prefix":"10.1007","volume":"27","author":[{"given":"Huaiyu","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donglin","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changjun","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengye","family":"Zou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,16]]},"reference":[{"key":"4675_CR1","doi-asserted-by":"publisher","first-page":"88811","DOI":"10.1109\/ACCESS.2019.2924708","volume":"7","author":"K Liu","year":"2019","unstructured":"Liu, K., Wang, B., Lv, H., Wei, X., Zhang, Q.: A bpson algorithm applied to DNA codes design. IEEE Access 7, 88811\u201388821 (2019)","journal-title":"IEEE Access"},{"issue":"5187","key":"4675_CR2","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":"18","key":"4675_CR3","doi-asserted-by":"publisher","first-page":"188702","DOI":"10.1103\/PhysRevLett.106.188702","volume":"106","author":"J-J Shu","year":"2011","unstructured":"Shu, J.-J., Wang, Q.-W., Yong, K.-Y.: DNA-based computing of strategic assignment problems. Phys. Rev. Lett. 106(18), 188702 (2011)","journal-title":"Phys. Rev. Lett."},{"issue":"10","key":"4675_CR4","doi-asserted-by":"publisher","first-page":"4085","DOI":"10.1109\/TGRS.2012.2188856","volume":"50","author":"H Jiao","year":"2012","unstructured":"Jiao, H., Zhong, Y., Zhang, L.: Artificial DNA computing-based spectral encoding and matching algorithm for hyperspectral remote sensing data. IEEE Trans. Geosci. Remote Sens. 50(10), 4085\u20134104 (2012)","journal-title":"IEEE Trans. Geosci. Remote Sens."},{"issue":"6","key":"4675_CR5","doi-asserted-by":"publisher","first-page":"1284","DOI":"10.1049\/cje.2017.07.013","volume":"26","author":"Z Yin","year":"2017","unstructured":"Yin, Z., Cui, J., Yang, J.: Integer programming problem based on plasmid DNA computing model. Chin. J. Electron. 26(6), 1284\u20131288 (2017)","journal-title":"Chin. J. Electron."},{"issue":"3s","key":"4675_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3392665","volume":"16","author":"S Namasudra","year":"2020","unstructured":"Namasudra, S., Chakraborty, R., Majumder, A., Moparthi, N.R.: Securing multimedia by using DNA-based encryption in the cloud computing environment. ACM Trans. Multimedia Comput. Commun. Appl. 16(3s), 1\u201319 (2020)","journal-title":"ACM Trans. Multimedia Comput. Commun. Appl."},{"issue":"2","key":"4675_CR7","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.: Multiobjective evolutionary optimization of DNA sequences for reliable DNA computing. IEEE Trans. Evol. Comput. 9(2), 143\u2013158 (2005)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"4675_CR8","first-page":"1","volume":"1","author":"X Yang","year":"2023","unstructured":"Yang, X., Zhou, C.: DNA sequences under multiple Guanine\u2013Cytosine (G\u2013C) base pairs constraint. IEEE Trans. NanoBiosci. 1, 1 (2023)","journal-title":"IEEE Trans. NanoBiosci."},{"key":"4675_CR9","first-page":"138","volume":"1","author":"R Deaton","year":"1998","unstructured":"Deaton, R., Garzon, M.: Thermodynamic constraints on DNA-based computing. Comput. Bio-Mol. 1, 138\u2013152 (1998)","journal-title":"Comput. Bio-Mol."},{"issue":"2","key":"4675_CR10","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.: Constraining DNA sequences with a triplet-bases unpaired. IEEE Trans. Nanobiosci. 19(2), 299\u2013307 (2020)","journal-title":"IEEE Trans. Nanobiosci."},{"key":"4675_CR11","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.: A many-objective memetic generalized differential evolution algorithm for DNA sequence design. IEEE Access 8, 222684\u2013222699 (2020)","journal-title":"IEEE Access"},{"issue":"3","key":"4675_CR12","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.: Improved bare bones particle swarm optimization for DNA sequence design. IEEE Trans. Nanobiosci. 22(3), 603\u2013613 (2022)","journal-title":"IEEE Trans. Nanobiosci."},{"issue":"2","key":"4675_CR13","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.: DNA sequence optimization design of arithmetic optimization algorithm based on billiard hitting strategy. Interdiscip. Sci. Comput. Life Sci. 15(2), 231\u2013248 (2023)","journal-title":"Interdiscip. Sci. Comput. Life Sci."},{"key":"4675_CR14","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.: Iwo algorithm based on niche crowding for DNA sequence design. Interdiscip. Sci. Comput. Life Sci. 9, 341\u2013349 (2017)","journal-title":"Interdiscip. Sci. Comput. Life Sci."},{"key":"4675_CR15","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.biosystems.2013.12.005","volume":"116","author":"JM Chaves-Gonzalez","year":"2014","unstructured":"Chaves-Gonzalez, J.M., Vega-Rodriguez, M.A.: DNA strand generation for DNA computing by using a multi-objective differential evolution algorithm. Biosystems 116, 49\u201364 (2014)","journal-title":"Biosystems"},{"key":"4675_CR16","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, J.M., Mart\u00ednez-Gil, J.: An efficient design for a multi-objective evolutionary algorithm to generate DNA libraries suitable for computation. Interdiscip. Sci. Comput. Life Sci. 11, 542\u2013558 (2019)","journal-title":"Interdiscip. Sci. Comput. Life Sci."},{"key":"4675_CR17","doi-asserted-by":"crossref","unstructured":"Zitzler, E., Thiele, L.: Multiobjective optimization using evolutionary algorithms\u2014a comparative case study. In: International Conference on Parallel Problem Solving from Nature, pp. 292\u2013301 (1998). Springer","DOI":"10.1007\/BFb0056872"},{"key":"4675_CR18","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/j.ins.2019.02.054","volume":"509","author":"W Tang","year":"2020","unstructured":"Tang, W., Liu, H.-L., Chen, L., Tan, K.C., Cheung, Y.-M.: Fast hypervolume approximation scheme based on a segmentation strategy. Inf. Sci. 509, 320\u2013342 (2020)","journal-title":"Inf. Sci."},{"issue":"1","key":"4675_CR19","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1109\/TEVC.2019.2909271","volume":"24","author":"K Shang","year":"2019","unstructured":"Shang, K., Ishibuchi, H., Ni, X.: R2-based hypervolume contribution approximation. IEEE Trans. Evol. Comput. 24(1), 185\u2013192 (2019)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"5","key":"4675_CR20","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1109\/TEVC.2020.2964705","volume":"24","author":"K Shang","year":"2020","unstructured":"Shang, K., Ishibuchi, H.: A new hypervolume-based evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 24(5), 839\u2013852 (2020)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"4675_CR21","doi-asserted-by":"publisher","first-page":"1373","DOI":"10.1007\/s10462-019-09704-9","volume":"53","author":"E Varol Altay","year":"2020","unstructured":"Varol Altay, E., Alatas, B.: Bird swarm algorithms with chaotic mapping. Artif. Intell. Rev. 53(2), 1373\u20131414 (2020)","journal-title":"Artif. Intell. Rev."},{"key":"4675_CR22","doi-asserted-by":"publisher","first-page":"107404","DOI":"10.1016\/j.compbiomed.2023.107404","volume":"165","author":"A Rasool","year":"2023","unstructured":"Rasool, A., Hong, J., Jiang, Q., Chen, H., Qu, Q.: Bo-dna: biologically optimized encoding model for a highly-reliable DNA data storage. Comput. Biol. Med. 165, 107404 (2023). https:\/\/doi.org\/10.1016\/j.compbiomed.2023.107404","journal-title":"Comput. Biol. Med."},{"issue":"2","key":"4675_CR23","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: Nsga-ii. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"4675_CR24","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.: Improved multi-strategy matrix particle swarm optimization for DNA sequence design. Electronics 12(3), 547 (2023)","journal-title":"Electronics"},{"key":"4675_CR25","doi-asserted-by":"crossref","unstructured":"Ishibuchi, H., Tsukamoto, N., Hitotsuyanagi, Y., Nojima, Y.: Effectiveness of scalability improvement attempts on the performance of NSGA-II for many-objective problems. In: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation, pp. 649\u2013656 (2008)","DOI":"10.1145\/1389095.1389225"},{"issue":"6","key":"4675_CR26","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1109\/TEVC.2007.910138","volume":"11","author":"RC Purshouse","year":"2007","unstructured":"Purshouse, R.C., Fleming, P.J.: On the evolutionary optimization of many conflicting objectives. IEEE Trans. Evol. Comput. 11(6), 770\u2013784 (2007)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"4675_CR27","doi-asserted-by":"crossref","unstructured":"Khare, V., Yao, X., Deb, K.: Performance scaling of multi-objective evolutionary algorithms. In: International Conference on Evolutionary Multi-criterion Optimization, pp. 376\u2013390 (2003). Springer","DOI":"10.1007\/3-540-36970-8_27"},{"key":"4675_CR28","doi-asserted-by":"crossref","unstructured":"Yao, X.: How well do multi-objective evolutionary algorithms scale to large problems. In: 2007 IEEE Congress on Evolutionary Computation, pp. 3959\u20133966 (2007). IEEE","DOI":"10.1109\/CEC.2007.4424987"},{"issue":"3","key":"4675_CR29","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1162\/EVCO_a_00053","volume":"20","author":"D Hadka","year":"2012","unstructured":"Hadka, D., Reed, P.: Diagnostic assessment of search controls and failure modes in many-objective evolutionary optimization. Evol. Comput. 20(3), 423\u2013452 (2012)","journal-title":"Evol. Comput."},{"key":"4675_CR30","doi-asserted-by":"crossref","unstructured":"Wagner, T., Beume, N., Naujoks, B.: Pareto-, aggregation-, and indicator-based methods in many-objective optimization. In: International Conference on Evolutionary Multi-criterion Optimization, pp. 742\u2013756 (2007). Springer","DOI":"10.1007\/978-3-540-70928-2_56"},{"issue":"2","key":"4675_CR31","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"ZW Geem","year":"2001","unstructured":"Geem, Z.W., Kim, J.H., Loganathan, G.V.: A new heuristic optimization algorithm: harmony search. Simulation 76(2), 60\u201368 (2001)","journal-title":"Simulation"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-024-04675-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-024-04675-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-024-04675-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,24]],"date-time":"2024-11-24T06:52:35Z","timestamp":1732431155000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-024-04675-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,16]]},"references-count":31,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["4675"],"URL":"https:\/\/doi.org\/10.1007\/s10586-024-04675-1","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,16]]},"assertion":[{"value":"21 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 July 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 July 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 no conflict on interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}