{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:44:42Z","timestamp":1743029082902,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642250101"},{"type":"electronic","value":"9783642250118"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25011-8_5","type":"book-chapter","created":{"date-parts":[[2011,11,8]],"date-time":"2011-11-08T20:27:34Z","timestamp":1320784054000},"page":"57-70","source":"Crossref","is-referenced-by-count":0,"title":["Periods in Partial Words: An Algorithm"],"prefix":"10.1007","author":[{"given":"Francine","family":"Blanchet-Sadri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Travis","family":"Mandel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gautam","family":"Sisodia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-642-59136-5_6","volume-title":"Handbook of Formal Languages","author":"C. Choffrut","year":"1997","unstructured":"Choffrut, C., Karhum\u00e4ki, J.: Combinatorics of Words. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a01, pp. 329\u2013438. Springer, Berlin (1997)"},{"key":"5_CR2","unstructured":"Smyth, W.F.: Computing Patterns in Strings. Pearson, Addison-Wesley (2003)"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1090\/S0002-9939-1965-0174934-9","volume":"16","author":"N.J. Fine","year":"1965","unstructured":"Fine, N.J., Wilf, H.S.: Uniqueness theorems for periodic functions. Proceedings of the American Mathematical Society\u00a016, 109\u2013114 (1965)","journal-title":"Proceedings of the American Mathematical Society"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.tcs.2005.01.007","volume":"339","author":"S. Constantinescu","year":"2005","unstructured":"Constantinescu, S., Ilie, L.: Generalised Fine and Wilf\u2019s theorem for arbitrary number of periods. Theoretical Computer Science\u00a0339, 49\u201360 (2005)","journal-title":"Theoretical Computer Science"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(98)00255-2","volume":"218","author":"J. Berstel","year":"1999","unstructured":"Berstel, J., Boasson, L.: Partial words and a theorem of Fine and Wilf. Theoretical Computer Science\u00a0218, 135\u2013141 (1999)","journal-title":"Theoretical Computer Science"},{"key":"5_CR6","volume-title":"Algorithmic Combinatorics on Partial Words","author":"F. Blanchet-Sadri","year":"2008","unstructured":"Blanchet-Sadri, F.: Algorithmic Combinatorics on Partial Words. Chapman & Hall\/CRC Press, Boca Raton, FL (2008)"},{"issue":"5","key":"5_CR7","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1016\/j.ic.2007.11.007","volume":"206","author":"F. Blanchet-Sadri","year":"2008","unstructured":"Blanchet-Sadri, F., Bal, D., Sisodia, G.: Graph connectivity, partial words, and a theorem of Fine and Wilf. Information and Computation\u00a0206(5), 676\u2013693 (2008)","journal-title":"Information and Computation"},{"key":"5_CR8","first-page":"87","volume":"10","author":"V. Halava","year":"2008","unstructured":"Halava, V., Harju, T., K\u00e4rki, T.: Interaction properties of relational periods. Discrete Mathematics and Theoretetical Computer Science\u00a010, 87\u2013112 (2008)","journal-title":"Discrete Mathematics and Theoretetical Computer Science"},{"issue":"2","key":"5_CR9","doi-asserted-by":"publisher","first-page":"191","DOI":"10.4213\/im480","volume":"68","author":"A.M. Shur","year":"2004","unstructured":"Shur, A.M., Gamzova, Y.V.: Partial words and the interaction property of periods. Izvestiya Rossiiskoi Akademii Nauk. Seriya Matematicheskaya\u00a068(2), 191\u2013214 (2004)","journal-title":"Izvestiya Rossiiskoi Akademii Nauk. Seriya Matematicheskaya"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/3-540-44683-4_57","volume-title":"Mathematical Foundations of Computer Science 2001","author":"A.M. Shur","year":"2001","unstructured":"Shur, A.M., Konovalova, Y.V.: On the Periods of Partial Words. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol.\u00a02136, pp. 657\u2013665. Springer, Heidelberg (2001)"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"4295","DOI":"10.1016\/j.tcs.2009.07.010","volume":"410","author":"W.F. Smyth","year":"2009","unstructured":"Smyth, W.F., Wang, S.: A new approach to the periodicity lemma on strings with holes. Theoretical Computer Science\u00a0410, 4295\u20134302 (2009)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25011-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T01:24:07Z","timestamp":1555377847000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25011-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642250101","9783642250118"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25011-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}