{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T16:04:33Z","timestamp":1775837073089,"version":"3.50.1"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030953874","type":"print"},{"value":"9783030953881","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-95388-1_19","type":"book-chapter","created":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T08:20:55Z","timestamp":1645518055000},"page":"284-299","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A Strategy-based Optimization Algorithm to\u00a0Design Codes for\u00a0DNA Data Storage System"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5334-9001","authenticated-orcid":false,"given":"Abdur","family":"Rasool","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5814-8460","authenticated-orcid":false,"given":"Qiang","family":"Qu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8040-0308","authenticated-orcid":false,"given":"Qingshan","family":"Jiang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9438-6060","authenticated-orcid":false,"given":"Yang","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,23]]},"reference":[{"key":"19_CR1","unstructured":"David Reinsel, J.G.: John Rydning, Data Age 2025: The Digitization of the World From Edge to Core, in An IDC White Paper. IDC, November 2018"},{"issue":"6328","key":"19_CR2","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1126\/science.aaj2038","volume":"355","author":"Y Erlich","year":"2017","unstructured":"Erlich, Y., Zielinski, D.: DNA fountain enables a robust and efficient storage architecture. Science 355(6328), 950\u2013953 (2017)","journal-title":"Science"},{"issue":"3","key":"19_CR3","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1109\/MM.2017.70","volume":"37","author":"J Bornholt","year":"2017","unstructured":"Bornholt, J., et al.: Toward a DNA-based archival storage system. IEEE Micro 37(3), 98\u2013104 (2017)","journal-title":"IEEE Micro"},{"issue":"6102","key":"19_CR4","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":"7435","key":"19_CR5","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1038\/nature11875","volume":"494","author":"N Goldman","year":"2013","unstructured":"Goldman, N., et al.: Towards practical, high-capacity, low-maintenance information storage in synthesized DNA. Nature 494(7435), 77\u201380 (2013)","journal-title":"Nature"},{"issue":"1","key":"19_CR6","doi-asserted-by":"publisher","first-page":"18063","DOI":"10.1038\/s41598-021-97570-3","volume":"11","author":"M Li","year":"2021","unstructured":"Li, M., et al.: A self-contained and self-explanatory DNA storage system. Sci. Rep. 11(1), 18063 (2021)","journal-title":"Sci. Rep."},{"issue":"10","key":"19_CR7","doi-asserted-by":"publisher","first-page":"2004","DOI":"10.1109\/LCOMM.2018.2866566","volume":"22","author":"W Song","year":"2018","unstructured":"Song, W., et al.: Codes with run-length and GC-content constraints for DNA-based data storage. IEEE Commun. Lett. 22(10), 2004\u20132007 (2018)","journal-title":"IEEE Commun. Lett."},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.knosys.2015.07.006","volume":"89","author":"S Mirjalili","year":"2015","unstructured":"Mirjalili, S.: Moth-flame optimization algorithm: a novel nature-inspired heuristic paradigm. Knowl.-Based Syst. 89, 228\u2013249 (2015)","journal-title":"Knowl.-Based Syst."},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Emary, E., et al.: Firefly optimization algorithm for feature selection. In: Proceedings of the 7th Balkan Conference on Informatics Conference, Association for Computing Machinery: Craiova, Romania. p. Article 26 (2015)","DOI":"10.1145\/2801081.2801091"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili, S., Mirjalili, S.M., Lewis, A.: Grey wolf optimizer. Adv. Eng. Softw. 69, 46\u201361 (2014)","journal-title":"Adv. Eng. Softw."},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1016\/j.future.2019.02.028","volume":"97","author":"AA Heidari","year":"2019","unstructured":"Heidari, A.A., et al.: Harris hawks optimization: algorithm and applications. Future Gener. Comput. Syst. 97, 849\u2013872 (2019)","journal-title":"Future Gener. Comput. Syst."},{"issue":"2","key":"19_CR12","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s00521-015-1870-7","volume":"27","author":"S Mirjalili","year":"2015","unstructured":"Mirjalili, S., Mirjalili, S.M., Hatamlou, A.: Multi-verse optimizer: a nature-inspired algorithm for global optimization. Neural Comput. Appl. 27(2), 495\u2013513 (2015). https:\/\/doi.org\/10.1007\/s00521-015-1870-7","journal-title":"Neural Comput. Appl."},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"29547","DOI":"10.1109\/ACCESS.2020.2970838","volume":"8","author":"B Cao","year":"2020","unstructured":"Cao, B., et al.: K-means multi-verse optimizer (KMVO) algorithm to construct DNA storage codes. IEEE Access 8, 29547\u201329556 (2020)","journal-title":"IEEE Access"},{"issue":"10","key":"19_CR14","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. Letters 22(10), 1972\u20131975 (2018)","journal-title":"IEEE Commun. Letters"},{"issue":"5","key":"19_CR15","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1016\/j.disc.2011.11.021","volume":"312","author":"N Aboluion","year":"2012","unstructured":"Aboluion, N., Smith, D.H., Perkins, S.: Linear and nonlinear constructions of DNA codes with hamming distance d, constant GC-content and a reverse-complement constraint. Discrete Math. 312(5), 1062\u20131075 (2012)","journal-title":"Discrete Math."},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"113609","DOI":"10.1016\/j.cma.2020.113609","volume":"376","author":"L Abualigah","year":"2021","unstructured":"Abualigah, L., et al.: The arithmetic optimization algorithm. Comput. Methods Appl. Mech. Eng. 376, 113609 (2021)","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"19_CR17","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) (2005)"},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"191850","DOI":"10.1109\/ACCESS.2020.3030642","volume":"8","author":"A Rasool","year":"2020","unstructured":"Rasool, A., et al.: GAWA-a feature selection method for hybrid sentiment classification. IEEE Access 8, 191850\u2013191861 (2020)","journal-title":"IEEE Access"},{"issue":"2","key":"19_CR19","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/BF03008904","volume":"3","author":"DH Kim","year":"1996","unstructured":"Kim, D.H., Kim, Y.C.: Wilcoxon signed rank test using ranked-set sample. Korean J. Comput. Appl. Math. 3(2), 235\u2013243 (1996)","journal-title":"Korean J. Comput. Appl. Math."},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1109\/TIT.2007.911167","volume":"54","author":"YM Chee","year":"2008","unstructured":"Chee, Y.M., Ling, S.: Improved lower bounds for constant GC-content DNA codes. IEEE Trans. Inf. Theory 54, 391\u2013394 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"19_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/11753681_22","volume-title":"DNA Computing","author":"J Sager","year":"2006","unstructured":"Sager, J., Stefanovic, D.: Designing nucleotide sequences for computation: a survey of constraints. In: Carbone, A., Pierce, N.A. (eds.) DNA 2005. LNCS, vol. 3892, pp. 275\u2013289. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11753681_22"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-95388-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T08:30:34Z","timestamp":1645518634000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95388-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030953874","9783030953881"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95388-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"23 February 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ica3pp2021\/index.html","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":"403","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":"145","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":"36% - 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.12","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.27","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)"}}]}}