{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T22:55:43Z","timestamp":1754261743167},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422877"},{"type":"electronic","value":"9783540482246"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_51","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T06:29:04Z","timestamp":1193552944000},"page":"615-626","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Combinatorics of Periods in Strings"],"prefix":"10.1007","author":[{"given":"Eric","family":"Rivals","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"Rahmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"51_CR1","doi-asserted-by":"crossref","unstructured":"C. Choffrut and J. Karhum\u00e4ki. Combinatorics of words. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 1, pages 329\u2013438. Springer-Verlag, 1997.","DOI":"10.1007\/978-3-642-59136-5_6"},{"key":"51_CR2","unstructured":"M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, 1994."},{"key":"51_CR3","first-page":"659","volume":"51","author":"N. G. DeBruijn","year":"1948","unstructured":"N. G. DeBruijn. On Mahler\u2019s partition problem. Proc. Akad. Wet. Amsterdam, 51:659\u2013669, 1948.","journal-title":"Proc. Akad. Wet. Amsterdam"},{"key":"51_CR4","doi-asserted-by":"publisher","first-page":"109","DOI":"10.2307\/2034009","volume":"16","author":"N. J. Fine","year":"1965","unstructured":"N. J. Fine and H. S. Wilf. Uniqueness theorems for periodic functions. Proc. Amer. Math. Soc., 16:109\u2013114, 1965.","journal-title":"Proc. Amer. Math. Soc."},{"key":"51_CR5","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/BF01933448","volume":"17","author":"C.-E. Fr\u00f6berg","year":"1977","unstructured":"C.-E. Fr\u00f6berg. Accurate estimation of the number of binary partitions. BIT, 17:386\u2013391, 1977.","journal-title":"BIT"},{"issue":"A","key":"51_CR6","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0097-3165(81)90038-8","volume":"30","author":"L. J. Guibas","year":"1981","unstructured":"L. J. Guibas and A. M. Odlyzko. Periods in strings. Journal of Combinatorial Theory, Series A, 30:19\u201342, 1981.","journal-title":"Journal of Combinatorial Theory"},{"key":"51_CR7","unstructured":"M. Lothaire. Algebraic Combinatorics on Words. in preparation, 1999. URL: \n                    http:\/\/www-igm.univ-mlv.fr\/~berstel\/Lothaire\/index.html\n                    \n                  ."},{"key":"51_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/3-540-45123-4_31","volume-title":"Proc. of the 11th Symposium on Combinatorial Pattern Matching","author":"S. Rahmann","year":"2000","unstructured":"S. Rahmann and E. Rivals. Exact and Efficient Computation of the Expected Number of Missing and Common Words in Random Texts. In R. Giancarlo and D. Sankoff, editors, Proc. of the 11th Symposium on Combinatorial Pattern Matching, number 1848 in LNCS, pages 375\u2013387, Montr\u00e9al, Canada, 2000. Springer-Verlag, Berlin."},{"key":"51_CR9","volume-title":"Analysis of Algorithms","author":"R. Sedgewick","year":"1996","unstructured":"R. Sedgewick and P. Flajolet. Analysis of Algorithms. Addison-Wesley, Reading, MA, 1996."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48224-5_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T14:47:05Z","timestamp":1558277225000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_51","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"4 July 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}