{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T17:06:17Z","timestamp":1770743177892,"version":"3.49.0"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T00:00:00Z","timestamp":1590364800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T00:00:00Z","timestamp":1590364800000},"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":["Algorithmica"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s00453-020-00722-6","type":"journal-article","created":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T06:02:17Z","timestamp":1590386537000},"page":"3195-3215","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Lempel\u2013Ziv-Like Parsing in Small Space"],"prefix":"10.1007","volume":"82","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2909-2952","authenticated-orcid":false,"given":"Dmitry","family":"Kosolobov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Valenzuela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon J.","family":"Puglisi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,25]]},"reference":[{"issue":"1","key":"722_CR1","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/3231935","volume":"37","author":"J Alakuijala","year":"2018","unstructured":"Alakuijala, J., Farruggia, A., Ferragina, P., Kliuchnikov, E., Obryk, R., Szabadka, Z., Vandevenne, L.: Brotli: a general-purpose data compressor. ACM Trans. Inf. Syst. 37(1), 4 (2018). https:\/\/doi.org\/10.1145\/3231935","journal-title":"ACM Trans. Inf. Syst."},{"issue":"5","key":"722_CR2","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0020-0190(01)00275-7","volume":"82","author":"A Amir","year":"2002","unstructured":"Amir, A., Landau, G.M., Ukkonen, E.: Online timestamped text indexing. Inf. Process. Lett. 82(5), 253\u2013259 (2002). https:\/\/doi.org\/10.1016\/S0020-0190(01)00275-7","journal-title":"Inf. Process. Lett."},{"key":"722_CR3","doi-asserted-by":"publisher","unstructured":"Bannai, H., Gagie, T., I, T.: Online LZ77 parsing and matching statistics with RLBWTs. In: Proceedings of the CPM 2018, LIPIcs, vol. 105, pp. 7:1\u20137:12. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2018.7","DOI":"10.4230\/LIPIcs.CPM.2018.7"},{"key":"722_CR4","doi-asserted-by":"publisher","unstructured":"Belazzougui, D., Puglisi, S.J.: Range predecessor and Lempel\u2013Ziv parsing. In: Proceedings of the SODA 2016, pp. 2053\u20132071. SIAM (2016). https:\/\/doi.org\/10.1137\/1.9781611974331.ch143","DOI":"10.1137\/1.9781611974331.ch143"},{"key":"722_CR5","doi-asserted-by":"publisher","unstructured":"Bille, P., Cording, P.H., Fischer, J., G\u00f8rtz, I.L.: Lempel\u2013Ziv compression in a sliding window. In: Proceedings of the CPM 2017, LIPIcs, vol.\u00a078. Schloss Dagstuhl\u2013Leibniz\u2013Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2017.15","DOI":"10.4230\/LIPIcs.CPM.2017.15"},{"key":"722_CR6","doi-asserted-by":"publisher","first-page":"11565","DOI":"10.1038\/srep11565","volume":"5","author":"S Deorowicz","year":"2015","unstructured":"Deorowicz, S., Danek, A., Niemiec, M.: GDC 2: compression of large collections of genomes. Sci. Rep. 5, 11565 (2015). https:\/\/doi.org\/10.1038\/srep11565","journal-title":"Sci. Rep."},{"issue":"21","key":"722_CR7","doi-asserted-by":"publisher","first-page":"2979","DOI":"10.1093\/bioinformatics\/btr505","volume":"27","author":"S Deorowicz","year":"2011","unstructured":"Deorowicz, S., Grabowski, S.: Robust relative compression of genomes with random access. Bioinformatics 27(21), 2979\u20132986 (2011). https:\/\/doi.org\/10.1093\/bioinformatics\/btr505","journal-title":"Bioinformatics"},{"key":"722_CR8","unstructured":"Duda, J.: Asymmetric numeral systems as close to capacity low state entropy coders. CoRR abs\/1311.2540 (2013). http:\/\/arxiv.org\/abs\/1311.2540"},{"issue":"2","key":"722_CR9","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1109\/TIT.1975.1055349","volume":"21","author":"P Elias","year":"1975","unstructured":"Elias, P.: Universal codeword sets and representations of the integers. IEEE Trans. Inf. Theory 21(2), 194\u2013203 (1975). https:\/\/doi.org\/10.1109\/TIT.1975.1055349","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"722_CR10","doi-asserted-by":"publisher","first-page":"1521","DOI":"10.1137\/120869511","volume":"42","author":"P Ferragina","year":"2013","unstructured":"Ferragina, P., Nitto, I., Venturini, R.: On the bit-complexity of Lempel-Ziv compression. SIAM J. Comput. 42(4), 1521\u20131541 (2013). https:\/\/doi.org\/10.1137\/120869511","journal-title":"SIAM J. Comput."},{"key":"722_CR11","doi-asserted-by":"publisher","unstructured":"Fischer, J., Gagie, T., Gawrychowski, P., Kociumaka, T.: Approximating LZ77 via small-space multiple-pattern matching. In: Proceedings of the ESA 2015, LNCS, vol. 9294, pp. 533\u2013544. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-662-48350-3_45","DOI":"10.1007\/978-3-662-48350-3_45"},{"issue":"6","key":"722_CR12","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.ipl.2006.04.008","volume":"99","author":"T Gagie","year":"2006","unstructured":"Gagie, T.: Large alphabets and incompressibility. Inf. Process. Lett. 99(6), 246\u2013251 (2006). https:\/\/doi.org\/10.1016\/j.ipl.2006.04.008","journal-title":"Inf. Process. Lett."},{"key":"722_CR13","doi-asserted-by":"publisher","unstructured":"Gagie, T., Manzini, G.: Space-conscious compression. In: Proc. MFCS 2007, LNCS, vol. 4708, pp. 206\u2013217. Springer (2007). https:\/\/doi.org\/10.1007\/978-3-540-74456-6_20","DOI":"10.1007\/978-3-540-74456-6_20"},{"key":"722_CR14","doi-asserted-by":"publisher","unstructured":"Gagie, T., Navarro, G., Prezza, N.: On the approximation ratio of Lempel\u2013Ziv parsing. In: Proceedings of the LATIN 2018, LNCS, vol. 10807, pp. 490\u2013503. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-77404-6_36","DOI":"10.1007\/978-3-319-77404-6_36"},{"key":"722_CR15","doi-asserted-by":"publisher","unstructured":"Gagie, T., Navarro, G., Prezza, N.: Optimal-time text indexing in BWT-runs bounded space. In: Proceedings of the SODA 2018, pp. 1459\u20131477. SIAM (2018). https:\/\/doi.org\/10.1137\/1.9781611975031.96","DOI":"10.1137\/1.9781611975031.96"},{"key":"722_CR16","doi-asserted-by":"publisher","unstructured":"Gagie, T., Puglisi, S.J., Valenzuela, D.: Analyzing relative Lempel\u2013Ziv reference construction. In: Proceedings of the SPIRE 2016, LNCS, vol. 9954, pp. 160\u2013165. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-319-46049-9_16","DOI":"10.1007\/978-3-319-46049-9_16"},{"key":"722_CR17","unstructured":"Ga\u0144czorz, M.: Entropy bounds for grammar compression. CoRR abs\/1804.08547 (2018). http:\/\/arxiv.org\/abs\/1804.08547"},{"key":"722_CR18","doi-asserted-by":"publisher","unstructured":"Gog, S., Beller, T., Moffat, A., Petri, M.: From theory to practice: Plug and play with succinct data structures. In: Proceedings of the SEA 2014, LNCS, vol. 8504, pp. 326\u2013337. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-319-07959-2_28","DOI":"10.1007\/978-3-319-07959-2_28"},{"issue":"3","key":"722_CR19","doi-asserted-by":"publisher","first-page":"265","DOI":"10.14778\/2078331.2078341","volume":"5","author":"C Hoobin","year":"2011","unstructured":"Hoobin, C., Puglisi, S.J., Zobel, J.: Relative Lempel\u2013Ziv factorization for efficient storage and retrieval of web collections. Proc. VLDB Endow. 5(3), 265\u2013273 (2011). https:\/\/doi.org\/10.14778\/2078331.2078341","journal-title":"Proc. VLDB Endow."},{"key":"722_CR20","doi-asserted-by":"publisher","unstructured":"K\u00e4rkk\u00e4inen, J., Kempa, D., Puglisi, S.J.: Linear time Lempel\u2013Ziv factorization: Simple, fast, small. In: Proceedings of the CPM 2013, LNCS, vol. 7922, pp. 189\u2013200. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-38905-4_19","DOI":"10.1007\/978-3-642-38905-4_19"},{"key":"722_CR21","doi-asserted-by":"publisher","unstructured":"Karkkainen, J., Kempa, D., Puglisi, S.J.: Lempel\u2013Ziv parsing in external memory. In: Proceedings of the DCC 2014, pp. 153\u2013162. IEEE (2014). https:\/\/doi.org\/10.1109\/DCC.2014.78","DOI":"10.1109\/DCC.2014.78"},{"key":"722_CR22","doi-asserted-by":"publisher","unstructured":"Kempa, D., Kosolobov, D.: LZ-End parsing in compressed space. In: Proceedings of the DCC 2017, pp. 350\u2013359. IEEE (2017). https:\/\/doi.org\/10.1109\/DCC.2017.73","DOI":"10.1109\/DCC.2017.73"},{"key":"722_CR23","doi-asserted-by":"publisher","unstructured":"Kempa, D., Prezza, N.: At the roots of dictionary compression: string attractors. In: Proceedings of the STOC 2018, pp. 827\u2013840. ACM (2018). https:\/\/doi.org\/10.1145\/3188745.3188814","DOI":"10.1145\/3188745.3188814"},{"issue":"3","key":"722_CR24","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1137\/S0097539797331105","volume":"29","author":"SR Kosaraju","year":"1999","unstructured":"Kosaraju, S.R., Manzini, G.: Compression of low entropy strings with Lempel\u2013Ziv algorithms. SIAM J. Comput. 29(3), 893\u2013911 (1999). https:\/\/doi.org\/10.1137\/S0097539797331105","journal-title":"SIAM J. Comput."},{"key":"722_CR25","doi-asserted-by":"publisher","unstructured":"Kosolobov, D.: Relations between greedy and bit-optimal LZ77 encodings. In: Proceedings of the STACS 2018, LIPIcs, vol.\u00a096, pp. 46:1\u201346:14. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2018.46","DOI":"10.4230\/LIPIcs.STACS.2018.46"},{"key":"722_CR26","doi-asserted-by":"publisher","unstructured":"Kreft, S., Navarro, G.: LZ77-like compression with fast random access. In: Proceedings of the DCC 2010, pp. 239\u2013248. IEEE (2010). https:\/\/doi.org\/10.1109\/DCC.2010.29","DOI":"10.1109\/DCC.2010.29"},{"key":"722_CR27","doi-asserted-by":"publisher","unstructured":"Kuruppu, S., Puglisi, S.J., Zobel, J.: Relative Lempel\u2013Ziv compression of genomes for large-scale storage and retrieval. In: Proceedings of the SPIRE 2010, LNCS, vol. 6393, pp. 201\u2013206. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-16321-0_20","DOI":"10.1007\/978-3-642-16321-0_20"},{"key":"722_CR28","unstructured":"Kuruppu, S., Puglisi, S.J., Zobel, J.: Optimized relative Lempel\u2013Ziv compression of genomes. In: Australasian Computer Science Conference, pp. 91\u201398. Australian Computer Society, Inc. (2011)"},{"key":"722_CR29","doi-asserted-by":"publisher","unstructured":"Larsson, N.J.: Most recent match queries in on-line suffix trees. In: Proceedings of the CPM 2014, LNCS, vol. 8486, pp. 252\u2013261 (2014). https:\/\/doi.org\/10.1007\/978-3-319-07566-2_26","DOI":"10.1007\/978-3-319-07566-2_26"},{"issue":"3","key":"722_CR30","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.tcs.2007.07.017","volume":"387","author":"NJ Larsson","year":"2007","unstructured":"Larsson, N.J., Sadakane, K.: Faster suffix sorting. Theor. Comput. Sci. 387(3), 258\u2013272 (2007). https:\/\/doi.org\/10.1016\/j.tcs.2007.07.017","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"722_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/spe.2203","volume":"45","author":"D Lemire","year":"2015","unstructured":"Lemire, D., Boytsov, L.: Decoding billions of integers per second through vectorization. Softw. Pract. Exp. 45(1), 1\u201329 (2015)","journal-title":"Softw. Pract. Exp."},{"key":"722_CR32","first-page":"149","volume":"20","author":"VI Levenshtein","year":"1968","unstructured":"Levenshtein, V.I.: On the redundancy and delay of decodable coding of natural numbers. Syst. Theory Res. 20, 149\u2013155 (1968)","journal-title":"Syst. Theory Res."},{"key":"722_CR33","doi-asserted-by":"publisher","unstructured":"Liao, K., Petri, M., Moffat, A., Wirth, A.: Effective construction of relative Lempel\u2013Ziv dictionaries. In: Proceedings of the WWW 2016, pp. 807\u2013816. International World Wide Web Conferences Steering Committee (2016). https:\/\/doi.org\/10.1145\/2872427.2883042","DOI":"10.1145\/2872427.2883042"},{"issue":"1","key":"722_CR34","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1216370.1216372","volume":"39","author":"V M\u00e4kinen","year":"2007","unstructured":"M\u00e4kinen, V., Navarro, G.: Compressed full-text indexes. ACM Comput. Surv. 39(1), 2 (2007). https:\/\/doi.org\/10.1145\/1216370.1216372","journal-title":"ACM Comput. Surv."},{"issue":"3","key":"722_CR35","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1145\/382780.382782","volume":"48","author":"G Manzini","year":"2001","unstructured":"Manzini, G.: An analysis of the Burrows\u2013Wheeler transform. J. ACM 48(3), 407\u2013430 (2001). https:\/\/doi.org\/10.1145\/382780.382782","journal-title":"J. ACM"},{"key":"722_CR36","doi-asserted-by":"publisher","unstructured":"Navarro, G.: Indexing highly repetitive collections. In: Proceedings of the IWOCA 2012, LNCS, vol. 7643, pp. 274\u2013279 (2012). https:\/\/doi.org\/10.1007\/978-3-642-35926-2_29","DOI":"10.1007\/978-3-642-35926-2_29"},{"key":"722_CR37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2871452","author":"C Ochoa","year":"2018","unstructured":"Ochoa, C., Navarro, G.: RePair and all irreducible grammars are upper bounded by high-order empirical entropy. IEEE Trans. Inf. Theory (2018). https:\/\/doi.org\/10.1109\/TIT.2018.2871452","journal-title":"IEEE Trans. Inf. Theory"},{"key":"722_CR38","doi-asserted-by":"publisher","unstructured":"Policriti, A., Prezza, N.: Fast online Lempel\u2013Ziv factorization in compressed space. In: Proceedings of the SPIRE 2015, LNCS, vol. 9309, pp. 13\u201320. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-319-23826-5_2","DOI":"10.1007\/978-3-319-23826-5_2"},{"issue":"7","key":"722_CR39","doi-asserted-by":"publisher","first-page":"1986","DOI":"10.1007\/s00453-017-0327-z","volume":"80","author":"A Policriti","year":"2018","unstructured":"Policriti, A., Prezza, N.: LZ77 computation based on the run-length encoded BWT. Algorithmica 80(7), 1986\u20132011 (2018). https:\/\/doi.org\/10.1007\/s00453-017-0327-z","journal-title":"Algorithmica"},{"key":"722_CR40","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1007\/978-1-4939-2864-4_634","volume-title":"Encyclopedia of algorithms","author":"SJ Puglisi","year":"2016","unstructured":"Puglisi, S.J.: Lempel-Ziv compression. In: Kao, M.-Y. (ed.) Encyclopedia of algorithms, pp. 1095\u20131100., Springer, New York (2016). https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_634"},{"issue":"4","key":"722_CR41","doi-asserted-by":"publisher","first-page":"1283","DOI":"10.1109\/18.761286","volume":"45","author":"PC Shields","year":"1999","unstructured":"Shields, P.C.: Performance of LZ algorithms on individual sequences. IEEE Trans. Inf. Theory 45(4), 1283\u20131288 (1999). https:\/\/doi.org\/10.1109\/18.761286","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"722_CR42","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1145\/322344.322346","volume":"29","author":"JA Storer","year":"1982","unstructured":"Storer, J.A., Szymanski, T.G.: Data compression via textual substitution. J. ACM 29(4), 928\u2013951 (1982). https:\/\/doi.org\/10.1145\/322344.322346","journal-title":"J. ACM"},{"issue":"1","key":"722_CR43","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/0095-8956(80)90044-1","volume":"29","author":"TW Tillson","year":"1980","unstructured":"Tillson, T.W.: A hamiltonian decomposition of $$K^*_{2m}$$, $$2m \\ge 8$$. J. Combin. Theory Ser. B 29(1), 68\u201374 (1980). https:\/\/doi.org\/10.1016\/0095-8956(80)90044-1","journal-title":"J. Combin. Theory Ser. B"},{"key":"722_CR44","doi-asserted-by":"publisher","unstructured":"Valenzuela, D.: CHICO: A compressed hybrid index for repetitive collections. In: Proceedings of the SEA 2016, LNCS, vol. 9685, pp. 326\u2013338. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-319-38851-9_22","DOI":"10.1007\/978-3-319-38851-9_22"},{"issue":"5","key":"722_CR45","doi-asserted-by":"publisher","first-page":"1275","DOI":"10.1109\/TCBB.2013.122","volume":"10","author":"S Wandelt","year":"2013","unstructured":"Wandelt, S., Leser, U.: FRESCO: referential compression of highly similar sequences. IEEE\/ACM Trans. Comput. Biol. Bioinf. 10(5), 1275\u20131288 (2013). https:\/\/doi.org\/10.1109\/TCBB.2013.122","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"issue":"5","key":"722_CR46","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.1109\/18.623144","volume":"43","author":"AJ Wyner","year":"1997","unstructured":"Wyner, A.J.: The redundancy and distribution of the phrase lengths of the fixed-database Lempel\u2013Ziv algorithm. IEEE Trans. Inf. Theory 43(5), 1452\u20131464 (1997). https:\/\/doi.org\/10.1109\/18.623144","journal-title":"IEEE Trans. Inf. Theory"},{"key":"722_CR47","unstructured":"Yann Collet: Zstandard. (2016). Retrieved from: https:\/\/facebook.github.io\/zstd\/. Accessed 2018-09-17"},{"key":"722_CR48","unstructured":"Yuta Mori: libdivsufsort. https:\/\/github.com\/y-256\/libdivsufsort\/. Accessed 22 May 2020"},{"issue":"1","key":"722_CR49","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/TIT.1976.1055501","volume":"22","author":"J Ziv","year":"1976","unstructured":"Ziv, J., Lempel, A.: On the complexity of finite sequences. IEEE Trans. Inf. Theory 22(1), 75\u201381 (1976). https:\/\/doi.org\/10.1109\/TIT.1976.1055501","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"722_CR50","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J Ziv","year":"1977","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory 23(3), 337\u2013343 (1977). https:\/\/doi.org\/10.1109\/TIT.1977.1055714","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00722-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-020-00722-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00722-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,24]],"date-time":"2021-05-24T23:37:44Z","timestamp":1621899464000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-020-00722-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,25]]},"references-count":50,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["722"],"URL":"https:\/\/doi.org\/10.1007\/s00453-020-00722-6","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,25]]},"assertion":[{"value":"20 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}