{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:27:13Z","timestamp":1758587233705,"version":"3.44.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032052278"},{"type":"electronic","value":"9783032052285"}],"license":[{"start":{"date-parts":[[2025,9,22]],"date-time":"2025-09-22T00:00:00Z","timestamp":1758499200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,22]],"date-time":"2025-09-22T00:00:00Z","timestamp":1758499200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-05228-5_1","type":"book-chapter","created":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T17:00:42Z","timestamp":1758474042000},"page":"1-9","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Testing Quasiperiodicity"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-3550-1727","authenticated-orcid":false,"given":"Christine","family":"Awofeso","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-1054-8444","authenticated-orcid":false,"given":"Ben","family":"Bals","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5406-8121","authenticated-orcid":false,"given":"Oded","family":"Lachish","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1445-1932","authenticated-orcid":false,"given":"Solon P.","family":"Pissis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,9,22]]},"reference":[{"issue":"2","key":"1_CR1","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0304-3975(93)90159-Q","volume":"119","author":"A Apostolico","year":"1993","unstructured":"Apostolico, A., Ehrenfeucht, A.: Efficient detection of quasiperiodicities in strings. Theor. Comput. Sci. 119(2), 247\u2013265 (1993). https:\/\/doi.org\/10.1016\/0304-3975(93)90159-Q","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"1_CR2","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":"1_CR3","doi-asserted-by":"publisher","unstructured":"Bender, M.A., Conway, A., Farach-Colton, M., Kuszmaul, W., Tagliavini, G.: Iceberg hashing: optimizing many hash-table criteria at once. J. ACM 70(6), 40:1\u201340:51 (2023). https:\/\/doi.org\/10.1145\/3625817, https:\/\/doi.org\/10.1145\/3625817","DOI":"10.1145\/3625817"},{"issue":"6","key":"1_CR4","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."},{"key":"1_CR5","doi-asserted-by":"publisher","unstructured":"Czajka, P., Radoszewski, J.: Experimental evaluation of algorithms for computing quasiperiods. Theor. Comput. Sci. 854, 17\u201329 (2021). https:\/\/doi.org\/10.1016\/J.TCS.2020.11.033, https:\/\/doi.org\/10.1016\/j.tcs.2020.11.033","DOI":"10.1016\/J.TCS.2020.11.033"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4064\/aa-21-1-399-408","volume":"21","author":"P Erd\u0151s","year":"1972","unstructured":"Erd\u0151s, P., Graham, R.: On a linear Diophantine problem of Frobenius. Acta Arith 21, 399\u2013408 (1972)","journal-title":"Acta Arith"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Farach, M.: Optimal suffix tree construction with large alphabets. In: 38th Annual Symposium on Foundations of Computer Science, FOCS \u201997, Miami Beach, Florida, USA, October 19-22, 1997, pp. 137\u2013143. IEEE Computer Society (1997). https:\/\/doi.org\/10.1109\/SFCS.1997.646102, https:\/\/doi.org\/10.1109\/SFCS.1997.646102","DOI":"10.1109\/SFCS.1997.646102"},{"key":"1_CR8","doi-asserted-by":"publisher","unstructured":"Gawrychowski, P., Radoszewski, J., Starikovskaya, T.: Quasi-periodicity in streams. In: Pisanti, N., Pissis, S.P. (eds.) 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy. LIPIcs, vol.\u00a0128, pp. 22:1\u201322:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPICS.CPM.2019.22, https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2019.22","DOI":"10.4230\/LIPICS.CPM.2019.22"},{"key":"1_CR9","unstructured":"Haran, B.: How to order 43 Chicken McNuggets (Frobenius numbers) - Numberphile (2012). https:\/\/www.youtube.com\/watch?v=vNTSugyS038"},{"issue":"3","key":"1_CR10","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/BF01955677","volume":"16","author":"CS Iliopoulos","year":"1996","unstructured":"Iliopoulos, C.S., Moore, D.W.G., Park, K.: Covering a string. Algorithmica 16(3), 288\u2013297 (1996). https:\/\/doi.org\/10.1007\/BF01955677","journal-title":"Algorithmica"},{"key":"1_CR11","doi-asserted-by":"publisher","unstructured":"Knuth, D.E., Jr., J.H.M., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323\u2013350 (1977). https:\/\/doi.org\/10.1137\/0206024, https:\/\/doi.org\/10.1137\/0206024","DOI":"10.1137\/0206024"},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Kociumaka, T., Kubica, M., Radoszewski, J., Rytter, W., Walen, T.: A linear time algorithm for seeds computation. In: Rabani, Y. (ed.) Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012, pp. 1095\u20131112. SIAM (2012). https:\/\/doi.org\/10.1137\/1.9781611973099.86, https:\/\/doi.org\/10.1137\/1.9781611973099.86","DOI":"10.1137\/1.9781611973099.86"},{"key":"1_CR13","doi-asserted-by":"publisher","unstructured":"Kociumaka, T., Kubica, M., Radoszewski, J., Rytter, W., Walen, T.: A linear-time algorithm for seeds computation. ACM Trans. Algorithms 16(2), 27:1\u201327:23 (2020). https:\/\/doi.org\/10.1145\/3386369, https:\/\/doi.org\/10.1145\/3386369","DOI":"10.1145\/3386369"},{"issue":"2","key":"1_CR14","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/S00453-009-9351-Y","volume":"60","author":"O Lachish","year":"2011","unstructured":"Lachish, O., Newman, I.: Testing periodicity. Algorithmica 60(2), 401\u2013420 (2011). https:\/\/doi.org\/10.1007\/S00453-009-9351-Y","journal-title":"Algorithmica"},{"issue":"1","key":"1_CR15","doi-asserted-by":"publisher","first-page":"17","DOI":"10.3233\/FI-222164","volume":"190","author":"N Mhaskar","year":"2022","unstructured":"Mhaskar, N., Smyth, W.F.: Fundam. Info. 190(1), 17\u201345 (2022). https:\/\/doi.org\/10.3233\/FI-222164","journal-title":"Fundam. Info."},{"key":"1_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603","author":"M Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and computing: randomized algorithms and probabilistic analysis. Cambridge University Press (2005). https:\/\/doi.org\/10.1017\/CBO9780511813603","journal-title":"Cambridge University Press"},{"issue":"5","key":"1_CR17","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0020-0190(94)00045-X","volume":"50","author":"DWG Moore","year":"1994","unstructured":"Moore, D.W.G., Smyth, W.F.: An optimal algorithm to compute all the covers of a string. Inf. Process. Lett. 50(5), 239\u2013246 (1994). https:\/\/doi.org\/10.1016\/0020-0190(94)00045-X","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"1_CR18","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0020-0190(94)00235-Q","volume":"54","author":"DWG Moore","year":"1995","unstructured":"Moore, D.W.G., 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":"1_CR19","doi-asserted-by":"publisher","unstructured":"Radoszewski, J.: Linear time construction of cover suffix tree and applications. In: G\u00f8rtz, I.L., Farach-Colton, M., Puglisi, S.J., Herman, G. (eds.) 31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands. LIPIcs, vol.\u00a0274, pp. 89:1\u201389:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPICS.ESA.2023.89, https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2023.89","DOI":"10.4230\/LIPICS.ESA.2023.89"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-05228-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T17:00:43Z","timestamp":1758474043000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-05228-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,22]]},"ISBN":["9783032052278","9783032052285"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-05228-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,9,22]]},"assertion":[{"value":"22 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SPIRE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on String Processing and Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/spire-2025\/home","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}