{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T05:36:17Z","timestamp":1740202577796,"version":"3.37.3"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,11,29]],"date-time":"2024-11-29T00:00:00Z","timestamp":1732838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,29]],"date-time":"2024-11-29T00:00:00Z","timestamp":1732838400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Postdoctoral Scholarship Programme of Vingroup Innovation Foundation","award":["VINIF.2022.STS.37"],"award-info":[{"award-number":["VINIF.2022.STS.37"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s12065-024-00999-4","type":"journal-article","created":{"date-parts":[[2024,11,29]],"date-time":"2024-11-29T09:15:45Z","timestamp":1732871745000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Evolutionary multitasking algorithm based on a dynamic solution encoding strategy for the minimum s-club cover problem"],"prefix":"10.1007","volume":"18","author":[{"given":"Pham Dinh","family":"Thanh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nguyen Binh","family":"Long","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Le Sy","family":"Vinh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huynh Thi Thanh","family":"Binh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,29]]},"reference":[{"key":"999_CR1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10732-006-3750-x","volume":"12","author":"A Singh","year":"2006","unstructured":"Singh A, Gupta AK (2006) A hybrid heuristic for the maximum clique problem. J Heuristics 12:5\u201322","journal-title":"J Heuristics"},{"key":"999_CR2","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"DS Johnson","year":"1979","unstructured":"Johnson DS, Garey MR (1979) Computers and intractability: a guide to the theory of NP-completeness. WH Freeman"},{"key":"999_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0898-1221(91)90001-K","volume":"22","author":"J Bhasker","year":"1991","unstructured":"Bhasker J, Samad T (1991) The clique-partitioning problem. Comput Math Appl 22:1\u201311","journal-title":"Comput Math Appl"},{"key":"999_CR4","volume-title":"Reducibility among combinatorial problems","author":"RM Karp","year":"2010","unstructured":"Karp RM (2010) Reducibility among combinatorial problems. Springer"},{"key":"999_CR5","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.ejor.2023.01.044","volume":"309","author":"R Jovanovic","year":"2023","unstructured":"Jovanovic R, Sanfilippo AP, Vo\u00df S (2023) Fixed set search applied to the clique partitioning problem. Eur J Oper Res 309:65\u201381","journal-title":"Eur J Oper Res"},{"key":"999_CR6","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1287\/trsc.1070.0211","volume":"42","author":"U Dorndorf","year":"2008","unstructured":"Dorndorf U, Jaehn F, Pesch E (2008) Modelling robust flight-gate scheduling as a clique partitioning problem. Transp Sci 42:292\u2013301","journal-title":"Transp Sci"},{"key":"999_CR7","first-page":"149","volume-title":"Distance-based clique relaxations in networks: s-clique and s-club","author":"S Shahinpour","year":"2013","unstructured":"Shahinpour S, Butenko S (2013) Distance-based clique relaxations in networks: s-clique and s-club. Springer, pp 149\u2013174"},{"key":"999_CR8","unstructured":"Sch\u00e4fer A (2009) Exact algorithms for s-club finding and related problems. Ph.D. thesis, Friedrich-Schiller-University, Jena"},{"key":"999_CR9","doi-asserted-by":"crossref","first-page":"1662","DOI":"10.1137\/090767285","volume":"24","author":"J Guo","year":"2010","unstructured":"Guo J, Komusiewicz C, Niedermeier R, Uhlmann J (2010) A more relaxed model for graph-based data clustering: s-plex cluster editing. SIAM J Discrete Math 24:1662\u20131683","journal-title":"SIAM J Discrete Math"},{"key":"999_CR10","doi-asserted-by":"crossref","first-page":"21","DOI":"10.3390\/a9010021","volume":"9","author":"C Komusiewicz","year":"2016","unstructured":"Komusiewicz C (2016) Multivariate algorithmics for finding cohesive subnetworks. Algorithms 9:21","journal-title":"Algorithms"},{"key":"999_CR11","first-page":"153","volume-title":"Detection of protein complexes in protein interaction networks using n-clubs","author":"S Pasupuleti","year":"2008","unstructured":"Pasupuleti S (2008) Detection of protein complexes in protein interaction networks using n-clubs. Springer, pp 153\u2013164"},{"key":"999_CR12","first-page":"711","volume-title":"Dense subgraphs in biological networks","author":"MM Hosseinzadeh","year":"2020","unstructured":"Hosseinzadeh MM (2020) Dense subgraphs in biological networks. Springer, pp 711\u2013719"},{"key":"999_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s13278-016-0345-x","volume":"6","author":"RJ Mokken","year":"2016","unstructured":"Mokken RJ, Heemskerk EM, Laan S (2016) Close communication and 2-clubs in corporate networks: Europe 2010. Soc Netw Anal Min 6:1\u201319","journal-title":"Soc Netw Anal Min"},{"key":"999_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s13278-016-0326-0","volume":"6","author":"S Laan","year":"2016","unstructured":"Laan S, Marx M, Mokken RJ (2016) Close communities in social networks: boroughs and 2-clubs. Soc Netw Anal Min 6:1\u201316","journal-title":"Soc Netw Anal Min"},{"key":"999_CR15","doi-asserted-by":"crossref","first-page":"64","DOI":"10.7155\/jgaa.00491","volume":"23","author":"R Dondi","year":"2019","unstructured":"Dondi R, Mauri G, Sikora F, Italo Z (2019) Covering a graph with clubs. J Graph Algorithms Appl 23:64","journal-title":"J Graph Algorithms Appl"},{"key":"999_CR16","doi-asserted-by":"crossref","DOI":"10.1201\/9781482268713","volume-title":"Evolutionary computation 1: basic algorithms and operators","author":"T B\u00e4ck","year":"2018","unstructured":"B\u00e4ck T, Fogel DB, Michalewicz Z (2018) Evolutionary computation 1: basic algorithms and operators. CRC Press"},{"key":"999_CR17","first-page":"1","volume":"6","author":"JC Bansal","year":"2019","unstructured":"Bansal JC, Pal NR (2019) Swarm and evolutionary computation. Evolut Swarm Intell Algorithms 6:1\u20139","journal-title":"Evolut Swarm Intell Algorithms"},{"key":"999_CR18","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s12559-016-9395-7","volume":"8","author":"Y-S Ong","year":"2016","unstructured":"Ong Y-S, Gupta A (2016) Evolutionary multitasking: a computer science view of cognitive multitasking. Cogn Comput 8:125\u2013142","journal-title":"Cogn Comput"},{"key":"999_CR19","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1109\/TEVC.2015.2458037","volume":"20","author":"A Gupta","year":"2015","unstructured":"Gupta A, Ong Y-S, Feng L (2015) Multifactorial evolution: toward evolutionary multitasking. IEEE Trans Evol Comput 20:343\u2013357","journal-title":"IEEE Trans Evol Comput"},{"key":"999_CR20","doi-asserted-by":"crossref","unstructured":"Song H, Qin AK, Tsai PW, Liang JJ (2019) Multitasking multi-swarm optimization. IEEE, pp 1937\u20131944","DOI":"10.1109\/CEC.2019.8790009"},{"key":"999_CR21","doi-asserted-by":"crossref","unstructured":"Skiena SS, Skiena SS (2020) Np-completeness. Algorithm Design Manual 5:355\u2013388","DOI":"10.1007\/978-3-030-54256-6_11"},{"key":"999_CR22","doi-asserted-by":"crossref","first-page":"2270","DOI":"10.1016\/j.dam.2007.10.015","volume":"156","author":"MR Cerioli","year":"2008","unstructured":"Cerioli MR et al (2008) Partition into cliques for cubic graphs: planar case, complexity and approximation. Discrete Appl Math 156:2270\u20132278","journal-title":"Discrete Appl Math"},{"key":"999_CR23","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/s00373-011-1026-1","volume":"27","author":"A Dumitrescu","year":"2011","unstructured":"Dumitrescu A, Pach J (2011) Minimum clique partition in unit disk graphs. Graphs Combin 27:399\u2013411","journal-title":"Graphs Combin"},{"key":"999_CR24","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0377-2217(01)00133-3","volume":"138","author":"J-M Bourjolly","year":"2002","unstructured":"Bourjolly J-M, Laporte G, Pesant G (2002) An exact algorithm for the maximum k-club problem in an undirected graph. Eur J Oper Res 138:21\u201328","journal-title":"Eur J Oper Res"},{"key":"999_CR25","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10878-005-1857-x","volume":"10","author":"B Balasundaram","year":"2005","unstructured":"Balasundaram B, Butenko S, Trukhanov S (2005) Novel approaches for analyzing biological networks. J Comb Optim 10:23\u201339","journal-title":"J Comb Optim"},{"key":"999_CR26","doi-asserted-by":"crossref","first-page":"1834","DOI":"10.1007\/s00453-017-0344-y","volume":"80","author":"Y Asahiro","year":"2018","unstructured":"Asahiro Y, Doi Y, Miyano E, Samizo K, Shimizu H (2018) Optimal approximation algorithms for maximum distance-bounded subgraph problems. Algorithmica 80:1834\u20131856","journal-title":"Algorithmica"},{"key":"999_CR27","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1109\/MCI.2022.3155332","volume":"17","author":"A Gupta","year":"2022","unstructured":"Gupta A, Zhou L, Ong Y-S, Chen Z, Hou Y (2022) Half a dozen real-world applications of evolutionary multitasking, and more. IEEE Comput Intell Mag 17:49\u201366","journal-title":"IEEE Comput Intell Mag"},{"key":"999_CR28","doi-asserted-by":"crossref","first-page":"3143","DOI":"10.1109\/TCYB.2019.2962865","volume":"51","author":"L Feng","year":"2020","unstructured":"Feng L et al (2020) Explicit evolutionary multitasking for combinatorial optimization: a case study on capacitated vehicle routing problem. IEEE Trans Cybern 51:3143\u20133156","journal-title":"IEEE Trans Cybern"},{"key":"999_CR29","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2021.107253","volume":"105","author":"TB Thang","year":"2021","unstructured":"Thang TB, Long NB, Hoang NV, Binh HTT (2021) Adaptive knowledge transfer in multifactorial evolutionary algorithm for the clustered minimum routing cost problem. Appl Soft Comput 105:107253","journal-title":"Appl Soft Comput"},{"key":"999_CR30","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1109\/TEVC.2019.2904696","volume":"24","author":"X Zheng","year":"2019","unstructured":"Zheng X, Qin AK, Gong M, Zhou D (2019) Self-regulated evolutionary multitask optimization. IEEE Trans Evol Comput 24:16\u201328","journal-title":"IEEE Trans Evol Comput"},{"key":"999_CR31","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1109\/TETCI.2019.2916051","volume":"4","author":"Y Chen","year":"2019","unstructured":"Chen Y, Zhong J, Feng L, Zhang J (2019) An adaptive archive-based evolutionary framework for many-task optimization. IEEE Trans Emerg Top Comput Intell 4:369\u2013384","journal-title":"IEEE Trans Emerg Top Comput Intell"},{"key":"999_CR32","doi-asserted-by":"crossref","unstructured":"Liaw R-T, Ting C-K (2019) Evolutionary manytasking optimization based on symbiosis in biocoenosis 33:4295\u20134303","DOI":"10.1609\/aaai.v33i01.33014295"},{"key":"999_CR33","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/TEVC.2020.2991717","volume":"25","author":"X Hao","year":"2020","unstructured":"Hao X, Qu R, Liu J (2020) A unified framework of graph-based evolutionary multitasking hyper-heuristic. IEEE Trans Evol Comput 25:35\u201347","journal-title":"IEEE Trans Evol Comput"},{"key":"999_CR34","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s12065-020-00501-w","volume":"15","author":"B Huynh Thi Thanh","year":"2022","unstructured":"Huynh Thi Thanh B, Pham Dinh T (2022) Two levels approach based on multifactorial optimization to solve the clustered shortest path tree problem. Evol Intel 15:185\u2013213","journal-title":"Evol Intel"},{"key":"999_CR35","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s12293-020-00309-2","volume":"12","author":"TP Dinh","year":"2020","unstructured":"Dinh TP, Thanh BHT, Ba TT, Binh LN (2020) Multifactorial evolutionary algorithm for solving clustered tree problems: competition among cayley codes: case studies on the clustered shortest-path tree problem and the minimum inter-cluster routing cost clustered tree problem. Memetic Compu 12:185\u2013217","journal-title":"Memetic Compu"},{"key":"999_CR36","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1002\/net.21800","volume":"71","author":"L Maggi","year":"2018","unstructured":"Maggi L, Leguay J, Cohen J, Medagliani P (2018) Domain clustering for inter-domain path computation speed-up. Networks 71:252\u2013270","journal-title":"Networks"},{"key":"999_CR37","doi-asserted-by":"crossref","unstructured":"Binh HTT, Thangy TB, Long NB, Hoang NV, Thanh PD (2020) Multifactorial evolutionary algorithm for inter-domain path computation under domain uniqueness constraint. IEEE, pp 1\u20138","DOI":"10.1109\/CEC48606.2020.9185701"},{"key":"999_CR38","doi-asserted-by":"crossref","first-page":"523","DOI":"10.7155\/jgaa.00491","volume":"23","author":"R Dondi","year":"2019","unstructured":"Dondi R, Mauri G, Sikora F, Italo Z (2019) Covering a graph with clubs. J Graph Algorithms Appl 23:523","journal-title":"J Graph Algorithms Appl"},{"key":"999_CR39","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.engappai.2004.08.024","volume":"18","author":"EC Brown","year":"2005","unstructured":"Brown EC, Sumichrast RT (2005) Evaluating performance advantages of grouping genetic algorithms. Eng Appl Artif Intell 18:1\u201312","journal-title":"Eng Appl Artif Intell"},{"key":"999_CR40","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1142\/S0219622007002447","volume":"6","author":"EC Brown","year":"2007","unstructured":"Brown EC, Ragsdale CT, Carter AE (2007) A grouping genetic algorithm for the multiple traveling salesperson problem. Int J Inf Technol Decis Making 6:333\u2013347","journal-title":"Int J Inf Technol Decis Making"},{"key":"999_CR41","doi-asserted-by":"crossref","first-page":"7234","DOI":"10.1016\/j.eswa.2008.09.020","volume":"36","author":"LE Agust\u00edn-Blas","year":"2009","unstructured":"Agust\u00edn-Blas LE, Salcedo-Sanz S, Ortiz-Garc\u00eda EG, Portilla-Figueras A, P\u00e9rez-Bellido \u00c1M (2009) A hybrid grouping genetic algorithm for assigning students to preferred laboratory groups. Expert Syst Appl 36:7234\u20137241","journal-title":"Expert Syst Appl"},{"key":"999_CR42","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s00500-008-0312-1","volume":"13","author":"A Singh","year":"2009","unstructured":"Singh A, Baghel AS (2009) A new grouping genetic algorithm approach to the multiple traveling salesperson problem. Soft Comput 13:95\u2013101","journal-title":"Soft Comput"},{"key":"999_CR43","first-page":"95","volume":"6","author":"RJ Moraga","year":"2016","unstructured":"Moraga RJ (2016) Metaheuristic for randomized priority search (meta-raps): a tutorial. Heuristics Metaheuristics Approx Methods Plan Schedul 6:95\u2013108","journal-title":"Heuristics Metaheuristics Approx Methods Plan Schedul"},{"key":"999_CR44","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1002\/9780470411353.ch21","volume":"8","author":"J Gallardo","year":"2009","unstructured":"Gallardo J, Cotta C, Fernandez A (2009) Exact, metaheuristic, and hybrid approaches to multidimensional knapsack problems. Optim Tech Solv Complex Problems 8:365\u2013383","journal-title":"Optim Tech Solv Complex Problems"},{"key":"999_CR45","doi-asserted-by":"crossref","unstructured":"Yang X-S (2012) Artificial intelligence, evolutionary computing and metaheuristics. In: The footsteps of Alan Turing, vol 427. Springer","DOI":"10.1007\/978-3-642-29694-9"},{"key":"999_CR46","doi-asserted-by":"crossref","first-page":"9695","DOI":"10.1016\/j.eswa.2012.02.149","volume":"39","author":"L Agust\u0131","year":"2012","unstructured":"Agust\u0131 L et al (2012) A new grouping genetic algorithm for clustering problems. Expert Syst Appl 39:9695\u20139703","journal-title":"Expert Syst Appl"},{"key":"999_CR47","doi-asserted-by":"crossref","unstructured":"Johnson DS, Trick MA (1996) Cliques, coloring, and satisfiability: second DIMACS implementation challenge, October 11\u201313, 1993, vol\u00a026. American Mathematical Society","DOI":"10.1090\/dimacs\/026"},{"key":"999_CR48","unstructured":"Bader DA, Meyerhenke H, Sanders P, Wagner D (2011) 10th dimacs implementation challenge-graph partitioning and graph clustering"},{"key":"999_CR49","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1007\/s00453-022-01062-3","volume":"85","author":"R Dondi","year":"2023","unstructured":"Dondi R, Lafond M (2023) On the tractability of covering a graph with 2-clubs. Algorithmica 85:992\u20131028","journal-title":"Algorithmica"},{"key":"999_CR50","doi-asserted-by":"crossref","first-page":"9391","DOI":"10.1109\/TCYB.2021.3051243","volume":"52","author":"Z Lu","year":"2021","unstructured":"Lu Z, Zhou Y, Hao J-K (2021) A hybrid evolutionary algorithm for the clique partitioning problem. IEEE Trans Cybern 52:9391\u20139403)","journal-title":"IEEE Trans Cybern"},{"key":"999_CR51","doi-asserted-by":"crossref","first-page":"104187","DOI":"10.1016\/j.engappai.2021.104187","volume":"100","author":"HTT Binh","year":"2021","unstructured":"Binh HTT, Thang TB, Thai ND, Thanh PD (2021) A bi-level encoding scheme for the clustered shortest-path tree problem in multifactorial optimization. Eng Appl Artif Intell 100:104187","journal-title":"Eng Appl Artif Intell"},{"key":"999_CR52","doi-asserted-by":"crossref","unstructured":"Wen Y-W, Ting C-K (2017) Parting ways and reallocating resources in evolutionary multitasking. IEEE, pp 2404\u20132411","DOI":"10.1109\/CEC.2017.7969596"},{"key":"999_CR53","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac J, Garcia S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1:3\u201318","journal-title":"Swarm Evol Comput"},{"key":"999_CR54","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.ins.2014.06.009","volume":"289","author":"J Derrac","year":"2014","unstructured":"Derrac J, Garc\u00eda S, Hui S, Suganthan PN, Herrera F (2014) Analyzing convergence performance of evolutionary algorithms: a statistical approach. Inf Sci 289:41\u201358","journal-title":"Inf Sci"},{"key":"999_CR55","doi-asserted-by":"crossref","first-page":"2323","DOI":"10.1007\/s10462-020-09906-6","volume":"54","author":"AH Halim","year":"2021","unstructured":"Halim AH, Ismail I, Das S (2021) Performance assessment of the metaheuristic optimization algorithms: an exhaustive review. Artif Intell Rev 54:2323\u20132409","journal-title":"Artif Intell Rev"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-024-00999-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-024-00999-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-024-00999-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:25:43Z","timestamp":1740158743000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-024-00999-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,29]]},"references-count":55,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["999"],"URL":"https:\/\/doi.org\/10.1007\/s12065-024-00999-4","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"type":"print","value":"1864-5909"},{"type":"electronic","value":"1864-5917"}],"subject":[],"published":{"date-parts":[[2024,11,29]]},"assertion":[{"value":"31 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 October 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 November 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 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 that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Informed consent was obtained from all individual participants included in the study.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}],"article-number":"15"}}