{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:20:44Z","timestamp":1740108044578,"version":"3.37.3"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,3,31]],"date-time":"2021-03-31T00:00:00Z","timestamp":1617148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,31]],"date-time":"2021-03-31T00:00:00Z","timestamp":1617148800000},"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":["Pattern Anal Applic"],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1007\/s10044-021-00971-3","type":"journal-article","created":{"date-parts":[[2021,3,31]],"date-time":"2021-03-31T07:03:08Z","timestamp":1617174188000},"page":"1149-1171","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Customizable HMM-based measures to accurately compare tree sets"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4603-7744","authenticated-orcid":false,"given":"Sylvain","family":"Iloga","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,31]]},"reference":[{"key":"971_CR1","doi-asserted-by":"crossref","unstructured":"Valiente G (2001) An efficient bottom-up distance between trees. In: spire, pages 212\u2013219","DOI":"10.1109\/SPIRE.2001.989761"},{"key":"971_CR2","unstructured":"Bille P (2003) Tree edit distance, alignment distance and inclusion. Technical report, Citeseer"},{"key":"971_CR3","unstructured":"Liu T-L, Geiger D (1999) Approximate tree matching and shape similarity. In: Proceedings of the Seventh IEEE International Conference on Computer Vision, volume\u00a01, pages 456\u2013462. IEEE"},{"issue":"4","key":"971_CR4","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1111\/j.0824-7935.2004.00255.x","volume":"20","author":"VC Bhavsar","year":"2004","unstructured":"Bhavsar VC, Boley H, Yang L (2004) A weighted-tree similarity algorithm for multi-agent systems in e-business environments. Comput Intell 20(4):584\u2013602","journal-title":"Comput Intell"},{"issue":"3","key":"971_CR5","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"K-C Tai","year":"1979","unstructured":"Tai K-C (1979) The tree-to-tree correction problem. J ACM (JACM) 26(3):422\u2013433","journal-title":"J ACM (JACM)"},{"issue":"6","key":"971_CR6","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K Zhang","year":"1989","unstructured":"Zhang K, Shasha D (1989) Simple fast algorithms for the editing distance between trees and related problems. SIAM J Comput 18(6):1245\u20131262","journal-title":"SIAM J Comput"},{"issue":"3","key":"971_CR7","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(92)90136-J","volume":"42","author":"K Zhang","year":"1992","unstructured":"Zhang K, Statman R, Shasha D (1992) On the editing distance between unordered labeled trees. Inf Process Lett 42(3):133\u2013139","journal-title":"Inf Process Lett"},{"issue":"5","key":"971_CR8","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0020-0190(94)90062-0","volume":"49","author":"K Zhang","year":"1994","unstructured":"Zhang K, Jiang T (1994) Some max snp-hard results concerning unordered labeled trees. Inf Process Lett 49(5):249\u2013254","journal-title":"Inf Process Lett"},{"key":"971_CR9","doi-asserted-by":"crossref","unstructured":"Klein PN (1998) Computing the edit-distance between unrooted ordered trees. In: European Symposium on Algorithms, pages 91\u2013102. Springer","DOI":"10.1007\/3-540-68530-8_8"},{"issue":"2","key":"971_CR10","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1006\/jagm.2001.1170","volume":"40","author":"W Chen","year":"2001","unstructured":"Chen W (2001) New algorithm for ordered tree-to-tree correction problem. J Algorithms 40(2):135\u2013158","journal-title":"J Algorithms"},{"issue":"4","key":"971_CR11","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1016\/j.jda.2006.07.002","volume":"5","author":"H Touzet","year":"2007","unstructured":"Touzet H (2007) Comparing similar ordered trees in linear-time. J Discrete Algorithms 5(4):696\u2013705","journal-title":"J Discrete Algorithms"},{"issue":"1","key":"971_CR12","first-page":"2","volume":"6","author":"ED Demaine","year":"2009","unstructured":"Demaine ED, Mozes S, Rossman B, Weimann O (2009) An optimal decomposition algorithm for tree edit distance. ACM Trans Algorithms (TALG) 6(1):2","journal-title":"ACM Trans Algorithms (TALG)"},{"issue":"1","key":"971_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2699485","volume":"40","author":"M Pawlik","year":"2015","unstructured":"Pawlik M, Augsten N (2015) Efficient computation of the tree edit distance. ACM Trans Database Syst (TODS) 40(1):1\u201340","journal-title":"ACM Trans Database Syst (TODS)"},{"key":"971_CR14","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.is.2015.08.004","volume":"56","author":"M Pawlik","year":"2016","unstructured":"Pawlik M, Augsten N (2016) Tree edit distance: robust and memory-efficient. Inf Syst 56:157\u2013173","journal-title":"Inf Syst"},{"key":"971_CR15","doi-asserted-by":"crossref","unstructured":"Schwarz S, Pawlik M, Augsten N (2017) A new perspective on the tree edit distance. In: International Conference on Similarity Search and Applications, pages 156\u2013170. Springer","DOI":"10.1007\/978-3-319-68474-1_11"},{"issue":"3","key":"971_CR16","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1016\/0031-3203(94)00109-Y","volume":"28","author":"K Zhang","year":"1995","unstructured":"Zhang K (1995) Algorithms for the constrained editing distance between ordered labeled trees and related problems. Pattern Recogn 28(3):463\u2013474","journal-title":"Pattern Recogn"},{"issue":"3","key":"971_CR17","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF01975866","volume":"15","author":"K Zhang","year":"1996","unstructured":"Zhang K (1996) A constrained edit distance between unordered labeled trees. Algorithmica 15(3):205\u2013222","journal-title":"Algorithmica"},{"key":"971_CR18","unstructured":"Richter T (1997) A new measure of the distance between ordered trees and its applications. Inst f\u00fcr Informatik"},{"key":"971_CR19","doi-asserted-by":"crossref","unstructured":"Lu CL, Su Z-Y, Tang CY (2001) A new measure of edit distance between labeled trees. In: International Computing and Combinatorics Conference, pages 338\u2013348. Springer","DOI":"10.1007\/3-540-44679-6_37"},{"issue":"1","key":"971_CR20","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.jda.2006.03.010","volume":"5","author":"A Ouangraoua","year":"2007","unstructured":"Ouangraoua A, Ferraro P, Tichit L, Dulucq S (2007) Local similarity between quotiented ordered trees. J Discrete Algorithms 5(1):23\u201335","journal-title":"J Discrete Algorithms"},{"issue":"6","key":"971_CR21","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/0020-0190(77)90064-3","volume":"6","author":"SM Selkow","year":"1977","unstructured":"Selkow SM (1977) The tree-to-tree editing problem. Inf Process Lett 6(6):184\u2013186","journal-title":"Inf Process Lett"},{"key":"971_CR22","first-page":"219","volume":"2","author":"L Shin-Yee","year":"1979","unstructured":"Shin-Yee L (1979) A tree-to-tree distance and its application to cluster analysis. IEEE Trans Pattern Anal Mach Intell 2:219\u2013224","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"02","key":"971_CR23","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1142\/S0218001488000157","volume":"2","author":"E Tanaka","year":"1988","unstructured":"Tanaka E, Tanaka K (1988) The tree-to-tree editing problem. Int J Pattern Recognit Artif Intell 2(02):221\u2013240","journal-title":"Int J Pattern Recognit Artif Intell"},{"issue":"4","key":"971_CR24","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1016\/0196-6774(90)90011-3","volume":"11","author":"D Shasha","year":"1990","unstructured":"Shasha D, Zhang K (1990) Fast algorithms for the unit cost editing distance between trees. J Algorithms 11(4):581\u2013621","journal-title":"J Algorithms"},{"key":"971_CR25","unstructured":"Sridharamurthy R, Talha BM, Adhitya K, Vijay N (2018) Edit distance between merge trees. In: IEEE transactions on visualization and computer graphics, pages 1\u201314"},{"issue":"1","key":"971_CR26","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0304-3975(95)80029-9","volume":"143","author":"T Jiang","year":"1995","unstructured":"Jiang T, Wang L, Zhang K (1995) Alignment of trees\u2013an alternative to tree edit. Theoret Comput Sci 143(1):137\u2013148","journal-title":"Theoret Comput Sci"},{"key":"971_CR27","doi-asserted-by":"crossref","unstructured":"Jansson J, Lingas A (2001) A fast algorithm for optimal alignment between similar ordered trees. In: Annual Symposium on Combinatorial Pattern Matching, pages 232\u2013240. Springer","DOI":"10.1007\/3-540-48194-X_22"},{"key":"971_CR28","unstructured":"Kilpel\u00e4inen P, et\u00a0al (1992) Tree matching problems with applications to structured text databases"},{"key":"971_CR29","doi-asserted-by":"crossref","unstructured":"Alonso L, Schott R (1993) On the tree inclusion problem. In: International Symposium on Mathematical Foundations of Computer Science, pages 211\u2013221. Springer","DOI":"10.1007\/3-540-57182-5_13"},{"issue":"2","key":"971_CR30","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1137\/S0097539791218202","volume":"24","author":"P Kilpel\u00e4inen","year":"1995","unstructured":"Kilpel\u00e4inen P, Mannila H (1995) Ordered and unordered tree inclusion. SIAM J Comput 24(2):340\u2013356","journal-title":"SIAM J Comput"},{"key":"971_CR31","doi-asserted-by":"crossref","unstructured":"Richter T (1997) A new algorithm for the ordered tree inclusion problem. In: Annual Symposium on Combinatorial Pattern Matching, pages 150\u2013166. Springer","DOI":"10.1007\/3-540-63220-4_57"},{"issue":"2","key":"971_CR32","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1006\/jagm.1997.0899","volume":"26","author":"W Chen","year":"1998","unstructured":"Chen W (1998) More efficient algorithm for ordered tree inclusion. J Algorithms 26(2):370\u2013385","journal-title":"J Algorithms"},{"issue":"1","key":"971_CR33","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/322290.322295","volume":"29","author":"CM Hoffmann","year":"1982","unstructured":"Hoffmann CM, O\u2019Donnell MJ (1982) Pattern matching in trees. J ACM 29(1):68\u201395","journal-title":"J ACM"},{"key":"971_CR34","doi-asserted-by":"crossref","unstructured":"Kosaraju SR (1989) Efficient tree pattern matching. In: 30th Annual Symposium on Foundations of Computer Science, pages 178\u2013183. IEEE","DOI":"10.1109\/SFCS.1989.63475"},{"key":"971_CR35","unstructured":"Dubiner M, Galil Z, Magen E (1990) Faster tree pattern matching. In: Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, pages 145\u2013150. IEEE"},{"issue":"2","key":"971_CR36","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1145\/128749.128752","volume":"39","author":"RAMAKRISHNAN Ramesh","year":"1992","unstructured":"Ramesh RAMAKRISHNAN, Ramakrishnan IV (1992) Nonlinear pattern matching in trees. J ACM (JACM) 39(2):295\u2013316","journal-title":"J ACM (JACM)"},{"issue":"1","key":"971_CR37","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1006\/jagm.1994.1003","volume":"16","author":"KZ Zhang","year":"1994","unstructured":"Zhang KZ, Shasha D, Wang JT-L (1994) Approximate tree matching in the presence of variable length don\u2019t cares. J Algorithms 16(1):33\u201366","journal-title":"J Algorithms"},{"issue":"1","key":"971_CR38","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1006\/inco.1995.1155","volume":"123","author":"M Farach","year":"1995","unstructured":"Farach M, Thorup M (1995) Fast comparison of evolutionary trees. Inf Comput 123(1):29\u201337","journal-title":"Inf Comput"},{"issue":"6","key":"971_CR39","doi-asserted-by":"publisher","first-page":"1656","DOI":"10.1137\/S0097539794269461","volume":"26","author":"A Amir","year":"1997","unstructured":"Amir A, Keselman D (1997) Maximum agreement subtree in a set of evolutionary trees: metrics and efficient algorithms. SIAM J Comput 26(6):1656\u20131669","journal-title":"SIAM J Comput"},{"key":"971_CR40","doi-asserted-by":"crossref","unstructured":"Khanna S, Motwani R, Yao FF (1995) Approximation algorithms for the largest common subtree problem. Citeseer","DOI":"10.1017\/CBO9780511814075"},{"issue":"1\u20132","key":"971_CR41","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0304-3975(97)00278-8","volume":"233","author":"T Akutsu","year":"2000","unstructured":"Akutsu T, Halld\u00f3rsson MM (2000) On the approximation of largest common subtrees and largest common point sets. Theor Comput Sci 233(1\u20132):33\u201350","journal-title":"Theor Comput Sci"},{"issue":"2","key":"971_CR42","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/PL00009212","volume":"21","author":"A Gupta","year":"1998","unstructured":"Gupta A, Nishimura N (1998) Finding largest subtrees and smallest supertrees. Algorithmica 21(2):183\u2013210","journal-title":"Algorithmica"},{"issue":"03","key":"971_CR43","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1142\/S0129054100000259","volume":"11","author":"N Nishimura","year":"2000","unstructured":"Nishimura N, Ragde P, Thilikos DM (2000) Finding smallest supertrees under minor containment. Int J Found Comput Sci 11(03):445\u2013465","journal-title":"Int J Found Comput Sci"},{"key":"971_CR44","first-page":"487","volume":"8","author":"P-N Tan","year":"2006","unstructured":"Tan P-N, Steinbach M, Kumar V et al (2006) Cluster analysis: basic concepts and algorithms. Intro Data Min 8:487\u2013568","journal-title":"Intro Data Min"},{"key":"971_CR45","doi-asserted-by":"crossref","unstructured":"Mucherino A, Papajorgji PJ, Pardalos PM (2009) Data Mining in Agriculture, volume\u00a034, chapter k-Nearest Neighbor Classification. Springer, New York","DOI":"10.1007\/978-0-387-88615-2"},{"key":"971_CR46","doi-asserted-by":"crossref","unstructured":"Bondy JA, Uppaluri SRM, et\u00a0al (1976) Graph theory with applications, volume 290. Macmillan London","DOI":"10.1007\/978-1-349-03521-2"},{"key":"971_CR47","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1109\/TSE.1983.234958","volume":"4","author":"T-Y Cheung","year":"1983","unstructured":"Cheung T-Y (1983) Graph traversal techniques and the maximum flow problem in distributed computation. IEEE Trans Software Eng 4:504\u2013512","journal-title":"IEEE Trans Software Eng"},{"issue":"1","key":"971_CR48","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"RA Wagner","year":"1974","unstructured":"Wagner RA, Fischer MJ (1974) The string-to-string correction problem. J ACM (JACM) 21(1):168\u2013173","journal-title":"J ACM (JACM)"},{"issue":"1\u20133","key":"971_CR49","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0012-365X(92)90687-B","volume":"108","author":"J Matou\u0161ek","year":"1992","unstructured":"Matou\u0161ek J, Thomas R (1992) On the complexity of finding iso-and other morphisms for partial k-trees. Discrete Math 108(1\u20133):343\u2013364","journal-title":"Discrete Math"},{"issue":"6","key":"971_CR50","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1109\/TPAMI.2006.125","volume":"28","author":"A Torsello","year":"2006","unstructured":"Torsello A, Hancock ER (2006) Learning shape-classes using a mixture of tree-unions. IEEE Trans Pattern Anal Mach Intell 28(6):954\u2013967","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"971_CR51","doi-asserted-by":"crossref","unstructured":"Torsello A, Rossi L (2011) Supervised learning of graph structure. In: International Workshop on Similarity-Based Pattern Recognition, pages 117\u2013132. Springer","DOI":"10.1007\/978-3-642-24471-1_9"},{"issue":"2","key":"971_CR52","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/5.18626","volume":"77","author":"LR Rabiner","year":"1989","unstructured":"Rabiner LR (1989) A tutorial on hidden markov models and selected applications in speech recognition. Proc IEEE 77(2):257\u2013286","journal-title":"Proc IEEE"},{"key":"971_CR53","doi-asserted-by":"crossref","unstructured":"Iloga S, Romain O, Tchuent\u00e9 M (2020) An efficient generic approach for automatic taxonomy generation using HMMs. Pattern Anal Appl 1\u201322","DOI":"10.1007\/s10044-020-00918-0"},{"key":"971_CR54","doi-asserted-by":"crossref","unstructured":"Falkhausen M, Reininger H, Wolf D (1995) Calculation of distance measures between hidden markov models. In: Fourth European Conference on Speech Communication and Technology","DOI":"10.21437\/Eurospeech.1995-364"},{"issue":"4","key":"971_CR55","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1109\/LSP.2003.809034","volume":"10","author":"MN Do","year":"2003","unstructured":"Do MN (2003) Fast approximation of kullback-leibler distance for dependence trees and hidden markov models. IEEE Signal Process Lett 10(4):115\u2013118","journal-title":"IEEE Signal Process Lett"},{"issue":"9","key":"971_CR56","doi-asserted-by":"publisher","first-page":"4176","DOI":"10.1109\/TSP.2008.924137","volume":"56","author":"J Silva","year":"2008","unstructured":"Silva J, Narayanan S (2008) Upper bound kullback-leibler divergence for transient hidden markov models. IEEE Trans Signal Process 56(9):4176\u20134188","journal-title":"IEEE Trans Signal Process"},{"key":"971_CR57","doi-asserted-by":"crossref","unstructured":"Lyngso RB, Pedersen CN, Nielsen H (1999) Metrics and similarity measures for hidden markov models. In: Proc Int Conf Intell Syst Mol Biol, pages 178\u2013186","DOI":"10.7146\/brics.v6i6.20063"},{"issue":"2","key":"971_CR58","doi-asserted-by":"publisher","first-page":"1550","DOI":"10.1016\/j.eswa.2009.06.063","volume":"37","author":"J Zeng","year":"2010","unstructured":"Zeng J, Duan J, Chengrong W (2010) A new distance measure for hidden markov models. Expert Syst Appl 37(2):1550\u20131555","journal-title":"Expert Syst Appl"},{"key":"971_CR59","doi-asserted-by":"crossref","unstructured":"Iloga S, Romain O, Tchuent\u00e9 M (2018) An accurate hmm-based similarity measure between finite sets of histograms. Pattern Anal Appl 1\u201326","DOI":"10.1007\/s10044-018-0734-z"},{"issue":"2","key":"971_CR60","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1109\/LSP.2010.2096417","volume":"18","author":"SME Sahraeian","year":"2011","unstructured":"Sahraeian SME, Yoon B-J (2011) A novel low-complexity hmm similarity measure. IEEE Signal Process Lett 18(2):87\u201390","journal-title":"IEEE Signal Process Lett"},{"key":"971_CR61","unstructured":"Huang A (2008) Similarity measures for text document clustering. In: Proceedings of the sixth new zealand computer science research student conference (NZCSRSC2008), Christchurch, New Zealand, pages 49\u201356"},{"key":"971_CR62","doi-asserted-by":"crossref","unstructured":"Nothman J, Qin H, Yurchak R (2018) Stop word lists in free open-source software packages. In: Proceedings of Workshop for NLP Open Source Software (NLP-OSS), pages 7\u201312","DOI":"10.18653\/v1\/W18-2502"},{"key":"971_CR63","doi-asserted-by":"crossref","unstructured":"Rico-Juan JR, Mic\u00f3 L (2003) Some results about the use of tree\/string edit distances in a$$^\\sim$$ nearest neighbour classification task. In: Iberian Conference on Pattern Recognition and Image Analysis, pages 821\u2013828. Springer","DOI":"10.1007\/978-3-540-44871-6_95"},{"key":"971_CR64","unstructured":"Noussi JBB, Tchendji MT, Iloga S (2019) Parallel hmm-based similarity between finite sets of histograms. http:\/\/cri-info.cm\/?page_id=148"},{"key":"971_CR65","unstructured":"Espinosa-Manzo ALA, Arias-Estrada MO (2001) Implementing hidden markov models in a hardware architecture. In: Proceedings of the International Meeting of Computer Science (ENC\u201901), Aguascalientes, Mexico, volume\u00a0II, pages 1007\u20131016"}],"container-title":["Pattern Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-021-00971-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10044-021-00971-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-021-00971-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,23]],"date-time":"2022-12-23T00:01:03Z","timestamp":1671753663000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10044-021-00971-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,31]]},"references-count":65,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["971"],"URL":"https:\/\/doi.org\/10.1007\/s10044-021-00971-3","relation":{},"ISSN":["1433-7541","1433-755X"],"issn-type":[{"type":"print","value":"1433-7541"},{"type":"electronic","value":"1433-755X"}],"subject":[],"published":{"date-parts":[[2021,3,31]]},"assertion":[{"value":"14 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}