{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T14:43:50Z","timestamp":1773931430908,"version":"3.50.1"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"14","license":[{"start":{"date-parts":[[2018,4,17]],"date-time":"2018-04-17T00:00:00Z","timestamp":1523923200000},"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":["Soft Comput"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s00500-018-3200-3","type":"journal-article","created":{"date-parts":[[2018,4,17]],"date-time":"2018-04-17T11:50:21Z","timestamp":1523965821000},"page":"5485-5509","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Chemical reaction optimization for solving longest common subsequence problem for multiple string"],"prefix":"10.1007","volume":"23","author":[{"given":"Md. Rafiqul","family":"Islam","sequence":"first","affiliation":[]},{"given":"C. M. Khaled","family":"Saifullah","sequence":"additional","affiliation":[]},{"given":"Zarrin Tasnim","family":"Asha","sequence":"additional","affiliation":[]},{"given":"Rezoana","family":"Ahamed","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,17]]},"reference":[{"key":"3200_CR1","volume-title":"Data structures and algorithms","author":"AV Aho","year":"1983","unstructured":"Aho AV, Hopcroft JE, Ullman JD (1983) Data structures and algorithms. Addison Wesley Publishing Company, INc., Boston"},{"key":"3200_CR2","unstructured":"Aine S, Chakrabarti P, Kumar R (2007) Awa-a window constrained anytime heuristic search algorithm. In: IJCAI, pp 2250-2255"},{"key":"3200_CR3","unstructured":"Banerjee A, Ghosh J (2001) Clickstream clustering using weighted longest common subsequences. In: Proceedings of the web mining workshop at the 1st SIAM conference on data mining, vol. 143, p 144"},{"key":"3200_CR4","doi-asserted-by":"crossref","unstructured":"Bepery C, Abdullah-Al-Mamun S, Rahman MS (2015) Computing a longest common subsequence for multiple sequences. In: 2015 2nd international conference on electrical information and communication technology (EICT). IEEE, pp 118-129","DOI":"10.1109\/EICT.2015.7391933"},{"key":"3200_CR5","doi-asserted-by":"crossref","unstructured":"Blum C (2010) Beam-ACO for the longest common subsequence problem. In: 2010 IEEE congress on evolutionary computation (CEC). IEEE, pp. 1-8","DOI":"10.1109\/CEC.2010.5585928"},{"key":"3200_CR6","doi-asserted-by":"crossref","unstructured":"Blum C, Blesa M (2007) Probabilistic beam search for the longest common subsequence problem. Engineering stochastic local search algorithms. Designing, implementing and analyzing effective heuristics, pp 150\u2013161","DOI":"10.1007\/978-3-540-74446-7_11"},{"key":"3200_CR7","doi-asserted-by":"crossref","unstructured":"Blum C, Blesa MJ (2017) A hybrid evolutionary algorithm based on solution merging for the longest arc-preserving common subsequence problem. arXiv preprint arXiv:1702.00318","DOI":"10.1109\/CEC.2017.7969305"},{"key":"3200_CR8","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.asoc.2017.10.005","volume":"62","author":"C Blum","year":"2018","unstructured":"Blum C, Blesa MJ (2018) Hybrid techniques based on solving reduced problem instances for a longest common subsequence problem. Appl Soft Comput 62:15\u201328","journal-title":"Appl Soft Comput"},{"key":"3200_CR9","doi-asserted-by":"publisher","first-page":"3178","DOI":"10.1016\/j.cor.2009.02.005","volume":"36","author":"C Blum","year":"2009","unstructured":"Blum C, Blesa M, Lopez M (2009) Beam search for the longest common subsequence problem. Comput Oper Res 36:3178\u20133186","journal-title":"Comput Oper Res"},{"key":"3200_CR10","unstructured":"Blum C, Blesa MJ, Calvo B (2013) Beam-ACO for the repetition-free longest common subsequence problem. In: International conference on artificial evolution (Evolution Artificielle). Springer, pp 79\u201390"},{"issue":"1","key":"3200_CR11","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0166-218X(00)00300-0","volume":"110","author":"P Bonizzoni","year":"2001","unstructured":"Bonizzoni P, Della Vedova G, Mauri G (2001) Experimenting an approximation algorithm for the LCS. Discrete Appl Math 110(1):13\u201324","journal-title":"Discrete Appl Math"},{"key":"3200_CR12","doi-asserted-by":"crossref","unstructured":"Brisk P, Kaplan A, Sarrafzadeh M (2004) Area-efficient instruction set synthesis for reconfigurable system-on-chip designs. In: Proceedings of the 41st annual design automation conference. ACM, pp 395\u2013400","DOI":"10.1145\/996566.996679"},{"issue":"4","key":"3200_CR13","doi-asserted-by":"publisher","first-page":"S4","DOI":"10.1186\/1471-2105-7-S4-S4","volume":"7","author":"Y Chen","year":"2006","unstructured":"Chen Y, Wan A, Liu W (2006) A fast parallel algorithm for finding the longest common sequence of multiple biosequences. BMC Bioinform 7(4):S4","journal-title":"BMC Bioinform"},{"issue":"4\u20135","key":"3200_CR14","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF01185429","volume":"12","author":"F Chin","year":"1994","unstructured":"Chin F, Poon CK (1994) Performance analysis of some simple heuristics for computing longest common subsequences. Algorithmica 12(4\u20135):293\u2013311","journal-title":"Algorithmica"},{"issue":"2","key":"3200_CR15","first-page":"98","volume":"4","author":"T Easton","year":"2007","unstructured":"Easton T, Singireddy A (2007) A specialized branching and fathoming technique for the longest common subsequence problem. Int J Oper Res 4(2):98\u2013104","journal-title":"Int J Oper Res"},{"issue":"3","key":"3200_CR16","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s10732-007-9038-y","volume":"14","author":"T Easton","year":"2008","unstructured":"Easton T, Singireddy A (2008) A large neighborhood search heuristic for the longest common subsequence problem. J Heuristics 14(3):271\u2013283","journal-title":"J Heuristics"},{"issue":"3","key":"3200_CR17","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1145\/146637.146656","volume":"39","author":"D Eppstein","year":"1992","unstructured":"Eppstein D, Galil Z, Giancarlo R, Italiano GF (1992) Sparse dynamic programming ii: convex and concave cost functions. J ACM (JACM) 39(3):546\u2013567","journal-title":"J ACM (JACM)"},{"issue":"03","key":"3200_CR18","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1142\/S0219720004000685","volume":"2","author":"A Gu\u00e9noche","year":"2004","unstructured":"Gu\u00e9noche A (2004) Supersequences of masks for oligo-chips. J Bioinform Comput Biol 2(03):459\u2013469","journal-title":"J Bioinform Comput Biol"},{"issue":"7","key":"3200_CR19","first-page":"897","volume":"14","author":"A Guenoche","year":"1995","unstructured":"Guenoche A, Vitte P (1995) Longest common subsequence to multiple strings. Exact and approximate algorithms. TSI-Technique et Science Informatiques-RAIRO 14(7):897\u2013916","journal-title":"TSI-Technique et Science Informatiques-RAIRO"},{"key":"3200_CR20","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/3-540-56279-6_99","volume":"650","author":"K Hakata","year":"1992","unstructured":"Hakata K, Imai H (1992) The longest common subsequence problem for small alphabet size between many strings. Algorithms Comput 650:469\u2013478","journal-title":"Algorithms Comput"},{"issue":"6","key":"3200_CR21","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/360825.360861","volume":"18","author":"DS Hirschberg","year":"1975","unstructured":"Hirschberg DS (1975) A linear space algorithm for computing maximal common subsequences. Commun ACM 18(6):341\u2013343","journal-title":"Commun ACM"},{"key":"3200_CR22","unstructured":"Ho Wc (2017) A fast algorithm for the constrained longest common subsequence problem with small alphabet. Proceedings of the 34th workshop on combinatorial mathematics and computation theory, Taichung, Taiwan, May 19\u201320, 2017"},{"issue":"1","key":"3200_CR23","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01934514","volume":"24","author":"W Hsu","year":"1984","unstructured":"Hsu W, Du M (1984) Computing a longest common subsequence for a set of strings. BIT Numer Math 24(1):45\u201359","journal-title":"BIT Numer Math"},{"key":"3200_CR24","unstructured":"Huang K, Yang CB, Tseng KT, et al (2004) Fast algorithms for finding the common subsequence of multiple sequences. In: Proceedings of the international computer symposium. IEEE Press, pp 1006\u20131011"},{"key":"3200_CR25","unstructured":"Irving RW, Fraser CB (1992) Two algorithms for the longest common subsequence of three (or more) strings. In: Annual symposium on combinatorial pattern matching. Springer, pp 214\u2013229"},{"key":"3200_CR26","unstructured":"Islam MR, Asha ZT, Ahmed R (2015) Longest common subsequence using chemical reaction optimization. In: 2015 2nd international conference on electrical information and communication technology (EICT). IEEE, pp 29\u201333"},{"key":"3200_CR27","unstructured":"James J, Lam AY, Li VO (2011) Evolutionary artificial neural network based on chemical reaction optimization. In: 2011 IEEE congress on evolutionary computation (CEC). IEEE, pp 2083\u20132090"},{"key":"3200_CR28","doi-asserted-by":"crossref","unstructured":"Jansen T, Weyland D (2007) Analysis of evolutionary algorithms for the longest common subsequence problem. In: Proceedings of the 9th annual conference on genetic and evolutionary computation. ACM, pp 939\u2013946","DOI":"10.1145\/1276958.1277148"},{"issue":"5","key":"3200_CR29","doi-asserted-by":"publisher","first-page":"1122","DOI":"10.1137\/S009753979223842X","volume":"24","author":"T Jiang","year":"1995","unstructured":"Jiang T, Li M (1995) On the approximation of shortest common supersequences and longest common subsequences. SIAM J Comput 24(5):1122\u20131139","journal-title":"SIAM J Comput"},{"key":"3200_CR30","unstructured":"Johtela T, Smed J, Hakonen H, Raita T (1996) An efficient heuristic for the LCS problem. In: Third South American workshop on string processing, WSP 96:126\u2013140"},{"key":"3200_CR31","doi-asserted-by":"crossref","unstructured":"Korkin D, Wang Q, Shang Y (2008) An efficient parallel algorithm for the multiple longest common subsequence (MLCS) problem. In: 37th international conference on parallel processing, 2008, ICPP\u201908. IEEE, pp 354\u2013363","DOI":"10.1109\/ICPP.2008.79"},{"issue":"1","key":"3200_CR32","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s12293-012-0075-1","volume":"4","author":"AY Lam","year":"2012","unstructured":"Lam AY, Li VO (2012) Chemical reaction optimization: a tutorial. Memet Comput 4(1):3\u201317","journal-title":"Memet Comput"},{"key":"3200_CR33","unstructured":"Likhachev M, Gordon GJ, Thrun S (2004) Ara*: Anytime a* with provable bounds on sub-optimality. In: Advances in neural information processing systems, pp 767\u2013774"},{"issue":"14","key":"3200_CR34","doi-asserted-by":"publisher","first-page":"1613","DOI":"10.1016\/j.artint.2007.11.009","volume":"172","author":"M Likhachev","year":"2008","unstructured":"Likhachev M, Ferguson D, Gordon G, Stentz A, Thrun S (2008) Anytime search in dynamic graphs. Artif Intell 172(14):1613\u20131643","journal-title":"Artif Intell"},{"key":"3200_CR35","doi-asserted-by":"crossref","unstructured":"Li Y, Li H, Duan T, Wang S, Wang Z, Cheng Y (2016) A real linear and parallel multiple longest common subsequences (MLCS) algorithm. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 1725\u20131734","DOI":"10.1145\/2939672.2939842"},{"key":"3200_CR36","unstructured":"L\u00f3pez-Ib\u00e1nez M, Dubois-Lacoste J, St\u00fctzle T, Birattari M (2011) The irace package: iterated racing for automatic algorithm configuration. IRIDIA, Universite Libre de Bruxelles, Brussels, Belgium, Technical Report TR\/IRIDIA\/2011-004"},{"issue":"2","key":"3200_CR37","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/322063.322075","volume":"25","author":"D Maier","year":"1978","unstructured":"Maier D (1978) The complexity of some problems on subsequences and supersequences. J ACM (JACM) 25(2):322\u2013336","journal-title":"J ACM (JACM)"},{"key":"3200_CR38","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1016\/j.cor.2011.02.026","volume":"39","author":"SR Mousavi","year":"2012","unstructured":"Mousavi SR, Tabataba FS (2012) An improved algorithm for the longest common subsequence problem. Comput Oper Res 39:512\u2013520","journal-title":"Comput Oper Res"},{"issue":"3","key":"3200_CR39","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.compbiolchem.2010.05.001","volume":"34","author":"K Ning","year":"2010","unstructured":"Ning K (2010) Deposition and extension approach to find longest common subsequence for thousands of long sequences. Comput Biol Chem 34(3):149\u2013157","journal-title":"Comput Biol Chem"},{"key":"3200_CR40","doi-asserted-by":"publisher","first-page":"104","DOI":"10.3389\/fgene.2017.00104","volume":"8","author":"Z Peng","year":"2017","unstructured":"Peng Z, Wang Y (2017) A novel efficient graph model for the multiple longest common subsequences (MLCS) problem. Front Genet 8:104","journal-title":"Front Genet"},{"key":"3200_CR41","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.compbiolchem.2016.05.004","volume":"64","author":"CK Saifullah","year":"2016","unstructured":"Saifullah CK, Islam MR (2016a) Chemical reaction optimization for solving shortest common supersequence problem. Comput Biol Chem 64:82\u201393","journal-title":"Comput Biol Chem"},{"key":"3200_CR42","doi-asserted-by":"crossref","unstructured":"Saifullah CK, Islam MR (2016b) Solving shortest common supersequence problem using chemical reaction optimization. In: 2016 5th International conference on informatics, electronics and vision (ICIEV). IEEE, pp 50\u201355","DOI":"10.1109\/ICIEV.2016.7760187"},{"key":"3200_CR43","unstructured":"Saifullah CK, Islam MR, Mahmud MR (2018) Chemical reaction optimization algorithm for word detection using pictorial structure. In: International conference on emerging technology in data mining and information security (IEMIS) (Accepted. To appear)"},{"key":"3200_CR44","unstructured":"Sankoff D, Kruskal JB, (1983) Time warps, string edits, and macromolecules: the theory and practice of sequence comparison. In: Sankoff D, Kruskal JB (eds) Reading: Addison-Wesley Publication (1983)"},{"issue":"1","key":"3200_CR45","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/42201.42203","volume":"13","author":"TK Sellis","year":"1988","unstructured":"Sellis TK (1988) Multiple-query optimization. ACM Trans Database Syst (TODS) 13(1):23\u201352","journal-title":"ACM Trans Database Syst (TODS)"},{"issue":"1","key":"3200_CR46","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.cor.2007.07.006","volume":"36","author":"SJ Shyu","year":"2009","unstructured":"Shyu SJ, Tsai CY (2009) Finding the longest common subsequence for multiple biological sequences by ant colony optimization. Comput Oper Res 36(1):73\u201391","journal-title":"Comput Oper Res"},{"key":"3200_CR47","unstructured":"Singireddy A (2003) Solving the longest common subsequence problem in bioinformatics. Master, Kansas State University 1(1):1\u201310"},{"key":"3200_CR48","volume-title":"Introduction to genetic algorithms","author":"S Sivanandam","year":"2007","unstructured":"Sivanandam S, Deepa S (2007) Introduction to genetic algorithms. Springer, Berlin"},{"key":"3200_CR49","volume-title":"Data compression","author":"J Storer","year":"1988","unstructured":"Storer J (1988) Data compression. Elsevier, Amsterdam"},{"key":"3200_CR50","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.compbiolchem.2011.12.004","volume":"36","author":"FS Tabataba","year":"2012","unstructured":"Tabataba FS, Mousavi SR (2012) A hyper-heuristic for the longest common subsequence problem. Comput Biol Chem 36:42\u201354","journal-title":"Comput Biol Chem"},{"issue":"4","key":"3200_CR51","doi-asserted-by":"publisher","first-page":"1774","DOI":"10.1016\/j.asoc.2012.11.048","volume":"13","author":"TK Truong","year":"2013","unstructured":"Truong TK, Li K, Xu Y (2013) Chemical reaction optimization with greedy strategy for the 0\u20131 knapsack problem. Appl Soft Comput 13(4):1774\u20131780","journal-title":"Appl Soft Comput"},{"key":"3200_CR52","unstructured":"Tsai Y, Hsu J (2002) An approximation algorithm for multiple longest common subsequence problems. In: Proceeding of the 6th world multiconference on systemics, cybernetics and informatics, SCI, pp 456\u2013460"},{"key":"3200_CR53","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.tcs.2017.10.027","volume":"708","author":"KT Tseng","year":"2018","unstructured":"Tseng KT, Chan DS, Yang CB, Lo SF (2018) Efficient merged longest common subsequence algorithms for similar sequences. Theor Comput Sci 708:75\u201390","journal-title":"Theor Comput Sci"},{"issue":"3","key":"3200_CR54","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1109\/TSMCB.2010.2089619","volume":"41","author":"SG Vadlamudi","year":"2011","unstructured":"Vadlamudi SG, Aine S, Chakrabarti PP (2011) A memory-bounded anytime heuristic-search algorithm. IEEE Trans Syst Man Cybern Part B (Cybern) 41(3):725\u2013735","journal-title":"IEEE Trans Syst Man Cybern Part B (Cybern)"},{"key":"3200_CR55","doi-asserted-by":"crossref","unstructured":"Van Den Berg J, Shah R, Huang A, Goldberg K (2011) Ana: anytime nonparametric a. In: Proceedings of twenty-fifth AAAI conference on artificial intelligence (AAAI-11)","DOI":"10.1609\/aaai.v25i1.7819"},{"key":"3200_CR56","unstructured":"Wang Q, Korkin D, Shang Y (2009) Efficient dominant point algorithms for the multiple longest common subsequence (mlcs) problem. In: IJCAI, pp 1494\u20131500"},{"key":"3200_CR57","doi-asserted-by":"crossref","unstructured":"Wang Q, Pan M, Shang Y, Korkin D (2010) A fast heuristic search algorithm for finding the longest common subsequence of multiple strings. In: AAAI","DOI":"10.1609\/aaai.v24i1.7493"},{"issue":"3","key":"3200_CR58","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1109\/TKDE.2010.123","volume":"23","author":"Q Wang","year":"2011","unstructured":"Wang Q, Korkin D, Shang Y (2011) A fast multiple longest common subsequence (MLCS) algorithm. IEEE Trans Knowl Data Eng 23(3):321\u2013334","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"3200_CR59","doi-asserted-by":"crossref","unstructured":"Wang X, Wu Y, Zhu D (2016) A polynomial time algorithm for a generalized longest common subsequence problem. In: Green, pervasive, and cloud computing. Springer, pp 18\u201329","DOI":"10.1007\/978-3-319-39077-2_2"},{"key":"3200_CR60","unstructured":"Xu J, Lam AY, Li VO (2010) Parallel chemical reaction optimization for the quadratic assignment problem. In: World congress in computer science, computer engineering, and applied computing, Worldcomp 2010"},{"issue":"10","key":"3200_CR61","doi-asserted-by":"publisher","first-page":"1624","DOI":"10.1109\/TPDS.2011.35","volume":"22","author":"J Xu","year":"2011","unstructured":"Xu J, Lam AY, Li VO (2011) Chemical reaction optimization for task scheduling in grid computing. IEEE Trans Parallel Distrib Syst 22(10):1624\u20131631","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"11","key":"3200_CR62","doi-asserted-by":"publisher","first-page":"2599","DOI":"10.1109\/TKDE.2014.2304464","volume":"26","author":"J Yang","year":"2014","unstructured":"Yang J, Xu Y, Shang Y, Chen G (2014) A space-bounded anytime algorithm for the multiple longest common subsequence problem. IEEE Tans Knowl Data Eng 26(11):2599\u20132609","journal-title":"IEEE Tans Knowl Data Eng"},{"key":"3200_CR63","unstructured":"Yao X (1991) Optimization by genetic annealing. In: Proceedings of the second australian conference on neural networks, pp 94\u201397"},{"key":"3200_CR64","doi-asserted-by":"crossref","unstructured":"Zhu D, Wang X (2016) A fast algorithm for solving a generalized longest common subsequence problem. ICSIC 2016 Committees Executive Committee , p 1","DOI":"10.1007\/978-3-319-39077-2_2"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3200-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-018-3200-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3200-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T04:43:06Z","timestamp":1693629786000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-018-3200-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,17]]},"references-count":64,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["3200"],"URL":"https:\/\/doi.org\/10.1007\/s00500-018-3200-3","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,17]]},"assertion":[{"value":"17 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"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"}}]}}