{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T09:39:10Z","timestamp":1776764350418,"version":"3.51.2"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T00:00:00Z","timestamp":1770422400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T00:00:00Z","timestamp":1770422400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004281","name":"Narodowe Centrum Nauki","doi-asserted-by":"publisher","award":["2022\/46\/E\/ST6\/00463"],"award-info":[{"award-number":["2022\/46\/E\/ST6\/00463"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010665","name":"H2020 Marie Sk\u0142odowska-Curie Actions","doi-asserted-by":"publisher","award":["10103425"],"award-info":[{"award-number":["10103425"]}],"id":[{"id":"10.13039\/100010665","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]]},"DOI":"10.1007\/s00224-025-10258-3","type":"journal-article","created":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T13:18:47Z","timestamp":1770470327000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computing String Covers in Sublinear Time"],"prefix":"10.1007","volume":"70","author":[{"given":"Jakub","family":"Radoszewski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wiktor","family":"Zuba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,7]]},"reference":[{"issue":"1","key":"10258_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0020-0190(91)90056-N","volume":"39","author":"A Apostolico","year":"1991","unstructured":"Apostolico, A., Farach, M., Iliopoulos, C.S.: Optimal superprimitivity testing for strings. Inf. Process. Lett. 39(1), 17\u201320 (1991). https:\/\/doi.org\/10.1016\/0020-0190(91)90056-N","journal-title":"Inf. Process. Lett."},{"key":"10258_CR2","doi-asserted-by":"publisher","unstructured":"Bannai, H., Ellert, J.: Lyndon arrays in sublinear time. In: Inge\u00a0Li G\u00f8rtz, Martin Farach-Colton, Simon\u00a0J. Puglisi, and Grzegorz Herman, editors, 31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands, volume 274 of LIPIcs, pages 14:1\u201314:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, (2023). https:\/\/doi.org\/10.4230\/LIPICS.ESA.2023.14","DOI":"10.4230\/LIPICS.ESA.2023.14"},{"key":"10258_CR3","doi-asserted-by":"publisher","unstructured":"Bannai, H., Mieno, T., Nakashima, Y.: Lyndon words, the three squares lemma, and primitive squares. In: Christina Boucher and Sharma\u00a0V. Thankachan, editors, String Processing and Information Retrieval - 27th International Symposium, SPIRE 2020, Orlando, FL, USA, October 13-15, 2020, Proceedings, volume 12303 of Lecture Notes in Computer Science, pages 265\u2013273. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-59212-7_19","DOI":"10.1007\/978-3-030-59212-7_19"},{"key":"10258_CR4","doi-asserted-by":"publisher","unstructured":"Djamal Belazzougui, Dmitry Kosolobov, Simon\u00a0J. Puglisi, and Rajeev Raman. Weighted ancestors in suffix trees revisited. In: Pawe\u0142 Gawrychowski and Tatiana Starikovskaya, editors, 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wroc\u0142aw, Poland, volume 191 of LIPIcs, pages 8:1\u20138:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPICS.CPM.2021.8","DOI":"10.4230\/LIPICS.CPM.2021.8"},{"key":"10258_CR5","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/J.TCS.2013.06.013","volume":"525","author":"O Ben-Kiki","year":"2014","unstructured":"Ben-Kiki, O., Bille, P., Breslauer, D., Gasieniec, L., Grossi, R., Weimann, O.: Towards optimal packed string matching. Theor. Comput. Sci. 525, 111\u2013129 (2014). https:\/\/doi.org\/10.1016\/J.TCS.2013.06.013","journal-title":"Theor. Comput. Sci."},{"key":"10258_CR6","doi-asserted-by":"publisher","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gaston\u00a0H. Gonnet, Daniel Panario, and Alfredo Viola, editors, LATIN 2000: Theoretical Informatics, 4th Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000, Proceedings, volume 1776 of Lecture Notes in Computer Science, pages 88\u201394. Springer (2000). https:\/\/doi.org\/10.1007\/10719839_9","DOI":"10.1007\/10719839_9"},{"issue":"6","key":"10258_CR7","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0020-0190(92)90111-8","volume":"44","author":"D Breslauer","year":"1992","unstructured":"Breslauer, D.: An on-line string superprimitivity test. Inf. Process. Lett. 44(6), 345\u2013347 (1992). https:\/\/doi.org\/10.1016\/0020-0190(92)90111-8","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"10258_CR8","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/BF01294132","volume":"14","author":"D Breslauer","year":"1995","unstructured":"Breslauer, D., Galil, Z.: Finding all periods and initial palindromes of a string in parallel. Algorithmica 14(4), 355\u2013366 (1995). https:\/\/doi.org\/10.1007\/BF01294132","journal-title":"Algorithmica"},{"key":"10258_CR9","doi-asserted-by":"publisher","unstructured":"Charalampopoulos, P., Kociumaka, T., Pissis, S.P., Radoszewski, J.: Faster algorithms for longest common substring. In: Petra Mutzel, Rasmus Pagh, and Grzegorz Herman, editors, 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference), volume 204 of LIPIcs, pages 30:1\u201330:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPICS.ESA.2021.30","DOI":"10.4230\/LIPICS.ESA.2021.30"},{"key":"10258_CR10","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, pages 978\u2013989. IEEE (2020). Full version: arXiv:2004.08350v2https:\/\/doi.org\/10.1109\/FOCS46700.2020.00095","DOI":"10.1109\/FOCS46700.2020.00095"},{"key":"10258_CR11","doi-asserted-by":"publisher","unstructured":"Charalampopoulos, P., Mohamed, M., Radoszewski, J., Rytter, W., Wale\u0144, T., Zuba, W.: Counting distinct square substrings in sublinear time. In: Pawe\u0142 Gawrychowski, Filip Mazowiecki, and Micha\u0142 Skrzypczak, editors, 50th International Symposium on Mathematical Foundations of Computer Science, MFCS 2025, volume 345 of Leibniz International Proceedings in Informatics (LIPIcs), pages 36:1\u201336:19, Dagstuhl, Germany, 2025. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik. https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2025.36","DOI":"10.4230\/LIPIcs.MFCS.2025.36"},{"key":"10258_CR12","doi-asserted-by":"publisher","unstructured":"Charalampopoulos, P., Pissis, S.P., Radoszewski, J.: Longest palindromic substring in sublinear time. In: Hideo Bannai and Jan Holub, editors, 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic, volume 223 of LIPIcs, pages 20:1\u201320:9. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPICS.CPM.2022.20","DOI":"10.4230\/LIPICS.CPM.2022.20"},{"key":"10258_CR13","first-page":"211","volume":"129","author":"M Christou","year":"2016","unstructured":"Christou, M., Crochemore, M., Iliopoulos, C.S.: Quasiperiodicities in Fibonacci strings. Ars Comb. 129, 211\u2013225 (2016). arXiv:1201.6162","journal-title":"Ars Comb."},{"key":"10258_CR14","doi-asserted-by":"publisher","unstructured":"Crochemore, M., Iliopoulos, C.S., Kociumaka, T., Kubica, M., Radoszewski, J., Rytter, W., Tyczy\u0144ski, W., Wale\u0144, T.: The maximum number of squares in a tree. In: Juha K\u00e4rkk\u00e4inen and Jens Stoye, editors, Combinatorial Pattern Matching - 23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012. Proceedings, volume 7354 of Lecture Notes in Computer Science, pages 27\u201340. Springer, (2012). https:\/\/doi.org\/10.1007\/978-3-642-31265-6_3","DOI":"10.1007\/978-3-642-31265-6_3"},{"key":"10258_CR15","doi-asserted-by":"publisher","unstructured":"Crochemore, M., Iliopoulos, C.S., Pissis, S.P., Tischler, G.: Cover array string reconstruction. In: Amihood Amir and Laxmi Parida, editors, Combinatorial Pattern Matching, 21st Annual Symposium, CPM 2010, New York, NY, USA, June 21-23, 2010. Proceedings, volume 6129 of Lecture Notes in Computer Science, pages 251\u2013259. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-13509-5_23","DOI":"10.1007\/978-3-642-13509-5_23"},{"key":"10258_CR16","doi-asserted-by":"publisher","unstructured":"Crochemore, M., Iliopoulos, C.S., Radoszewski, J., Rytter, W., Straszy\u0144ski, J., Wale\u0144, T., Zuba, W.: Internal quasiperiod queries. In: Christina Boucher and Sharma\u00a0V. Thankachan, editors, String Processing and Information Retrieval - 27th International Symposium, SPIRE 2020, Orlando, FL, USA, October 13-15, 2020, Proceedings, volume 12303 of Lecture Notes in Computer Science, pages 60\u201375. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-59212-7_5","DOI":"10.1007\/978-3-030-59212-7_5"},{"key":"10258_CR17","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/J.TCS.2021.03.011","volume":"866","author":"M Crochemore","year":"2021","unstructured":"Crochemore, M., Iliopoulos, C.S., Radoszewski, J., Rytter, W., Straszy\u0144ski, J., Wale\u0144, T., Zuba, W.: Shortest covers of all cyclic shifts of a string. Theor. Comput. Sci. 866, 70\u201381 (2021). https:\/\/doi.org\/10.1016\/J.TCS.2021.03.011","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"10258_CR18","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/BF01190846","volume":"13","author":"M Crochemore","year":"1995","unstructured":"Crochemore, M., Rytter, W.: Squares, cubes, and time-space efficient string searching. Algorithmica 13(5), 405\u2013425 (1995). https:\/\/doi.org\/10.1007\/BF01190846","journal-title":"Algorithmica"},{"key":"10258_CR19","unstructured":"de\u00a0Bruijn, N.G.: A combinatorial problem. Indagationes Math. 8, 461\u2013467 (1946). http:\/\/www.dwc.knaw.nl\/DL\/publications\/PU00018235.pdf"},{"key":"10258_CR20","doi-asserted-by":"publisher","unstructured":"Duyster, A., Kociumaka, T.: Logarithmic-time internal pattern matching queries in compressed and dynamic texts. In: Zsuzsanna Lipt\u00e1k, Edleno\u00a0Silva de\u00a0Moura, Karina Figueroa, and Ricardo Baeza-Yates, editors, String Processing and Information Retrieval - 31st International Symposium, SPIRE 2024, Puerto Vallarta, Mexico, September 23-25, 2024, Proceedings, volume 14899 of Lecture Notes in Computer Science, pages 102\u2013117. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-72200-4_8","DOI":"10.1007\/978-3-031-72200-4_8"},{"key":"10258_CR21","doi-asserted-by":"publisher","unstructured":"Farach, M.: Optimal suffix tree construction with large alphabets. In: 38th Annual Symposium on Foundations of Computer Science, FOCS 1997, Miami Beach, Florida, USA, October 19-22, 1997, pages 137\u2013143. IEEE Computer Society (1997). https:\/\/doi.org\/10.1109\/SFCS.1997.646102","DOI":"10.1109\/SFCS.1997.646102"},{"issue":"1","key":"10258_CR22","doi-asserted-by":"publisher","first-page":"109","DOI":"10.2307\/2034009","volume":"16","author":"NJ Fine","year":"1965","unstructured":"Fine, N.J., Wilf, H.S.: Uniqueness theorems for periodic functions. Proceed. Am. Math. Soc. 16(1), 109\u2013114 (1965). https:\/\/doi.org\/10.2307\/2034009","journal-title":"Proceed. Am. Math. Soc."},{"key":"10258_CR23","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/J.TCS.2013.08.013","volume":"506","author":"T Flouri","year":"2013","unstructured":"Flouri, T., Iliopoulos, C.S., Kociumaka, T., Pissis, S.P., Puglisi, S.J., Smyth, W.F., Tyczy\u0144ski, W.: Enhanced string covering. Theor. Comput. Sci. 506, 102\u2013114 (2013). https:\/\/doi.org\/10.1016\/J.TCS.2013.08.013","journal-title":"Theor. Comput. Sci."},{"key":"10258_CR24","doi-asserted-by":"publisher","unstructured":"Ganardi, M., Je\u017c, A., Lohrey, M.: Balancing straight-line programs. J. ACM 68(4), 27:1\u201327:40 (2021). https:\/\/doi.org\/10.1145\/3457389","DOI":"10.1145\/3457389"},{"key":"10258_CR25","doi-asserted-by":"publisher","unstructured":"Gawrychowski, P., Karczmarz, A., Kociumaka, T., \u0141\u0105cki, J., Sankowski, P.: Optimal dynamic strings. In: Artur Czumaj, editor, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018, pages 1509\u20131528. SIAM (2018). https:\/\/doi.org\/10.1137\/1.9781611975031.99","DOI":"10.1137\/1.9781611975031.99"},{"issue":"1","key":"10258_CR26","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S1570-8667(03)00010-8","volume":"1","author":"R Hariharan","year":"2003","unstructured":"Hariharan, R., Vinay, V.: String matching in \u00d5(sqrt(n)+sqrt(m)) quantum time. J. Discrete Algorithms 1(1), 103\u2013110 (2003). https:\/\/doi.org\/10.1016\/S1570-8667(03)00010-8","journal-title":"J. Discrete Algorithms"},{"key":"10258_CR27","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/J.IC.2014.09.009","volume":"240","author":"I Tomohiro","year":"2015","unstructured":"Tomohiro, I., Matsubara, W., Shimohira, K., Inenaga, S., Bannai, H., Takeda, M., Narisawa, K., Shinohara, A.: Detecting regularities on grammar-compressed strings. Inf. Comput. 240, 74\u201389 (2015). https:\/\/doi.org\/10.1016\/J.IC.2014.09.009","journal-title":"Inf. Comput."},{"key":"10258_CR28","doi-asserted-by":"publisher","unstructured":"Jin, C., Nogler, J.: Quantum speed-ups for string synchronizing sets, longest common substring, and k-mismatch matching. In: Nikhil Bansal and Viswanath Nagarajan, editors, Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pages 5090\u20135121. SIAM (2023). https:\/\/doi.org\/10.1137\/1.9781611977554.CH186","DOI":"10.1137\/1.9781611977554.CH186"},{"key":"10258_CR29","doi-asserted-by":"publisher","unstructured":"Kempa, D., Kociumaka, T.: String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure. In: Moses Charikar and Edith Cohen, editors, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019, pages 756\u2013767. ACM (2019). https:\/\/doi.org\/10.1145\/3313276.3316368","DOI":"10.1145\/3313276.3316368"},{"key":"10258_CR30","doi-asserted-by":"publisher","unstructured":"Kempa, D., Kociumaka, T.: Dynamic suffix array with polylogarithmic queries and updates. In: Stefano Leonardi and Anupam Gupta, editors, STOC 2022: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022, pages 1657\u20131670. ACM (2022). https:\/\/doi.org\/10.1145\/3519935.3520061","DOI":"10.1145\/3519935.3520061"},{"issue":"2","key":"10258_CR31","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"DE Knuth","year":"1977","unstructured":"Knuth, D.E., Morris, J.H., Jr., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323\u2013350 (1977). https:\/\/doi.org\/10.1137\/0206024","journal-title":"SIAM J. Comput."},{"key":"10258_CR32","doi-asserted-by":"publisher","unstructured":"Kociumaka, T., Kubica, M., Radoszewski, J., Rytter, W., Wale\u0144, T.: A linear-time algorithm for seeds computation. ACM Trans. Algorithms 16(2), 27:1\u201327:23 (2020). https:\/\/doi.org\/10.1145\/3386369","DOI":"10.1145\/3386369"},{"issue":"5","key":"10258_CR33","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., Walen, 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."},{"key":"10258_CR34","doi-asserted-by":"publisher","unstructured":"Mitani, K., Mieno, T., Seto, K., Horiyama, T.: Shortest cover after edit. In: Shunsuke Inenaga and Simon\u00a0J. Puglisi, editors, 35th Annual Symposium on Combinatorial Pattern Matching, CPM 2024, June 25-27, 2024, Fukuoka, Japan, volume 296 of LIPIcs, pages 24:1\u201324:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024). https:\/\/doi.org\/10.4230\/LIPICS.CPM.2024.24","DOI":"10.4230\/LIPICS.CPM.2024.24"},{"issue":"2","key":"10258_CR35","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0020-0190(94)00235-Q","volume":"54","author":"D Moore","year":"1995","unstructured":"Moore, D., Smyth, W.F.: A correction to \u201cAn optimal algorithm to compute all the covers of a string\u2019\u2019. Inf. Process. Lett. 54(2), 101\u2013103 (1995). https:\/\/doi.org\/10.1016\/0020-0190(94)00235-Q","journal-title":"Inf. Process. Lett."},{"key":"10258_CR36","doi-asserted-by":"publisher","unstructured":"Munro, J.I., Navarro, G., Nekrich, Y.: Text indexing and searching in sublinear time. In: Inge\u00a0Li G\u00f8rtz and Oren Weimann, editors, 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark, volume 161 of LIPIcs, pages 24:1\u201324:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPICS.CPM.2020.24","DOI":"10.4230\/LIPICS.CPM.2020.24"},{"key":"10258_CR37","doi-asserted-by":"publisher","unstructured":"Plandowski, W., Rytter, W.: Application of Lempel-Ziv encodings to the solution of words equations. In: Kim\u00a0Guldstrand Larsen, Sven Skyum, and Glynn Winskel, editors, Automata, Languages and Programming, 25th International Colloquium, ICALP\u201998, Aalborg, Denmark, July 13-17, 1998, Proceedings, volume 1443 of Lecture Notes in Computer Science, pages 731\u2013742. Springer (1998). https:\/\/doi.org\/10.1007\/BFB0055097","DOI":"10.1007\/BFB0055097"},{"key":"10258_CR38","doi-asserted-by":"publisher","unstructured":"Radoszewski, J.: Linear time construction of cover suffix tree and applications. In: Inge\u00a0Li G\u00f8rtz, Martin Farach-Colton, Simon\u00a0J. Puglisi, and Grzegorz Herman, editors, 31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands, volume 274 of LIPIcs, pages 89:1\u201389:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPICS.ESA.2023.89","DOI":"10.4230\/LIPICS.ESA.2023.89"},{"key":"10258_CR39","doi-asserted-by":"publisher","unstructured":"Radoszewski, J., Zuba, W.: Computing string covers in sublinear time. In: Zsuzsanna Lipt\u00e1k, Edleno\u00a0Silva de\u00a0Moura, Karina Figueroa, and Ricardo Baeza-Yates, editors, String Processing and Information Retrieval - 31st International Symposium, SPIRE 2024, Puerto Vallarta, Mexico, September 23-25, 2024, Proceedings, volume 14899 of Lecture Notes in Computer Science, pages 272\u2013288. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-72200-4_21","DOI":"10.1007\/978-3-031-72200-4_21"},{"key":"10258_CR40","unstructured":"Singh, M.: Quasiperiodicity in Tribonacci Word. Preprint (2020). https:\/\/hal.science\/hal-02141636"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-025-10258-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-025-10258-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-025-10258-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T08:42:18Z","timestamp":1776760938000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-025-10258-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,7]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["10258"],"URL":"https:\/\/doi.org\/10.1007\/s00224-025-10258-3","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,7]]},"assertion":[{"value":"7 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2026","order":3,"name":"first_online","label":"First Online","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":"6"}}