{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T23:05:30Z","timestamp":1754262330996,"version":"3.40.5"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:00:00Z","timestamp":1740096000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:00:00Z","timestamp":1740096000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100010661","name":"Horizon 2020 Framework Programme","doi-asserted-by":"publisher","award":["956229","956229"],"award-info":[{"award-number":["956229","956229"]}],"id":[{"id":"10.13039\/100010661","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003246","name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["NETWORKS-024.002.003"],"award-info":[{"award-number":["NETWORKS-024.002.003"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1007\/s00453-025-01295-y","type":"journal-article","created":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T05:13:44Z","timestamp":1740114824000},"page":"690-711","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Convergence of the Number of Period sets in Strings"],"prefix":"10.1007","volume":"87","author":[{"given":"Eric","family":"Rivals","sequence":"first","affiliation":[]},{"given":"Michelle","family":"Sweering","sequence":"additional","affiliation":[]},{"given":"Pengfei","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,21]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Rivals, E., Sweering, M., Wang, P.: Convergence of the Number of Period Sets in Strings. In: Etessami, K., Feige, U., Puppis, G. (eds.) 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), 261. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2023). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2023.100 . 100:1\u2013100:14","key":"1295_CR1","DOI":"10.4230\/LIPIcs.ICALP.2023.100"},{"volume-title":"Combinatorics on Words, 2nd end","year":"1997","unstructured":"Lothaire, M. (ed.): Combinatorics on Words, 2nd end. Cambridge University Press, New York (1997)","key":"1295_CR2"},{"key":"1295_CR3","volume-title":"Algebraic Combinatorics on Words","author":"M Lothaire","year":"2005","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2005)"},{"key":"1295_CR4","volume-title":"Computing Pattern in Strings","author":"WF Smyth","year":"2003","unstructured":"Smyth, W.F.: Computing Pattern in Strings. Pearson-Addison Wesley, Boston (2003)"},{"key":"1295_CR5","volume-title":"DNA, Words and Models","author":"S Robin","year":"2005","unstructured":"Robin, S., Rodolphe, F., Schbath, S.: DNA, Words and Models. Cambridge University Press, New York (2005)"},{"key":"1295_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/s0963548302005473","author":"S Rahmann","year":"2003","unstructured":"Rahmann, S., Rivals, E.: On the distribution of the number of missing words in random texts. Comb. Probab. Comput. (2003). https:\/\/doi.org\/10.1017\/s0963548302005473","journal-title":"Comb. Probab. Comput."},{"issue":"2","key":"1295_CR7","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1145\/210330.210331","volume":"5","author":"OE Percus","year":"1995","unstructured":"Percus, O.E., Whitlock, P.A.: Theory and application of Marsaglia\u2019s monkey test for pseudorandom number generators. ACM Trans. Model. Comput. Simul. 5(2), 87\u2013100 (1995). https:\/\/doi.org\/10.1145\/210330.210331","journal-title":"ACM Trans. Model. Comput. Simul."},{"key":"1295_CR8","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0097-3165(81)90038-8","volume":"30","author":"LJ Guibas","year":"1981","unstructured":"Guibas, L.J., Odlyzko, A.M.: Periods in strings. J. Comb. Theory Ser. A 30, 19\u201342 (1981). https:\/\/doi.org\/10.1016\/0097-3165(81)90038-8","journal-title":"J. Comb. Theory Ser. A"},{"issue":"1","key":"1295_CR9","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/s0097-3165(03)00123-7","volume":"104","author":"E Rivals","year":"2003","unstructured":"Rivals, E., Rahmann, S.: Combinatorics of periods in strings. J. Combin. Theory Ser. A 104(1), 95\u2013113 (2003). https:\/\/doi.org\/10.1016\/s0097-3165(03)00123-7","journal-title":"J. Combin. Theory Ser. A"},{"doi-asserted-by":"publisher","unstructured":"Rivals, E., Rahmann, S.: Combinatorics of Periods in Strings. In: Orejas, F., Spirakis, P., van Leuween, J. (eds.) ICALP 2001, Proc. of the 28th International Colloquium on Automata, Languages and Programming, (ICALP), July 8-12, 2001. Lecture Notes in Computer Science, 2076, 615\u2013626. Springer, Hersonissos, Creta, Greece (2001). https:\/\/doi.org\/10.1007\/3-540-48224-5_51","key":"1295_CR10","DOI":"10.1007\/3-540-48224-5_51"},{"doi-asserted-by":"publisher","unstructured":"Holub, S., Shallit, J.O.: Periods and borders of random words. In: Ollinger, N., Vollmer, H. (eds.) STACS 2016, Proc. of the 33rd Symposium on Theoretical Aspects of Computer Science, (STACS), February 17-20, 2016. LIPIcs, 44, 1\u201310. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Orl\u00e9ans, France (2016). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2016.44","key":"1295_CR11","DOI":"10.4230\/LIPIcs.STACS.2016.44"},{"issue":"05","key":"1295_CR12","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1142\/s0129054121410094","volume":"32","author":"D Gabric","year":"2021","unstructured":"Gabric, D., Rampersad, N., Shallit, J.: An inequality for the number of periods in a word. Int. J. Found. Comput. Sci. 32(05), 597\u2013614 (2021). https:\/\/doi.org\/10.1142\/s0129054121410094","journal-title":"Int. J. Found. Comput. Sci."},{"doi-asserted-by":"publisher","unstructured":"Blanchet-Sadri, F., Gafni, J.D., Wilson, K.H.: Correlations of partial words. In: Thomas, W., Weil, P. (eds.) STACS 2007, Proc. of the 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007. Lecture Notes in Computer Science, 4393, 97\u2013108. Springer, Aachen, Germany (2007). https:\/\/doi.org\/10.1007\/978-3-540-70918-3_9","key":"1295_CR13","DOI":"10.1007\/978-3-540-70918-3_9"},{"issue":"2","key":"1295_CR14","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.jcta.2004.09.002","volume":"109","author":"F Blanchet-Sadri","year":"2005","unstructured":"Blanchet-Sadri, F., Duncan, S.: Partial words and the critical factorization theorem. J. Combin. Theory Ser. A 109(2), 221\u2013245 (2005). https:\/\/doi.org\/10.1016\/j.jcta.2004.09.002","journal-title":"J. Combin. Theory Ser. A"},{"issue":"6","key":"1295_CR15","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1016\/j.jcta.2010.03.001","volume":"117","author":"F Blanchet-Sadri","year":"2010","unstructured":"Blanchet-Sadri, F., Fowler, J., Gafni, J.D., Wilson, K.H.: Combinatorics on partial word correlations. J. Combin. Theory Ser. A 117(6), 607\u2013624 (2010). https:\/\/doi.org\/10.1016\/j.jcta.2010.03.001","journal-title":"J. Combin. Theory Ser. A"},{"issue":"10","key":"1295_CR16","doi-asserted-by":"publisher","first-page":"6888","DOI":"10.1109\/TIT.2022.3167935","volume":"68","author":"D Gabric","year":"2022","unstructured":"Gabric, D.: Mutual borders and overlaps. IEEE Trans. Inf. Theory 68(10), 6888\u20136893 (2022). https:\/\/doi.org\/10.1109\/TIT.2022.3167935","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"1295_CR17","doi-asserted-by":"publisher","first-page":"4058","DOI":"10.1109\/TIT.2012.2189479","volume":"58","author":"S Bilotta","year":"2012","unstructured":"Bilotta, S., Pergola, E., Pinzani, R.: A new approach to cross-bifix-free sets. IEEE Trans. Inf. Theory 58(6), 4058\u20134063 (2012). https:\/\/doi.org\/10.1109\/TIT.2012.2189479","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"1295_CR18","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s12095-013-0088-8","volume":"6","author":"D Bajic","year":"2014","unstructured":"Bajic, D., Loncar-Turukalo, T.: A simple suboptimal construction of cross-bifix-free codes. Cryptogr. Commun. 6(6), 27\u201337 (2014). https:\/\/doi.org\/10.1007\/s12095-013-0088-8","journal-title":"Cryptogr. Commun."},{"issue":"10","key":"1295_CR19","doi-asserted-by":"publisher","first-page":"6530","DOI":"10.1109\/TIT.2017.2742506","volume":"63","author":"S Bilotta","year":"2017","unstructured":"Bilotta, S.: Variable-length non-overlapping codes. IEEE Trans. Inf. Theory 63(10), 6530\u20136537 (2017). https:\/\/doi.org\/10.1109\/TIT.2017.2742506","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1295_CR20","doi-asserted-by":"publisher","first-page":"4890","DOI":"10.1109\/TIT.2015.2456634","volume":"61","author":"SR Blackburn","year":"2015","unstructured":"Blackburn, S.R.: Non-overlapping codes. IEEE Trans. Inf. Theory 61, 4890\u20134894 (2015). https:\/\/doi.org\/10.1109\/TIT.2015.2456634","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1295_CR21","first-page":"355","volume":"6","author":"VI Levenshtein","year":"1970","unstructured":"Levenshtein, V.I.: Maximum number of words in codes without overlaps. Probl. Inf. Transm. 6(4), 355\u2013357 (1970)","journal-title":"Probl. Inf. Transm."},{"issue":"5","key":"1295_CR22","doi-asserted-by":"publisher","first-page":"1299","DOI":"10.1007\/s10623-023-01344-z","volume":"92","author":"L Stanovnik","year":"2024","unstructured":"Stanovnik, L., Mo\u0161kon, M., Mraz, M.: In search of maximum non-overlapping codes. Des. Codes Crypt. 92(5), 1299\u20131326 (2024). https:\/\/doi.org\/10.1007\/s10623-023-01344-z","journal-title":"Des. Codes Crypt."},{"issue":"9","key":"1295_CR23","doi-asserted-by":"publisher","first-page":"6283","DOI":"10.1109\/TIT.2018.2792488","volume":"64","author":"SMHT Yazdi","year":"2018","unstructured":"Yazdi, S.M.H.T., Kiah, H.M., Gabrys, R., Milenkovic, O.: Mutually uncorrelated primers for dna-based data storage. IEEE Trans. Inf. Theory 64(9), 6283\u20136296 (2018). https:\/\/doi.org\/10.1109\/TIT.2018.2792488","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1295_CR24","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1090\/S0002-9939-1965-0174934-9","volume":"16","author":"NJ Fine","year":"1965","unstructured":"Fine, N.J., Wilf, H.S.: Uniqueness theorems for periodic functions. Proc. Am. Math. Soc. 16(1), 109\u2013114 (1965). https:\/\/doi.org\/10.1090\/S0002-9939-1965-0174934-9","journal-title":"Proc. Am. Math. Soc."},{"issue":"2","key":"1295_CR25","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1006\/jcta.1999.3014","volume":"89","author":"V Halava","year":"2000","unstructured":"Halava, V., Harju, T., Ilie, L.: Periods and binary words. J. Combin. Theory Ser. A 89(2), 298\u2013303 (2000). https:\/\/doi.org\/10.1006\/jcta.1999.3014","journal-title":"J. Combin. Theory Ser. A"},{"unstructured":"Sloane, N.J.A.: The On-Line Encyclopedia of Integer Sequences (2022). https:\/\/oeis.org","key":"1295_CR26"},{"issue":"2","key":"1295_CR27","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0097-3165(81)90005-4","volume":"30","author":"LJ Guibas","year":"1981","unstructured":"Guibas, L.J., Odlyzko, A.M.: String overlaps, pattern matching, and nontransitive games. J. Combin. Theory Ser. A 30(2), 183\u2013208 (1981). https:\/\/doi.org\/10.1016\/0097-3165(81)90005-4","journal-title":"J. Combin. Theory Ser. A"},{"doi-asserted-by":"publisher","unstructured":"Rivals, E.: Incremental computation of the set of period sets. In: Kr\u00e1lovi\u010d, R., K\u016frkov\u00e1, V. (eds.) SOFSEM 2025: Theory and Practice of Computer Science. SOFSEM 2025. Lecture Notes in Computer Science, vol 15539. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-82697-9_19","key":"1295_CR28","DOI":"10.1007\/978-3-031-82697-9_19"},{"issue":"5","key":"1295_CR29","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1109\/TIT.1973.1055065","volume":"19","author":"P Nielsen","year":"1973","unstructured":"Nielsen, P.: A note on bifix-free sequences (Corresp.). IEEE Trans. Inf. Theory 19(5), 704\u2013706 (1973). https:\/\/doi.org\/10.1109\/TIT.1973.1055065","journal-title":"IEEE Trans. Inf. Theory"},{"unstructured":"Rivals, E., Wang, P.: Counting overlapping pairs of strings. ArXiv arXiv:2405.09393 (2024)","key":"1295_CR30"},{"issue":"5","key":"1295_CR31","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1017\/S0963548399003806","volume":"8","author":"I Cakir","year":"1999","unstructured":"Cakir, I., Chryssaphinou, O., M\u00e5nsson, M.: On A conjecture by Eriksson concerning overlap in strings. Comb. Probab. Comput. 8(5), 429\u2013440 (1999). https:\/\/doi.org\/10.1017\/S0963548399003806","journal-title":"Comb. Probab. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-025-01295-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-025-01295-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-025-01295-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T11:01:18Z","timestamp":1746702078000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-025-01295-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,21]]},"references-count":31,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["1295"],"URL":"https:\/\/doi.org\/10.1007\/s00453-025-01295-y","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2025,2,21]]},"assertion":[{"value":"24 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 February 2025","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 Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}