{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T11:23:59Z","timestamp":1746703439313},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709176"},{"type":"electronic","value":"9783540709183"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-70918-3_9","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T23:41:23Z","timestamp":1179963683000},"page":"97-108","source":"Crossref","is-referenced-by-count":1,"title":["Correlations of Partial Words"],"prefix":"10.1007","author":[{"given":"Francine","family":"Blanchet-Sadri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joshua D.","family":"Gafni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin H.","family":"Wilson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","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. Theoret. Comput. Sci.\u00a0218, 135\u2013141 (1999)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0898-1221(04)90006-5","volume":"47","author":"F. Blanchet-Sadri","year":"2004","unstructured":"Blanchet-Sadri, F.: Periodicity on Partial Words. Comput. Math. Appl.\u00a047, 71\u201382 (2004)","journal-title":"Comput. Math. Appl."},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.tcs.2003.11.025","volume":"314","author":"F. Blanchet-Sadri","year":"2004","unstructured":"Blanchet-Sadri, F.: Chriscoe, Ajay: Local Periods and Binary Partial Words: An Algorithm. Theoret. Comput. Sci.\u00a0314, 189\u2013216 (2004), \n                    \n                      http:\/\/www.uncg.edu\/mat\/AlgBin","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR4","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\u00a0109, 221\u2013245 (2005), \n                    \n                      http:\/\/www.uncg.edu\/mat\/cft","journal-title":"J. Combin. Theory Ser. A"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/S0304-3975(00)00407-2","volume":"270","author":"F. Blanchet-Sadri","year":"2002","unstructured":"Blanchet-Sadri, F., Hegstrom, R.A.: Partial Words and a Theorem of Fine and Wilf Revisited. Theoret. Comput. Sci.\u00a0270, 401\u2013419 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR6","unstructured":"Blanchet-Sadri, F., Wetzler, N.D.: Partial Words and the Critical Factorization Theorem Revisited. \n                    \n                      http:\/\/www.uncg.edu\/mat\/research\/cft2"},{"key":"9_CR7","first-page":"1175","volume":"268","author":"Y. C\u00e9sari","year":"1978","unstructured":"C\u00e9sari, Y., Vincent, M.: Une Caract\u00e9risation des Mots P\u00e9riodiques. C.R. Acad. Sci. Paris\u00a0268, 1175\u20131177 (1978)","journal-title":"C.R. Acad. Sci. Paris"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1112\/jlms\/s1-10.1.126","volume":"10","author":"P. Erd\u00f6s","year":"1935","unstructured":"Erd\u00f6s, P.: Note on Sequences of Integers No One of Which is Divisible by Another. J. London Math. Soc.\u00a010, 126\u2013128 (1935)","journal-title":"J. London Math. Soc."},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.2307\/2034009","volume":"16","author":"N.J. Fine","year":"1965","unstructured":"Fine, N.J., Wilf, H.S.: Uniqueness Theorems for Periodic Functions. Proc. Amer. Math. Soc.\u00a016, 109\u2013114 (1965)","journal-title":"Proc. Amer. Math. Soc."},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0097-3165(81)90038-8","volume":"30","author":"L.J. Guibas","year":"1981","unstructured":"Guibas, L.J., Odlyzko, A.M.: Periods in Strings. J. Combin. Theory Ser. A\u00a030, 19\u201342 (1981)","journal-title":"J. Combin. Theory Ser. A"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/3-540-44676-1_14","volume-title":"Algorithms - ESA 2001","author":"R. Kolpakov","year":"2001","unstructured":"Kolpakov, R., Kucherov, G.: Finding Approximate Repetitions Under Hamming Distance. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 170\u2013181. Springer, Heidelberg (2001)"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(02)00448-6","volume":"33","author":"R. Kolpakov","year":"2003","unstructured":"Kolpakov, R., Kucherov, G.: Finding Approximate Repetitions Under Hamming Distance. Theoret. Comput. Sci.\u00a033, 135\u2013156 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/BFb0029801","volume-title":"Combinatorial Pattern Matching","author":"G. Landau","year":"1993","unstructured":"Landau, G., Schmidt, J.: An Algorithm for Approximate Tandem Repeats. In: Apostolico, A., et al. (eds.) CPM 1993. LNCS, vol.\u00a0684, pp. 120\u2013133. Springer, Heidelberg (1993)"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1089\/106652701300099038","volume":"8","author":"G.M. Landau","year":"2001","unstructured":"Landau, G.M., Schmidt, J.P., Sokol, D.: An Algorithm for Approximate Tandem Repeats. J. Comput. Biology\u00a08, 1\u201318 (2001)","journal-title":"J. Comput. Biology"},{"key":"9_CR15","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107326019","volume-title":"Algebraic Combinatorics on Words","author":"M. Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)"},{"key":"9_CR16","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\u00a0104, 95\u2013113 (2003)","journal-title":"J. Combin. Theory Ser. A"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1137\/S0097539795288489","volume":"27","author":"J.P. Schmidt","year":"1998","unstructured":"Schmidt, J.P.: All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings. SIAM J. Comput.\u00a027, 972\u2013992 (1998)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","STACS 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70918-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:36:20Z","timestamp":1558272980000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70918-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540709176","9783540709183"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70918-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}