{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:31:38Z","timestamp":1742913098618,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":25,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811534140"},{"type":"electronic","value":"9789811534157"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-981-15-3415-7_14","type":"book-chapter","created":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T19:02:58Z","timestamp":1585767778000},"page":"178-188","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Reference Point Based Multi-objective Evolutionary Algorithm for DNA Sequence Design"],"prefix":"10.1007","author":[{"given":"Haozhi","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3767-2049","authenticated-orcid":false,"given":"Zhiwei","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,2]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Yang, R., Zhang, C., Gao, R.: A new bionic method inspired by DNA computation to solve the hamiltonian path problem. In: IEEE International Conference on Information and Automation (ICIA), pp. 219\u2013225. IEEE (2017)","DOI":"10.1109\/ICInfA.2017.8078909"},{"issue":"6","key":"14_CR2","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1016\/j.jcss.2016.03.008","volume":"82","author":"B Song","year":"2016","unstructured":"Song, B., P\u00e9rez-Jim\u00e9nez, M.J., Pan, L.: An efficient time-free solution to SAT problem by P systems with proteins on membranes. J. Comput. Syst. Sci. 82(6), 1090\u20131099 (2016)","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR3","unstructured":"Wang, X.: Research on solution of TSP based on improved genetic algorithm. In: International Conference on Engineering Simulation and Intelligent Control (ESAIC), pp. 78\u201382. IEEE (2018)"},{"issue":"3","key":"14_CR4","first-page":"731","volume":"75","author":"N Jafarzadeh","year":"2016","unstructured":"Jafarzadeh, N., Iranmanesh, A.: A new graph theoretical method for analyzing DNA sequences based on genetic codes. MATCH-Commun. Math. Comput. Chem. 75(3), 731\u2013742 (2016)","journal-title":"MATCH-Commun. Math. Comput. Chem."},{"key":"14_CR5","first-page":"291","volume":"227","author":"JM Chaves-Gonz\u00e1lez","year":"2014","unstructured":"Chaves-Gonz\u00e1lez, J.M., Vega-Rodrg\u00eduez, M.A.: A multiobjective approach based on the behavior of fireflies to generate reliable DNA sequences for molecular computing. Appl. Math. Comput. 227, 291\u2013308 (2014)","journal-title":"Appl. Math. Comput."},{"issue":"23","key":"14_CR6","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., Liu, Q., Thiel, A.J., 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":"1\u20133","key":"14_CR7","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/S0303-2647(99)00050-7","volume":"52","author":"AJ Hartemink","year":"1999","unstructured":"Hartemink, A.J., Gifford, D.K., Khodor, J.: Automated constraint-based nucleotide sequence selection for DNA computation. Biosystems 52(1\u20133), 227\u2013235 (1999)","journal-title":"Biosystems"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/3-540-48017-X_3","volume-title":"DNA Computing","author":"U Feldkamp","year":"2002","unstructured":"Feldkamp, U., Saghafi, S., Banzhaf, W., Rauhe, H.: DNASequenceGenerator: a program for the construction of DNA sequences. In: Jonoska, N., Seeman, N.C. (eds.) DNA 2001. LNCS, vol. 2340, pp. 23\u201332. Springer, Heidelberg (2002). \nhttps:\/\/doi.org\/10.1007\/3-540-48017-X_3"},{"key":"14_CR9","unstructured":"Arita, M., Nishikawa, A., Hagiya, M., et al.: Improving sequence design for DNA computing. In: Conference on Genetic and Evolutionary Computation, pp. 875\u2013882. Morgan Kaufmann Publishers Inc. (2000)"},{"key":"14_CR10","unstructured":"Shin, S.Y., Kim, D.M., Lee, I.H., et al.: Evolutionary sequence generation for reliable DNA computing. In: 2002 Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002, pp. 79\u201384. IEEE (2002)"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Xu, C., Zhang, Q., Wang, B., et al.: Research on the DNA sequence design based on GA\/PSO algorithms. In: The International Conference on Bioinformatics and Biomedical Engineering, pp. 816\u2013819. IEEE (2008)","DOI":"10.1109\/ICBBE.2008.200"},{"key":"14_CR12","unstructured":"Kurniawan, T.B., Khalid, N.K., Ibrahim, Z., et al.: Sequence design for direct-proportional length-based DNA computing using population-based ant colony optimization. In: ICCAS-SICE, pp. 1486\u20131491. IEEE (2009)"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.matcom.2018.03.011","volume":"151","author":"Y Wang","year":"2018","unstructured":"Wang, Y., Shen, Y., Zhang, X., et al.: An improved non-dominated sorting genetic algorithm-II (INSGA-II) applied to the design of DNA codewords. Math. Comput. Simul. 151, 131\u2013139 (2018)","journal-title":"Math. Comput. Simul."},{"issue":"4","key":"14_CR14","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1109\/TNB.2010.2069570","volume":"9","author":"Q Zhang","year":"2010","unstructured":"Zhang, Q., Wang, B., Wei, X., et al.: DNA word set design based on minimum free energy. IEEE Trans. Nanobioscience 9(4), 273\u2013277 (2010)","journal-title":"IEEE Trans. Nanobioscience"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Muhammad, M.S., Selvan, K.V., Masra, S.M.W., et al.: An improved binary particle swarm optimization algorithm for DNA encoding enhancement. In: Swarm Intelligence, pp. 1\u20138. IEEE (2011)","DOI":"10.1109\/SIS.2011.5952579"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Mantha, A., Purdy, G., Purdy, C.: Improving reliability in DNA-based computations. In: IEEE International Midwest Symposium on Circuits and Systems, pp. 1047\u20131050. IEEE (2013)","DOI":"10.1109\/MWSCAS.2013.6674832"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Ibrahim, Z., Khalid, N.K., Lim, K.S., et al.: A binary vector evaluated particle swarm optimization based method for DNA sequence design problem. In: Research and Development, pp. 160\u2013164. IEEE (2012)","DOI":"10.1109\/SCOReD.2011.6148727"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Kurniawan, T.B., Khalid, N.K., Ibrahim, Z., et al.: Evaluation of ordering methods for DNA sequence design based on ant colony system. In: Second Asia International Conference on Modelling and Simulation, pp. 905\u2013910. IEEE Computer Society (2008)","DOI":"10.1109\/AMS.2008.37"},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.ecoinf.2014.09.012","volume":"29","author":"KS Jeong","year":"2015","unstructured":"Jeong, K.S., Kim, M.H., Jo, H., et al.: Search of optimal locations for species-or group-specific primer design in DNA sequences: non-dominated sorting genetic algorithm II (NSGA-II). Ecol. Inform. 29, 214\u2013220 (2015)","journal-title":"Ecol. Inform."},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Peng, X., Zheng, X., Wang, B., et al.: A micro-genetic algorithm for DNA encoding sequences design. In: International Conference on Control Science and Systems Engineering, pp. 10\u201314. IEEE (2016)","DOI":"10.1109\/CCSSE.2016.7784342"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Deb, K., Sundar, J.: Reference point based multi-objective optimization using evolutionary algorithms. In: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, pp. 635\u2013642. ACM (2006)","DOI":"10.1145\/1143997.1144112"},{"issue":"3","key":"14_CR22","doi-asserted-by":"publisher","first-page":"279","DOI":"10.3233\/ICA-170542","volume":"24","author":"L Pan","year":"2017","unstructured":"Pan, L., He, C., Tian, Y., Su, Y., Zhang, X.: A region division based diversity maintaining approach for many-objective optimization. Integr. Comput.-Aided Eng. 24(3), 279\u2013296 (2017)","journal-title":"Integr. Comput.-Aided Eng."},{"key":"14_CR23","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1016\/j.asoc.2017.08.024","volume":"61","author":"C He","year":"2017","unstructured":"He, C., Tian, Y., Jin, Y., Zhang, X., Pan, L.: A radial space division based evolutionary algorithm for many-objective optimization. Appl. Soft Comput. 61, 603\u2013621 (2017)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"14_CR24","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1109\/TEVC.2018.2802784","volume":"23","author":"L Pan","year":"2018","unstructured":"Pan, L., He, C., Tian, Y., Wang, H., Zhang, X., Jin, Y.: A classification-based surrogate-assisted evolutionary algorithm for expensive many-objective optimization. IEEE Trans. Evol. Comput. 23(1), 74\u201388 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"14_CR25","doi-asserted-by":"publisher","unstructured":"Pan, L., Li, L., He, C., Tan, K.C.: A subregion division-based evolutionary algorithm with effective mating selection for many-objective optimization. IEEE Trans. Cybern. (2019). \nhttps:\/\/doi.org\/10.1109\/TCYB.2019.2906679","DOI":"10.1109\/TCYB.2019.2906679"}],"container-title":["Communications in Computer and Information Science","Bio-inspired Computing: Theories and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-3415-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T01:22:48Z","timestamp":1585790568000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-3415-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811534140","9789811534157"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-3415-7_14","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BIC-TA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Bio-Inspired Computing: Theories and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zhengzhou","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bicta2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2019.bicta.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":"197","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":"121","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":"61% - 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":"3","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":"3","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)"}}]}}