{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T04:02:13Z","timestamp":1750132933525,"version":"3.41.0"},"publisher-location":"Singapore","reference-count":29,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819682973"},{"type":"electronic","value":"9789819682980"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-8298-0_20","type":"book-chapter","created":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T10:48:07Z","timestamp":1750070887000},"page":"246-258","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient DNA Fragment Assembly Based on Discrete Slime Mould Algorithm"],"prefix":"10.1007","author":[{"given":"Shuqing","family":"Si","sequence":"first","affiliation":[]},{"given":"Ben","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Qi","family":"Shao","sequence":"additional","affiliation":[]},{"given":"Lijun","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Yanfen","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Bin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Pan","family":"Zheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,15]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Cao, B., et al.: Efficient data reconstruction: The bottleneck of large-scale application of DNA storage. Cell Reports 2024, 43","DOI":"10.1016\/j.celrep.2024.113699"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1515\/itit-2015-0047","volume":"58","author":"EW Myers Jr","year":"2016","unstructured":"Myers, E.W., Jr.: A history of DNA sequence assembly. It-Information Technol. 58, 126\u2013132 (2016)","journal-title":"It-Information Technol."},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Phillippy, A.M.: New advances in sequence assembly. 2017, 27, xi-xiii","DOI":"10.1101\/gr.223057.117"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"10867","DOI":"10.1007\/s10462-023-10435-1","volume":"56","author":"Y Yue","year":"2023","unstructured":"Yue, Y., et al.: Review and empirical analysis of sparrow search algorithm. Artif. Intell. Rev. 56, 10867\u201310919 (2023)","journal-title":"Artif. Intell. Rev."},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1038\/s41587-019-0072-8","volume":"37","author":"M Kolmogorov","year":"2019","unstructured":"Kolmogorov, M., Yuan, J., Lin, Y., Pevzner, P.A.: Assembly of long, error-prone reads using repeat graphs. Nat. Biotechnol. 37, 540\u2013546 (2019)","journal-title":"Nat. Biotechnol."},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1038\/s41592-019-0669-3","volume":"17","author":"J Ruan","year":"2020","unstructured":"Ruan, J., Li, H.: Fast and accurate long-read assembly with wtdbg2. Nat. Methods 17, 155\u2013158 (2020)","journal-title":"Nat. Methods"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"1044","DOI":"10.1038\/s41587-020-0503-6","volume":"38","author":"K Shafin","year":"2020","unstructured":"Shafin, K., et al.: Nanopore sequencing and the Shasta toolkit enable efficient de novo assembly of eleven human genomes. Nat. Biotechnol. 38, 1044\u20131053 (2020)","journal-title":"Nat. Biotechnol."},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Pevzner, P.: Computational molecular biology: an algorithmic approach. MIT Press (2000)","DOI":"10.7551\/mitpress\/2022.001.0001"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Meksangsouy, P., Chaiyaratana, N.: DNA fragment assembly using an ant colony system algorithm. In Proceedings of the the 2003 Congress on Evolutionary Computation, 2003. CEC'03, pp. 1756\u20131763 (2003)","DOI":"10.1109\/CEC.2003.1299885"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Zhao, Y., Ma, P., Lan, J., Liang, C., Ji, G.: An improved ant colony algorithm for DNA sequence alignment. In: Proceedings of the 2008 International Symposium on Information Science and Engineering, pp. 683\u2013688 (2008)","DOI":"10.1109\/ISISE.2008.82"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Alba, E., Luque, G.: A new local search algorithm for the DNA fragment assembly problem. In: Proceedings of the Evolutionary Computation in Combinatorial Optimization: 7th European Conference, EvoCOP 2007, Valencia, Spain, April 11\u201313, 2007. Proceedings 7, pp. 1\u201312 (2007)","DOI":"10.1007\/978-3-540-71615-0_1"},{"key":"20_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110132","volume":"136","author":"SJ Lee","year":"2023","unstructured":"Lee, S.J., Kim, B.S.: Two-stage meta-heuristic for part-packing and build-scheduling problem in parallel additive manufacturing. Appl. Soft Comput. 136, 110132 (2023)","journal-title":"Appl. Soft Comput."},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10462-024-10920-1","volume":"57","author":"A Kaur","year":"2024","unstructured":"Kaur, A., Kumar, Y., Sidhu, J.: Exploring meta-heuristics for partitional clustering: methods, metrics, datasets, and challenges. Artif. Intell. Rev. 57, 1\u201360 (2024)","journal-title":"Artif. Intell. Rev."},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"339","DOI":"10.3390\/math12020339","volume":"12","author":"Z Ma","year":"2024","unstructured":"Ma, Z., Gao, K., Yu, H., Wu, N.: Solving heterogeneous USV scheduling problems by problem-specific knowledge based meta-heuristics with Q-learning. Mathematics 12, 339 (2024)","journal-title":"Mathematics"},{"key":"20_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.apenergy.2024.123437","volume":"367","author":"Y Li","year":"2024","unstructured":"Li, Y., Liu, G., Deng, W., Li, Z.: Comparative study on parameter identification of an electrochemical model for lithium-ion batteries via meta-heuristic methods. Appl. Energy 367, 123437 (2024)","journal-title":"Appl. Energy"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Almalaq, A., Alqunun, K., Abbassi, R., Ali, Z.M., Refaat, M.M., Abdel Aleem, S.H.: Integrated transmission expansion planning incorporating fault current limiting devices and thyristor-controlled series compensation using meta-heuristic optimization techniques. Sci. Rep. 14, 13046 (2024)","DOI":"10.1038\/s41598-024-63331-1"},{"key":"20_CR17","doi-asserted-by":"publisher","first-page":"1709","DOI":"10.1007\/s00500-015-1875-2","volume":"21","author":"A Ben Ali","year":"2017","unstructured":"Ben Ali, A., Luque, G., Alba, E., Melkemi, K.E.: An improved problem aware local search algorithm for the DNA fragment assembly problem. Soft. Comput. 21, 1709\u20131720 (2017)","journal-title":"Soft. Comput."},{"key":"20_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.110248","volume":"262","author":"M Abdel-Basset","year":"2023","unstructured":"Abdel-Basset, M., Mohamed, R., Jameel, M., Abouhawwash, M.: Nutcracker optimizer: A novel nature-inspired metaheuristic algorithm for global optimization and engineering design problems. Knowl.-Based Syst. 262, 110248 (2023)","journal-title":"Knowl.-Based Syst."},{"key":"20_CR19","doi-asserted-by":"publisher","first-page":"3466","DOI":"10.3390\/math10193466","volume":"10","author":"M Abdel-Basset","year":"2022","unstructured":"Abdel-Basset, M., Mohamed, R., Sallam, K.M., Chakrabortty, R.K.: Light spectrum optimizer: a novel physics-inspired metaheuristic optimization algorithm. Mathematics 10, 3466 (2022)","journal-title":"Mathematics"},{"key":"20_CR20","doi-asserted-by":"publisher","first-page":"11675","DOI":"10.1007\/s10462-023-10446-y","volume":"56","author":"M Abdel-Basset","year":"2023","unstructured":"Abdel-Basset, M., Mohamed, R., Jameel, M., Abouhawwash, M.: Spider wasp optimizer: a novel meta-heuristic optimization algorithm. Artif. Intell. Rev. 56, 11675\u201311738 (2023)","journal-title":"Artif. Intell. Rev."},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Zolf, K.: Gold rush optimizer: a new population-based metaheuristic algorithm. Operations Research and Decisions 2023, 33","DOI":"10.37190\/ord230108"},{"key":"20_CR22","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.ins.2017.07.039","volume":"420","author":"D Bucur","year":"2017","unstructured":"Bucur, D.: A stochastic de novo assembly algorithm for viral-sized genomes obtains correct genomes and builds consensus. Inf. Sci. 420, 184\u2013199 (2017)","journal-title":"Inf. Sci."},{"key":"20_CR23","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.eswa.2018.02.018","volume":"102","author":"M Allaoui","year":"2018","unstructured":"Allaoui, M., Ahiod, B., El Yafrani, M.: A hybrid crow search algorithm for solving the DNA fragment assembly problem. Expert Syst. Appl. 102, 44\u201356 (2018)","journal-title":"Expert Syst. Appl."},{"key":"20_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106256","volume":"92","author":"Z Halim","year":"2020","unstructured":"Halim, Z.: Optimizing the DNA fragment assembly using metaheuristic-based overlap layout consensus approach. Appl. Soft Comput. 92, 106256 (2020)","journal-title":"Appl. Soft Comput."},{"key":"20_CR25","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1109\/TCBB.2020.3011582","volume":"19","author":"B Cao","year":"2020","unstructured":"Cao, B., Ii, X., Zhang, X., Wang, B., Zhang, Q., Wei, X.: Designing uncorrelated address constrain for DNA storage by DMVO algorithm. IEEE\/ACM Trans. Comput. Biol. Bioinf. 19, 866\u2013877 (2020)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"20_CR26","doi-asserted-by":"crossref","unstructured":"Li, X., et al.: Predicting mutation-disease associations through protein interactions via deep learning. IEEE J. Biomed. Health Inform. (2025)","DOI":"10.1101\/2024.08.06.606730"},{"key":"20_CR27","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.future.2020.03.055","volume":"111","author":"S Li","year":"2020","unstructured":"Li, S., Chen, H., Wang, M., Heidari, A.A., Mirjalili, S.: Slime mould algorithm: a new method for stochastic optimization. Futur. Gener. Comput. Syst. 111, 300\u2013323 (2020)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"20_CR28","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF00993377","volume":"21","author":"RJ Parsons","year":"1995","unstructured":"Parsons, R.J., Forrest, S., Burks, C.: Genetic algorithms, operators, and DNA fragment assembly. Mach. Learn. 21, 11\u201333 (1995)","journal-title":"Mach. Learn."},{"key":"20_CR29","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1504\/IJBIC.2013.058912","volume":"5","author":"GM Mall\u00e9n-Fullerton","year":"2013","unstructured":"Mall\u00e9n-Fullerton, G.M., Hughes, J.A., Houghten, S., Fern\u00e1ndez-Anaya, G.: Benchmark datasets for the DNA fragment assembly problem. Int. J. Bio-Inspired Comput. 5, 384\u2013394 (2013)","journal-title":"Int. J. Bio-Inspired Comput."}],"container-title":["Lecture Notes in Computer Science","Data Science: Foundations and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-8298-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T10:48:13Z","timestamp":1750070893000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-8298-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819682973","9789819682980"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-8298-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"15 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sydney, NSW","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pakdd2025.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}