{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T09:49:15Z","timestamp":1782121755513,"version":"3.54.5"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T00:00:00Z","timestamp":1771804800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T00:00:00Z","timestamp":1771804800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100005992","name":"Ministry of Education and Science","doi-asserted-by":"publisher","award":["INSAIT"],"award-info":[{"award-number":["INSAIT"]}],"id":[{"id":"10.13039\/501100005992","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2026,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Internal Pattern Matching (IPM) queries on a length-\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$n$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mi>n<\/mml:mi>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    text\n                    <jats:italic>T<\/jats:italic>\n                    , given two fragments\n                    <jats:italic>X<\/jats:italic>\n                    and\n                    <jats:italic>Y<\/jats:italic>\n                    of\n                    <jats:italic>T<\/jats:italic>\n                    such that\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$|Y|&lt;2|X|$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mo>|<\/mml:mo>\n                            <mml:mi>Y<\/mml:mi>\n                            <mml:mo>|<\/mml:mo>\n                            <mml:mo>&lt;<\/mml:mo>\n                            <mml:mn>2<\/mml:mn>\n                            <mml:mo>|<\/mml:mo>\n                            <mml:mi>X<\/mml:mi>\n                            <mml:mo>|<\/mml:mo>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    , ask to compute all exact occurrences of\n                    <jats:italic>X<\/jats:italic>\n                    within\u00a0\n                    <jats:italic>Y<\/jats:italic>\n                    . IPM queries have been introduced by Kociumaka, Radoszewski, Rytter, and Wale\u0144 [SODA\u201915 &amp; SICOMP\u201924], who showed that they can be answered in\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\mathcal {O}(1)$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>O<\/mml:mi>\n                            <mml:mo>(<\/mml:mo>\n                            <mml:mn>1<\/mml:mn>\n                            <mml:mo>)<\/mml:mo>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    time using a data structure of size\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\mathcal {O}(n)$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>O<\/mml:mi>\n                            <mml:mo>(<\/mml:mo>\n                            <mml:mi>n<\/mml:mi>\n                            <mml:mo>)<\/mml:mo>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    and used this result to answer various queries about fragments of\u00a0\n                    <jats:italic>T<\/jats:italic>\n                    . In this work, we study IPM queries on compressed and dynamic strings. Our result is an\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\mathcal {O}(\\log n)$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>O<\/mml:mi>\n                            <mml:mo>(<\/mml:mo>\n                            <mml:mo>log<\/mml:mo>\n                            <mml:mi>n<\/mml:mi>\n                            <mml:mo>)<\/mml:mo>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    -time query algorithm applicable to any balanced recompression-based run-length straight-line program (RLSLP). In particular, one can use it on top of the RLSLP of Kociumaka, Navarro, and Prezza [IEEE TIT\u201923], whose size\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\mathcal {O}\\big (\\delta \\log \\frac{n\\log \\sigma }{\\delta \\log n}\\big )$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>O<\/mml:mi>\n                            <mml:mrow>\n                              <mml:mo>(<\/mml:mo>\n                            <\/mml:mrow>\n                            <mml:mi>\u03b4<\/mml:mi>\n                            <mml:mo>log<\/mml:mo>\n                            <mml:mfrac>\n                              <mml:mrow>\n                                <mml:mi>n<\/mml:mi>\n                                <mml:mo>log<\/mml:mo>\n                                <mml:mi>\u03c3<\/mml:mi>\n                              <\/mml:mrow>\n                              <mml:mrow>\n                                <mml:mi>\u03b4<\/mml:mi>\n                                <mml:mo>log<\/mml:mo>\n                                <mml:mi>n<\/mml:mi>\n                              <\/mml:mrow>\n                            <\/mml:mfrac>\n                            <mml:mrow>\n                              <mml:mo>)<\/mml:mo>\n                            <\/mml:mrow>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    is optimal (among all text representations) as a function of the text length\n                    <jats:italic>n<\/jats:italic>\n                    , the alphabet size\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\sigma $$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mi>\u03c3<\/mml:mi>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    , and the substring complexity\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\delta $$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mi>\u03b4<\/mml:mi>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    . Our procedure does not rely on any preprocessing of the underlying RLSLP, which makes it readily applicable on top of the dynamic strings data structure of Gawrychowski, Karczmarz, Kociumaka, \u0141\u0105cki and Sankowski [SODA\u201918], which supports fully persistent updates in logarithmic time with high probability.\n                  <\/jats:p>","DOI":"10.1007\/s00224-026-10266-x","type":"journal-article","created":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T09:56:33Z","timestamp":1771840593000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts"],"prefix":"10.1007","volume":"70","author":[{"given":"Anouk","family":"Duyster","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tomasz","family":"Kociumaka","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,2,23]]},"reference":[{"key":"10266_CR1","doi-asserted-by":"publisher","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W., Wale\u0144, T.: Internal Pattern Matching Queries in a Text and Applications. In: 26th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, P. Indyk (ed.), (SIAM, 2015), pp. 532\u2013551. https:\/\/doi.org\/10.1137\/1.9781611973730.36","DOI":"10.1137\/1.9781611973730.36"},{"issue":"5","key":"10266_CR2","doi-asserted-by":"publisher","first-page":"1524","DOI":"10.1137\/23M1567618","volume":"53","author":"T Kociumaka","year":"2024","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W., Wale\u0144, T.: Internal pattern matching queries in a text and applications. SIAM J. Comput. 53(5), 1524\u20131577 (2024). https:\/\/doi.org\/10.1137\/23M1567618","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10266_CR3","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0022-0000(88)90045-1","volume":"37","author":"GM Landau","year":"1988","unstructured":"Landau, G.M., Vishkin, U.: Fast string matching with $$k$$ differences. J. Comput. Syst. Sci. 37(1), 63\u201378 (1988). https:\/\/doi.org\/10.1016\/0022-0000(88)90045-1","journal-title":"J. Comput. Syst. Sci."},{"key":"10266_CR4","doi-asserted-by":"publisher","unstructured":"Charalampopoulos, P., Kociumaka, T., Wellnitz, P.: Faster Approximate Pattern Matching: A Unified Approach, in 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Irani, S. (ed.), (IEEE Computer Society), pp. 978\u2013989 (2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00095","DOI":"10.1109\/FOCS46700.2020.00095"},{"key":"10266_CR5","doi-asserted-by":"publisher","unstructured":"T. I.: Longest Common Extensions with Recompression. In: 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, LIPIcs, vol. 78, K\u00e4rkk\u00e4inen, J., Radoszewski, J., Rytter, W. (eds.), (Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik), pp. 18:1\u201318:15 (2017). https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2017.18","DOI":"10.4230\/LIPIcs.CPM.2017.18"},{"key":"10266_CR6","doi-asserted-by":"publisher","unstructured":"Kempa, D., Kociumaka, T.: Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space. In: 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023 (IEEE), pp. 1877\u20131886 (2023). https:\/\/doi.org\/10.1109\/FOCS57990.2023.00114","DOI":"10.1109\/FOCS57990.2023.00114"},{"key":"10266_CR7","doi-asserted-by":"publisher","unstructured":"Gawrychowski, P., Karczmarz, A., Kociumaka, T., \u0141\u0105cki, J., Sankowski, P.: Optimal Dynamic Strings, in 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, Czumaj, A. (ed.), (SIAM), pp. 1509\u20131528 (2018). https:\/\/doi.org\/10.1137\/1.9781611975031.99","DOI":"10.1137\/1.9781611975031.99"},{"key":"10266_CR8","doi-asserted-by":"publisher","unstructured":"Cardinal, J., Iacono, J.: Modular Subset Sum, Dynamic Strings, and Zero-Sum Sets. in 4th Symposium on Simplicity in Algorithms, SOSA 2021, Le, H.V., King, V. (eds.), (SIAM), pp. 45\u201356 (2021). https:\/\/doi.org\/10.1137\/1.9781611976496.5","DOI":"10.1137\/1.9781611976496.5"},{"key":"10266_CR9","doi-asserted-by":"publisher","unstructured":"Charalampopoulos, P., Kociumaka, T., Pissis, S.P., Radoszewski, J., Rytter, W., Wale\u0144, T., Zuba, W.: Approximate Circular Pattern Matching, in 30th Annual European Symposium on Algorithms, ESA 2022, LIPIcs, vol. 244, Chechik, S., Navarro, G., Rotenberg, E., Herman, G. (eds.), (Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik), pp. 35:1\u201335:19 (2022). https:\/\/doi.org\/10.4230\/LIPICS.ESA.2022.35","DOI":"10.4230\/LIPICS.ESA.2022.35"},{"key":"10266_CR10","doi-asserted-by":"publisher","unstructured":"Charalampopoulos, P., Kociumaka, T., Wellnitz, P.: Faster Pattern Matching under Edit Distance: A Reduction to Dynamic Puzzle Matching and the Seaweed Monoid of Permutation Matrices. In: 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022 (IEEE), pp. 698\u2013707 (2022). https:\/\/doi.org\/10.1109\/FOCS54457.2022.00072","DOI":"10.1109\/FOCS54457.2022.00072"},{"key":"10266_CR11","doi-asserted-by":"publisher","unstructured":"Charalampopoulos, P., Pissis, S.P., Radoszewski, J., Rytter, W., Wale\u0144, T., Zuba, W.: Approximate Circular Pattern Matching Under Edit Distance. In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, LIPIcs, vol. 289, Beyersdorff, O., Kant\u00e9, M.M., Kupferman, O., Lokshtanov, D. (eds.), (Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik), pp. 24:1\u201324:22 (2024). https:\/\/doi.org\/10.4230\/LIPICS.STACS.2024.24","DOI":"10.4230\/LIPICS.STACS.2024.24"},{"key":"10266_CR12","doi-asserted-by":"publisher","unstructured":"Clifford, R., Gawrychowski, P., Kociumaka, T., Martin, D.P., Uzna\u0144ski, P.: The Dynamic k-Mismatch Problem, in 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, LIPIcs, vol. 223, Bannai, H., Holub, J (eds.), (Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik), pp. 18:1\u201318:15 (2022). https:\/\/doi.org\/10.4230\/LIPICS.CPM.2022.18","DOI":"10.4230\/LIPICS.CPM.2022.18"},{"key":"10266_CR13","doi-asserted-by":"publisher","unstructured":"Sahinalp, S.C., Vishkin, U.: Symmetry breaking for suffix tree construction. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 23\u201325 May 1994, Montr\u00e9al, Qu\u00e9bec, Canada, Leighton, F.T., Goodrich, M.T. (eds.), (ACM), pp. 300\u2013309 (1994). https:\/\/doi.org\/10.1145\/195058.195164","DOI":"10.1145\/195058.195164"},{"key":"10266_CR14","doi-asserted-by":"publisher","unstructured":"Sahinalp, S.C., Vishkin, U.: On a Parallel-Algorithms Method for String Matching Problems. In: Algorithms and Complexity, Second Italian Conference, CIAC \u201994, Rome, Italy, February 23\u201325, 1994, Proceedings, Lecture Notes in Computer Science, vol. 778, Bonuccelli, M.A, Crescenzi, P., Petreschi, R. (eds.), (Springer), pp. 22\u201332 (1994). https:\/\/doi.org\/10.1007\/3-540-57811-0_3","DOI":"10.1007\/3-540-57811-0_3"},{"issue":"2","key":"10266_CR15","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/BF02522825","volume":"17","author":"K Mehlhorn","year":"1997","unstructured":"Mehlhorn, K., Sundar, R., Uhrig, C.: Maintaining dynamic sequences under equality tests in polylogarithmic time. Algorithmica 17(2), 183\u2013198 (1997). https:\/\/doi.org\/10.1007\/BF02522825","journal-title":"Algorithmica"},{"key":"10266_CR16","unstructured":"Alstrup, S., Brodal, G.S., Rauhe, T.: Pattern matching in dynamic texts, in 11th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2000, Shmoys, D.B. (ed.), (ACM\/SIAM), pp. 819\u2013828 (2000). http:\/\/dl.acm.org\/citation.cfm?id=338219.338645"},{"key":"10266_CR17","doi-asserted-by":"publisher","unstructured":"Nishimoto, T., I, T., Inenaga, S., Bannai, H., Takeda, M.: Fully Dynamic Data Structure for LCE Queries in Compressed Space, in 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22\u201326, 2016 - Krak\u00f3w, Poland, LIPIcs, vol. 58, Faliszewski, P., Muscholl, A., Niedermeier, R. (eds.), (Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik), pp. 72:1\u201372:15 (2016). https:\/\/doi.org\/10.4230\/LIPICS.MFCS.2016.72","DOI":"10.4230\/LIPICS.MFCS.2016.72"},{"key":"10266_CR18","doi-asserted-by":"publisher","unstructured":"Kempa, D., Kociumaka, T.: Dynamic suffix array with polylogarithmic queries and updates. In: 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022, Leonardi, S., Gupta, A. (eds.), (ACM), pp. 1657\u20131670 (2022). https:\/\/doi.org\/10.1145\/3519935.3520061","DOI":"10.1145\/3519935.3520061"},{"key":"10266_CR19","doi-asserted-by":"publisher","unstructured":"Je\u017c, A.: Faster fully compressed pattern matching by recompression. ACM Trans. Algorithms 11(3), 20:1\u201320:43 (2015). https:\/\/doi.org\/10.1145\/2631920","DOI":"10.1145\/2631920"},{"key":"10266_CR20","doi-asserted-by":"publisher","unstructured":"Je\u017c, A.: Recompression: A simple and powerful technique for word equations. J. ACM 63(1), 4:1\u20134:51 (2016). https:\/\/doi.org\/10.1145\/2743014","DOI":"10.1145\/2743014"},{"issue":"4","key":"10266_CR21","doi-asserted-by":"publisher","first-page":"2074","DOI":"10.1109\/TIT.2022.3224382","volume":"69","author":"T Kociumaka","year":"2023","unstructured":"Kociumaka, T., Navarro, G., Prezza, N.: Towards a definitive compressibility measure for repetitive sequences. IEEE Trans. Inf. Theory 69(4), 2074\u20132092 (2023). https:\/\/doi.org\/10.1109\/TIT.2022.3224382","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10266_CR22","doi-asserted-by":"publisher","unstructured":"Kempa, D., Kociumaka, T.: Resolution of the Burrows-Wheeler Transform Conjecture. In: 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Irani, S. (ed.), (IEEE Computer Society), pp. 1002\u20131013 (2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00097","DOI":"10.1109\/FOCS46700.2020.00097"},{"key":"10266_CR23","doi-asserted-by":"publisher","unstructured":"Duyster, A., Kociumaka, T.: Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts. In: 31st International Symposium on String Processing and Information Retrieval, SPIRE 2024, LNCS, vol. 14899, Lipt\u00e1k, Z., de Moura, E.S., Figueroa, K., Baeza-Yates, R. (eds.), (Springer), pp. 102\u2013117 (2024). https:\/\/doi.org\/10.1007\/978-3-031-72200-4_8","DOI":"10.1007\/978-3-031-72200-4_8"},{"issue":"3","key":"10266_CR24","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1109\/18.841160","volume":"46","author":"JC Kieffer","year":"2000","unstructured":"Kieffer, J.C., Yang, E.: Grammar-based codes: A new class of universal lossless source codes. IEEE Trans. Inf. Theory 46(3), 737\u2013754 (2000). https:\/\/doi.org\/10.1109\/18.841160","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10266_CR25","doi-asserted-by":"publisher","unstructured":"Mehlhorn, K., Sanders, P.: Algorithms and Data Structures: The Basic Toolbox (Springer) (2008). https:\/\/doi.org\/10.1007\/978-3-540-77978-0","DOI":"10.1007\/978-3-540-77978-0"},{"key":"10266_CR26","doi-asserted-by":"publisher","unstructured":"Amir, A., Benson, G.: Efficient Two-Dimensional Compressed Matching. In: IEEE Data Compression Conference, DCC 1992, Storer, J.A., Cohn, M. (eds.), (IEEE Computer Society), pp. 279\u2013288 (1992). https:\/\/doi.org\/10.1109\/DCC.1992.227453","DOI":"10.1109\/DCC.1992.227453"},{"issue":"1","key":"10266_CR27","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/0196-6774(92)90003-U","volume":"13","author":"A Amir","year":"1992","unstructured":"Amir, A., Landau, G.M., Vishkin, U.: Efficient pattern matching with scaling. Journal of Algorithms-cognition Informatics and Logic 13(1), 2\u201332 (1992). https:\/\/doi.org\/10.1016\/0196-6774(92)90003-U","journal-title":"Journal of Algorithms-cognition Informatics and Logic"},{"issue":"2","key":"10266_CR28","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BF02238127","volume":"54","author":"KL Chung","year":"1995","unstructured":"Chung, K.L.: Fast string matching algorithms for run-length coded strings. Computing 54(2), 119\u2013125 (1995). https:\/\/doi.org\/10.1007\/BF02238127","journal-title":"Computing"},{"key":"10266_CR29","doi-asserted-by":"crossref","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. Encyclopedia of Mathematics and its Applications (Cambridge University Press) (2002)","DOI":"10.1017\/CBO9781107326019"},{"key":"10266_CR30","unstructured":"Nishimoto, T., Tabei, Y.: Dynamic suffix array in optimal compressed space. arXiv:2404.07510"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-026-10266-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-026-10266-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-026-10266-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T09:08:22Z","timestamp":1782119302000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-026-10266-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,23]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["10266"],"URL":"https:\/\/doi.org\/10.1007\/s00224-026-10266-x","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,23]]},"assertion":[{"value":"17 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 February 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2026","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The original version of this paper was updated to add a Funding statement.","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"11"}}