{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T09:48:38Z","timestamp":1785923318606,"version":"3.56.0"},"publisher-location":"Singapore","reference-count":35,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819502172","type":"print"},{"value":"9789819502189","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T00:00:00Z","timestamp":1754179200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T00:00:00Z","timestamp":1754179200000},"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-981-95-0218-9_28","type":"book-chapter","created":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T21:09:38Z","timestamp":1754168978000},"page":"381-395","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Counting Overlapping Pairs of\u00a0Words"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3791-3973","authenticated-orcid":false,"given":"Eric","family":"Rivals","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8172-5270","authenticated-orcid":false,"given":"Pengfei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,3]]},"reference":[{"issue":"6","key":"28_CR1","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)","journal-title":"Cryptogr. Commun."},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-030-81508-0_4","volume-title":"Developments in Language Theory","author":"E Barcucci","year":"2021","unstructured":"Barcucci, E., Bernini, A., Pinzani, R.: A strong non-overlapping Dyck code. In: Moreira, N., Reis, R. (eds.) DLT 2021. LNCS, vol. 12811, pp. 43\u201353. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81508-0_4"},{"issue":"6","key":"28_CR3","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)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"28_CR4","doi-asserted-by":"publisher","first-page":"2479","DOI":"10.1109\/TIT.2023.3304712","volume":"70","author":"SR Blackburn","year":"2024","unstructured":"Blackburn, S.R., Esfahani, N.N., Kreher, D.L., Stinson, D.R.: Constructions and bounds for codes with restricted overlaps. IEEE Trans. Inf. Theory 70(4), 2479\u20132490 (2024)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"28_CR5","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)","journal-title":"Comb. Probab. Comput."},{"issue":"2","key":"28_CR6","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0012-365X(79)90116-X","volume":"26","author":"A Ehrenfeucht","year":"1979","unstructured":"Ehrenfeucht, A., Silberger, D.: Periodicity and unbordered segments of words. Discret. Math. 26(2), 101\u2013109 (1979)","journal-title":"Discret. Math."},{"issue":"10","key":"28_CR7","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)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Guibas, L.J., Odlyzko, A.M.: Periods in strings. J. Comb. Theory Ser. A 30, 19\u201342 (1981)","DOI":"10.1016\/0097-3165(81)90038-8"},{"issue":"2","key":"28_CR9","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. Comb. Theory Ser. A 30(2), 183\u2013208 (1981)","journal-title":"J. Comb. Theory Ser. A"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511574931"},{"issue":"4","key":"28_CR11","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0020-0190(92)90176-V","volume":"41","author":"D Gusfield","year":"1992","unstructured":"Gusfield, D., Landau, G.M., Schieber, B.: An efficient algorithm for the all pairs suffix-prefix problem. Inf. Proc. Lett. 41(4), 181\u2013185 (1992)","journal-title":"Inf. Proc. Lett."},{"issue":"2","key":"28_CR12","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. Comb. Theory Ser. A 89(2), 298\u2013303 (2000)","journal-title":"J. Comb. Theory Ser. A"},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-24749-4_26","volume-title":"STACS 2004","author":"T Harju","year":"2004","unstructured":"Harju, T., Nowotka, D.: Periodicity and unbordered words. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 294\u2013304. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24749-4_26"},{"issue":"3","key":"28_CR14","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1016\/j.jcta.2011.11.004","volume":"119","author":"S Holub","year":"2012","unstructured":"Holub, S., Nowotka, D.: The Ehrenfeucht-Silberger problem. J. Comb. Theory Ser. A 119(3), 668\u2013682 (2012)","journal-title":"J. Comb. Theory Ser. A"},{"key":"28_CR15","unstructured":"Holub, S., Shallit, J.O.: Periods and borders of random words. In: STACS 2016. LIPIcs, vol.\u00a047, pp. 44:1\u201344:10 (2016)"},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D Knuth","year":"1977","unstructured":"Knuth, D., Morris, J., Pratt, V.: Fast pattern matching in strings. SIAM J. Comput. 6, 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"key":"28_CR17","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.tcs.2017.07.013","volume":"698","author":"J Lim","year":"2017","unstructured":"Lim, J., Park, K.: A fast algorithm for the all-pairs suffix-prefix problem. Theoret. Comput. Sci. 698, 14\u201324 (2017)","journal-title":"Theoret. Comput. Sci."},{"key":"28_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-319-19929-0_29","volume-title":"Combinatorial Pattern Matching","author":"A Loptev","year":"2015","unstructured":"Loptev, A., Kucherov, G., Starikovskaya, T.: On maximal unbordered factors. In: Cicalese, F., Porat, E., Vaccaro, U. (eds.) CPM 2015. LNCS, vol. 9133, pp. 343\u2013354. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19929-0_29"},{"issue":"4","key":"28_CR19","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1137\/1037139","volume":"37","author":"OP Lossers","year":"1995","unstructured":"Lossers, O.P.: Overlapping binary sequences. SIAM Rev. 37(4), 619\u2013620 (1995)","journal-title":"SIAM Rev."},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Lothaire, M. (ed.): Algebraic Combinatorics on Words. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511566097"},{"key":"28_CR21","doi-asserted-by":"crossref","unstructured":"Lothaire, M. (ed.): Combinatorics on Words. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511566097"},{"key":"28_CR22","doi-asserted-by":"crossref","unstructured":"M\u00e4kinen, V., Belazzougui, D., Cunial, F., Tomescu, A.I.: Genome-Scale Algorithm Design. Cambridge University Press (2015)","DOI":"10.1017\/CBO9781139940023"},{"key":"28_CR23","doi-asserted-by":"crossref","unstructured":"Nielsen, P.T.: A note on bifix-free sequences (Corresp.). IEEE Trans. Inf. Theory 19(5), 704\u2013706 (1973)","DOI":"10.1109\/TIT.1973.1055065"},{"key":"28_CR24","doi-asserted-by":"crossref","unstructured":"Nielsen, P.T.: On the expected duration of a search for a fixed pattern in random data (Corresp.). IEEE Trans. Inf. Theory 19(5), 702\u2013704 (1973)","DOI":"10.1109\/TIT.1973.1055064"},{"key":"28_CR25","doi-asserted-by":"crossref","unstructured":"Percus, O.E., Whitlock, P.A.: Theory and application of Marsaglia\u2019s monkey test for pseudorandom number generators. ACM Trans. Model. Comp. Simul. 5(2), 87\u2013100 (1995)","DOI":"10.1145\/210330.210331"},{"key":"28_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/3-540-45123-4_31","volume-title":"Combinatorial Pattern Matching","author":"S Rahmann","year":"2000","unstructured":"Rahmann, S., Rivals, E.: Exact and efficient computation of the expected number of missing and common words in random texts. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol. 1848, pp. 375\u2013387. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45123-4_31"},{"key":"28_CR27","doi-asserted-by":"crossref","unstructured":"Rahmann, S., Rivals, E.: On the distribution of the number of missing words in random texts. Comb. Probab. Comput. 12(01) (2003)","DOI":"10.1017\/S0963548302005473"},{"key":"28_CR28","doi-asserted-by":"crossref","unstructured":"Rivals, E.: Incremental computation of the set of period sets. In: SOFSEM 2025: Theory and Practice of Computer Science. LNCS, vol. 15539, pp. 254\u2013268 (2025)","DOI":"10.1007\/978-3-031-82697-9_19"},{"key":"28_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/3-540-48224-5_51","volume-title":"Automata, Languages and Programming","author":"E Rivals","year":"2001","unstructured":"Rivals, E., Rahmann, S.: Combinatorics of periods in strings. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 615\u2013626. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-48224-5_51"},{"issue":"1","key":"28_CR30","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. Comb. Theory Ser. A 104(1), 95\u2013113 (2003)","journal-title":"J. Comb. Theory Ser. A"},{"key":"28_CR31","unstructured":"Rivals, E., Sweering, M., Wang, P.: Convergence of the number of period sets in strings. In: ICALP 2023. LIPIcs, vol.\u00a0261, pp. 100:1\u2013100:14 (2023)"},{"key":"28_CR32","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1007\/s00453-025-01295-y","volume":"87","author":"E Rivals","year":"2025","unstructured":"Rivals, E., Sweering, M., Wang, P.: Convergence of the number of period sets in strings. Algorithmica 87, 690\u2013711 (2025)","journal-title":"Algorithmica"},{"key":"28_CR33","doi-asserted-by":"publisher","unstructured":"Rivals, E., Wang, P.: Counting overlapping pairs of strings (2024). https:\/\/doi.org\/10.48550\/arXiv.2405.09393. arXiv:2405.09393","DOI":"10.48550\/arXiv.2405.09393"},{"key":"28_CR34","unstructured":"Robin, S., Rodolphe, F., Schbath, S.: DNA. Words and Models. Cambrigde University Press (2005)"},{"key":"28_CR35","unstructured":"Smyth, W.F.: Computating Pattern in Strings. Pearson Addison Wesley (2003)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-0218-9_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T09:38:49Z","timestamp":1785922729000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-0218-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,3]]},"ISBN":["9789819502172","9789819502189"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-0218-9_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,3]]},"assertion":[{"value":"3 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"15 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcsuestc.com\/cocoon2025\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}