{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:42:54Z","timestamp":1740109374458,"version":"3.37.3"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T00:00:00Z","timestamp":1671235200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T00:00:00Z","timestamp":1671235200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Det Frie Forskningsr\u00e5d","award":["DFF-8021-002498"],"award-info":[{"award-number":["DFF-8021-002498"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s00224-022-10109-5","type":"journal-article","created":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T14:03:06Z","timestamp":1671285786000},"page":"694-713","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Random Access in Persistent Strings and Segment Selection"],"prefix":"10.1007","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1120-5154","authenticated-orcid":false,"given":"Philip","family":"Bille","sequence":"first","affiliation":[]},{"given":"Inge Li","family":"G\u00f8rtz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,17]]},"reference":[{"issue":"1","key":"10109_CR1","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1137\/10078791X","volume":"41","author":"PK Agarwal","year":"2012","unstructured":"Agarwal, P.K., Arge, L., Kaplan, H., Molad, E., Tarjan, R.E., Yi, K.: An optimal dynamic data structure for stabbing-semigroup queries. SIAM J. Comput. 41(1), 104\u2013127 (2012)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10109_CR2","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/s00453-012-9726-3","volume":"69","author":"J Barbay","year":"2014","unstructured":"Barbay, J., Claude, F., Gagie, T., Navarro, G., Nekrich, Y.: Efficient fully-compressed sequence representations. Algorithmica 69(1), 232\u2013268 (2014)","journal-title":"Algorithmica"},{"key":"10109_CR3","unstructured":"Barbay, J., He, M., Munro, J.I., Rao, S.S.: Succinct indexes for strings, binary relations and multi-labeled trees. In: Proc. 18Th SODA, pp. 680\u2013689 (2007)"},{"key":"10109_CR4","doi-asserted-by":"crossref","unstructured":"Belazzougui, D., Cording, P.H., Puglisi, S.J., Tabei, Y.: Access, rank, and select in grammar-compressed strings. In: Proc. 23Rd ESA, pp. 142\u2013154 (2015)","DOI":"10.1007\/978-3-662-48350-3_13"},{"issue":"4","key":"10109_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2629339","volume":"11","author":"D Belazzougui","year":"2015","unstructured":"Belazzougui, D., Navarro, G.: Optimal lower and upper bounds for representing sequences. ACM Trans Algorithms 11(4), 1\u201321 (2015)","journal-title":"ACM Trans Algorithms"},{"issue":"11","key":"10109_CR6","doi-asserted-by":"publisher","first-page":"3207","DOI":"10.1007\/s00453-017-0380-7","volume":"80","author":"P Bille","year":"2018","unstructured":"Bille, P., Christiansen, A.R., Cording, P.H., G\u00f8rtz, I.L., Skjoldjensen, F.R., Vildh\u00f8j, H.W., Vind, S.: Dynamic relative compression, dynamic partial sums, and substring concatenation. Algorithmica 80(11), 3207\u20133224 (2018). Announced at ISAAC 2016","journal-title":"Algorithmica"},{"key":"10109_CR7","doi-asserted-by":"crossref","unstructured":"Bille, P., Christiansen, A.R., Prezza, N., Skjoldjensen, F.R.: Succinct partial sums and fenwick trees. In: Proc. 24Th SPIRE, pp. 91\u201396 (2017)","DOI":"10.1007\/978-3-319-67428-5_8"},{"key":"10109_CR8","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.tcs.2017.12.021","volume":"713","author":"P Bille","year":"2018","unstructured":"Bille, P., Ettienne, M.B., G\u00f8rtz, I.L., Vildh\u00f8j, H.W.: Time\u2013space trade-offs for lempel\u2013ziv compressed indexing. Theoret. Comput. Sci. 713, 66\u201377 (2018)","journal-title":"Theoret. Comput. Sci."},{"key":"10109_CR9","unstructured":"Bille, P., G\u00f8rtz, I.L.: Random access in persistent strings. In: Proc. 31St ISAAC (2020)"},{"key":"10109_CR10","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.ic.2014.12.012","volume":"243","author":"P Bille","year":"2015","unstructured":"Bille, P., G\u00f8rtz, I.L., Landau, G.M., Weimann, O.: Tree compression with top trees. Inform. Comput. 243, 166\u2013177 (2015)","journal-title":"Inform. Comput."},{"issue":"3","key":"10109_CR11","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/130936889","volume":"44","author":"P Bille","year":"2015","unstructured":"Bille, P., Landau, G.M., Raman, R., Sadakane, K., Satti, S.R., Weimann, O.: Random access to grammar-compressed strings and trees. SIAM J. Comput. 44(3), 513\u2013539 (2015). Announced at SODA 2011","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10109_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2483699.2483702","volume":"9","author":"TM Chan","year":"2013","unstructured":"Chan, T.M.: Persistent predecessor search and orthogonal point location on the word RAM. ACM Trans. Algorithms 9(3), 1\u201322 (2013)","journal-title":"ACM Trans. Algorithms"},{"issue":"2","key":"10109_CR13","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1137\/07068669X","volume":"39","author":"TM Chan","year":"2009","unstructured":"Chan, T.M., Pa\u030ctra\u015fcu, M.: Transdichotomous results in computational geometry, i: Point location in sublogarithmic time. SIAM J. Comput. 39(2), 703\u2013729 (2009)","journal-title":"SIAM J. Comput."},{"key":"10109_CR14","unstructured":"Chan, T.M., Tsakalidis, K.: Dynamic planar orthogonal point location in sublogarithmic time. In: Proc 34Th SoCG 2018 (2018)"},{"issue":"7","key":"10109_CR15","doi-asserted-by":"publisher","first-page":"2554","DOI":"10.1109\/TIT.2005.850116","volume":"51","author":"M Charikar","year":"2005","unstructured":"Charikar, M., Lehman, E., Liu, D., Panigrahy, R., Prabhakaran, M., Sahai, A., Shelat, A.: The smallest grammar problem. IEEE Trans. Inform. Theory 51(7), 2554\u20132576 (2005)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"10109_CR16","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1137\/0215051","volume":"15","author":"B Chazelle","year":"1986","unstructured":"Chazelle, B.: Filtering search: A new approach to query-answering. SIAM J. Comput. 15(3), 703\u2013724 (1986)","journal-title":"SIAM J. Comput."},{"key":"10109_CR17","doi-asserted-by":"crossref","unstructured":"Chern, B., Ochoa, I., Manolakos, A., No, A., Venkat, K., Weissman, T.: Reference based genome compression. In: Proc. 12Th ITW, pp. 427\u2013431 (2012)","DOI":"10.1109\/ITW.2012.6404708"},{"issue":"2","key":"10109_CR18","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1006\/jagm.1995.1010","volume":"18","author":"M De Berg","year":"1995","unstructured":"De Berg, M., Vankreveld, M., Snoeyink, J.: Two-dimensional and three-dimensional point location in rectangular subdivisions. J. Algorithms 18(2), 256\u2013277 (1995)","journal-title":"J. Algorithms"},{"key":"10109_CR19","doi-asserted-by":"crossref","unstructured":"Dietz, P.F.: Fully persistent arrays (extended array). In: Proceedings of the Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, vol. 382, pp. 67\u201374 (1989)","DOI":"10.1007\/3-540-51542-9_8"},{"key":"10109_CR20","doi-asserted-by":"crossref","unstructured":"Dietz, P.F.: Optimal algorithms for list indexing and subset rank. In: Proc. 1St WADS, pp. 39\u201346 (1989)","DOI":"10.1007\/3-540-51542-9_5"},{"key":"10109_CR21","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.tcs.2013.07.024","volume":"532","author":"HH Do","year":"2014","unstructured":"Do, H.H., Jansson, J., Sadakane, K., Sung, W.K.: Fast relative lempel\u2013Ziv self-index for similar sequences. Theoret. Comput. Sci. 532, 14\u201330 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"10109_CR22","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","volume":"38","author":"J Driscoll","year":"1989","unstructured":"Driscoll, J., Sarnak, N., Sleator, D., Tarjan, R.: Making data structures persistent. J. Comput. System Sci. 38, 86\u2013124 (1989)","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"10109_CR23","first-page":"327","volume":"24","author":"PM Fenwick","year":"1994","unstructured":"Fenwick, P.M.: A new data structure for cumulative frequency tables. Software: Pract. Exper. 24(3), 327\u2013336 (1994)","journal-title":"Software: Pract. Exper."},{"issue":"2","key":"10109_CR24","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/1240233.1240243","volume":"3","author":"P Ferragina","year":"2007","unstructured":"Ferragina, P., Manzini, G., M\u00e4kinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM Trans. Algorithms 3(2), 20 (2007)","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"10109_CR25","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2006.12.012","volume":"372","author":"P Ferragina","year":"2007","unstructured":"Ferragina, P., Venturini, R.: A simple storage scheme for strings achieving entropy bounds. Theoret. Comput. Sci. 372(1), 115\u2013121 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"10109_CR26","doi-asserted-by":"crossref","unstructured":"Fredman, M., Saks, M.: The cell probe complexity of dynamic data structures. In: Proc. 21St STOC, pp. 345\u2013354 (1989)","DOI":"10.1145\/73007.73040"},{"issue":"3","key":"10109_CR27","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/0022-0000(93)90040-4","volume":"47","author":"ML Fredman","year":"1993","unstructured":"Fredman, M.L., Willard, D.E.: Surpassing the information theoretic bound with fusion trees. J. Comput. System Sci. 47(3), 424\u2013436 (1993)","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"10109_CR28","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/S0022-0000(05)80064-9","volume":"48","author":"ML Fredman","year":"1994","unstructured":"Fredman, M.L., Willard, D.E.: Trans-dichotomous algorithms for minimum spanning trees and shortest paths. J. Comput. System Sci. 48(3), 533\u2013551 (1994)","journal-title":"J. Comput. System Sci."},{"key":"10109_CR29","doi-asserted-by":"crossref","unstructured":"Gagie, T., Gawrychowski, P., K\u00e4rkk\u00e4inen, J., Nekrich, Y., Puglisi, S.J.: A faster grammar-based self-index. In: Proc. 6Th LATA, pp. 240\u2013251 (2012)","DOI":"10.1007\/978-3-642-28332-1_21"},{"key":"10109_CR30","doi-asserted-by":"crossref","unstructured":"Gagie, T., Gawrychowski, P., K\u00e4rkk\u00e4inen, J., Nekrich, Y., Puglisi, S.J.: LZ77-based self-indexing with faster pattern matching. In: Proc. 14Th LATIN, pp. 731\u2013742 (2014)","DOI":"10.1007\/978-3-642-54423-1_63"},{"key":"10109_CR31","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.jda.2014.10.003","volume":"32","author":"T Gagie","year":"2015","unstructured":"Gagie, T., Gawrychowski, P., Puglisi, S.J.: Approximate pattern matching in lz77-compressed texts. J. Discrete Algorithms 32, 64\u201368 (2015)","journal-title":"J. Discrete Algorithms"},{"key":"10109_CR32","doi-asserted-by":"crossref","unstructured":"Gagie, T., Karhu, K., Navarro, G., Puglisi, S.J., Sir\u00e9n, J.: Document listing on repetitive collections. In: Proc. 24Th CPM, pp. 107\u2013119 (2013)","DOI":"10.1007\/978-3-642-38905-4_12"},{"key":"10109_CR33","doi-asserted-by":"crossref","unstructured":"Ganardi, M., Jez, A., Lohrey, M.: Balancing straight-line programs. In: Proc. 60Th FOCS, pp. 1169\u20131183 (2019)","DOI":"10.1109\/FOCS.2019.00073"},{"key":"10109_CR34","doi-asserted-by":"crossref","unstructured":"Golynski, A., Munro, J.I., Rao, S.S.: Rank\/Select operations on large alphabets: a tool for text indexing. In: Proc. 17Th SODA, pp. 368\u2013373 (2006)","DOI":"10.1145\/1109557.1109599"},{"key":"10109_CR35","doi-asserted-by":"crossref","unstructured":"Golynski, A., Raman, R., Rao, S.S.: On the redundancy of succinct data structures. In: Proc. 11Th SWAT, pp. 148\u2013159 (2008)","DOI":"10.1007\/978-3-540-69903-3_15"},{"key":"10109_CR36","unstructured":"Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: Proc. 14Th SODA, pp. 841\u2013850 (2003)"},{"key":"10109_CR37","doi-asserted-by":"crossref","unstructured":"Grossi, R., Raman, R., Rao, S.S., Venturini, R.: Dynamic compressed strings with random access. In: Proc. 40Th ICALP, pp. 504\u2013515 (2013)","DOI":"10.1007\/978-3-642-39206-1_43"},{"issue":"39","key":"10109_CR38","doi-asserted-by":"publisher","first-page":"5176","DOI":"10.1016\/j.tcs.2011.05.023","volume":"412","author":"WK Hon","year":"2011","unstructured":"Hon, W.K., Sadakane, K., Sung, W.K.: Succinct data structures for searchable partial sums with optimal worst-case performance. Theoret. Comput. Sci. 412(39), 5176\u20135186 (2011)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10109_CR39","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-Ziv factorization for efficient storage and retrieval of web collections. Proc. VLDB Endowment 5(3), 265\u2013273 (2011)","journal-title":"Proc. VLDB Endowment"},{"key":"10109_CR40","doi-asserted-by":"crossref","unstructured":"J\u00f8rgensen, A.G., Larsen, K.G.: Range selection and median: tight cell probe lower bounds and adaptive data structures. In: Proc. 22Nd SODA, pp. 805\u2013813 (2011)","DOI":"10.1137\/1.9781611973082.63"},{"key":"10109_CR41","doi-asserted-by":"crossref","unstructured":"Kempa, D., Prezza, N.: At the roots of dictionary compression: string attractors. In: Proc. 50Th STOC, pp. 827\u2013840 (2018)","DOI":"10.1145\/3188745.3188814"},{"key":"10109_CR42","doi-asserted-by":"crossref","unstructured":"Kuruppu, S., Puglisi, S.J., Zobel, J.: Relative lempel-ziv compression of genomes for large-scale storage and retrieval. In: Proc. 17Th SPIRE, pp. 201\u2013206 (2010)","DOI":"10.1007\/978-3-642-16321-0_20"},{"key":"10109_CR43","unstructured":"Kuruppu, S., Puglisi, S.J., Zobel, J.: Optimized relative lempel-ziv compression of genomes. In: Proc. 34Th ACSC, pp. 91\u201398 (2011)"},{"issue":"1","key":"10109_CR44","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/298865.298867","volume":"4","author":"SY Liao","year":"1999","unstructured":"Liao, S.Y., Devadas, S., Keutzer, K.: A text-compression-based method for code size minimization in embedded systems. Trans. Design Autom. Electr. Syst. 4(1), 12\u201338 (1999)","journal-title":"Trans. Design Autom. Electr. Syst."},{"issue":"1","key":"10109_CR45","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/A:1008803430710","volume":"3","author":"SY Liao","year":"1998","unstructured":"Liao, S.Y., Devadas, S., Keutzer, K., Tjiang, S.W.K., Wang, A.: Code optimization techniques in embedded DSP microprocessors. Design. Autom. Emb. Sys. 3(1), 59\u201373 (1998)","journal-title":"Design. Autom. Emb. Sys."},{"issue":"3","key":"10109_CR46","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1089\/cmb.2009.0169","volume":"17","author":"V M\u00e4kinen","year":"2010","unstructured":"M\u00e4kinen, V., Navarro, G., Sir\u00e9n, J., V\u00e4lim\u00e4ki, N.: Storage and retrieval of highly repetitive sequence collections. J. Comput. Biol. 17 (3), 281\u2013308 (2010)","journal-title":"J. Comput. Biol."},{"key":"10109_CR47","doi-asserted-by":"crossref","unstructured":"Munro, J.I., Nekrich, Y.: Compressed data structures for dynamic sequences. In: Proc. 23Rd ESA, pp. 891\u2013902 (2015)","DOI":"10.1007\/978-3-662-48350-3_74"},{"key":"10109_CR48","doi-asserted-by":"crossref","unstructured":"Navarro, G.: Indexing highly repetitive collections. In: Proc. 23Rd IWOCA, pp. 274\u2013279 (2012)","DOI":"10.1007\/978-3-642-35926-2_29"},{"key":"10109_CR49","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.tcs.2018.11.022","volume":"772","author":"G Navarro","year":"2019","unstructured":"Navarro, G.: Document listing on repetitive collections with guaranteed performance. Theoret. Comput. Sci. 772, 58\u201372 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"10109_CR50","doi-asserted-by":"crossref","unstructured":"Nekrich, Y.: A dynamic stabbing-max data structure with sub-logarithmic query time. In: Proc. 22Nd ISAAC, pp. 170\u2013179 (2011)","DOI":"10.1007\/978-3-642-25591-5_19"},{"key":"10109_CR51","doi-asserted-by":"crossref","unstructured":"P\u0103tra\u015fcu, M., Thorup, M.: Dynamic integer sets with optimal rank, select, and predecessor search. In: Proc. 55Th FOCS, pp. 166\u2013175 (2014)","DOI":"10.1109\/FOCS.2014.26"},{"issue":"4","key":"10109_CR52","doi-asserted-by":"publisher","first-page":"932","DOI":"10.1137\/S0097539705447256","volume":"35","author":"M Pa\u030ctra\u015fcu","year":"2006","unstructured":"Pa\u030ctra\u015fcu, M., Demaine, E.D.: Logarithmic lower bounds in the cell-probe model. SIAM J. Comput. 35(4), 932\u2013963 (2006). Announced at SODA 2004","journal-title":"SIAM J. Comput."},{"key":"10109_CR53","doi-asserted-by":"crossref","unstructured":"Raman, R., Raman, V., Rao, S.S.: Succinct dynamic data structures. In: Proc. 7Th WADS, pp. 426\u2013437 (2001)","DOI":"10.1007\/3-540-44634-6_39"},{"issue":"1-3","key":"10109_CR54","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(02)00777-6","volume":"302","author":"W Rytter","year":"2003","unstructured":"Rytter, W.: Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theoret. Comput. Sci. 302(1-3), 211\u2013222 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"10109_CR55","doi-asserted-by":"crossref","unstructured":"Sadakane, K., Grossi, R.: Squeezing succinct data structures into entropy bounds. In: Proc. 17Th SODA, pp. 1230\u20131239 (2006)","DOI":"10.1145\/1109557.1109693"},{"issue":"7","key":"10109_CR56","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1145\/6138.6151","volume":"29","author":"N Sarnak","year":"1986","unstructured":"Sarnak, N., Tarjan, R.E.: Planar point location using persistent search trees. Commun. ACM 29(7), 669\u2013679 (1986)","journal-title":"Commun. ACM"},{"key":"10109_CR57","doi-asserted-by":"crossref","unstructured":"Storer, J.A., Szymanski, T.G.: The macro model for data compression. In: Proc. 10Th STOC, pp. 30\u201339 (1978)","DOI":"10.1145\/800133.804329"},{"issue":"4","key":"10109_CR58","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)","journal-title":"J. ACM"},{"key":"10109_CR59","doi-asserted-by":"crossref","unstructured":"Tarjan, R.E., Vishkin, U.: Finding biconnected componemts and computing tree functions in logarithmic parallel time. In: Proc. 25Th FOCS, pp. 12\u201320 (1984)","DOI":"10.1109\/SFCS.1984.715896"},{"key":"10109_CR60","doi-asserted-by":"crossref","unstructured":"Verbin, E., Yu, W.: Data structure lower bounds on random access to grammar-compressed strings. In: Proc. 24Th CPM, pp. 247\u2013258 (2013)","DOI":"10.1007\/978-3-642-38905-4_24"},{"issue":"3","key":"10109_CR61","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. Inform. Theory 23(3), 337\u2013343 (1977)","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-022-10109-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-022-10109-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-022-10109-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T10:09:31Z","timestamp":1691575771000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-022-10109-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,17]]},"references-count":61,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["10109"],"URL":"https:\/\/doi.org\/10.1007\/s00224-022-10109-5","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2022,12,17]]},"assertion":[{"value":"9 November 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}