{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:48:43Z","timestamp":1725558523862},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540406716"},{"type":"electronic","value":"9783540451389"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45138-9_33","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T22:41:48Z","timestamp":1277246508000},"page":"388-397","source":"Crossref","is-referenced-by-count":2,"title":["Linear-Time Computation of Local Periods"],"prefix":"10.1007","author":[{"given":"Jean-Pierre","family":"Duval","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roman","family":"Kolpakov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregory","family":"Kucherov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thierry","family":"Lecroq","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnaud","family":"Lefebvre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"R.S. Boyer","year":"1977","unstructured":"Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Communications of the ACM\u00a020, 762\u2013772 (1977)","journal-title":"Communications of the ACM"},{"key":"33_CR2","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/978-3-642-59136-5_6","volume-title":"Handbook on Formal Languages","author":"C.. Choffrut","year":"1997","unstructured":"Choffrut, C., Karhum\u00e4ki, J.: Combinatorics of words. In: Rozenberg, G., Salomaa, A. (eds.) Handbook on Formal Languages, vol.\u00a0I, pp. 329\u2013438. Springer, Heidelberg (1997)"},{"key":"33_CR3","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1145\/116825.116845","volume":"38","author":"M. Crochemore","year":"1991","unstructured":"Crochemore, M., Perrin, D.: Two-way string matching. J. ACM\u00a038, 651\u2013675 (1991)","journal-title":"J. ACM"},{"key":"33_CR4","volume-title":"Text algorithms","author":"M. Crochemore","year":"1994","unstructured":"Crochemore, M., Rytter, W.: Text algorithms. Oxford University Press, Oxford (1994)"},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/BF01190846","volume":"13","author":"M. Crochemore","year":"1995","unstructured":"Crochemore, M., Rytter, W.: Squares, cubes, and time-space efficient string searching. Algorithmica\u00a013, 405\u2013425 (1995)","journal-title":"Algorithmica"},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0020-0190(81)90024-7","volume":"12","author":"M. Crochemore","year":"1981","unstructured":"Crochemore, M.: An optimal algorithm for computing the repetitions in a word. Information Processing Letters\u00a012, 244\u2013250 (1981)","journal-title":"Information Processing Letters"},{"key":"33_CR7","first-page":"781","volume":"296","author":"M. Crochemore","year":"1983","unstructured":"Crochemore, M.: Recherche lin\u00e9aire d\u2019un carr\u00e9 dans un mot. Comptes Rendus Acad. Sci. Paris S\u00e9r. I Math.\u00a0296, 781\u2013784 (1983)","journal-title":"Comptes Rendus Acad. Sci. Paris S\u00e9r. I Math."},{"issue":"1","key":"33_CR8","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/S0304-3975(00)00204-8","volume":"262","author":"J.-P. Duval","year":"2001","unstructured":"Duval, J.-P., Mignosi, F., Restivo, A.: Recurrence and periodicity in infinite words from local periods. Theoretical Computer Science\u00a0262(1), 269\u2013284 (2001)","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"33_CR9","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0304-3975(98)00033-4","volume":"204","author":"J.-P. Duval","year":"1998","unstructured":"Duval, J.-P.: P\u00e9riodes locales et propagation de p\u00e9riodes dans un mot. Theoretical Computer Science\u00a0204(1-2), 87\u201398 (1998)","journal-title":"Theoretical Computer Science"},{"key":"33_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. Journal of Combinatorial Theory, Series A\u00a030, 19\u201342 (1981)","journal-title":"Journal of Combinatorial Theory, Series A"},{"issue":"3","key":"33_CR11","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/0022-0000(83)90002-8","volume":"26","author":"Z. Galil","year":"1983","unstructured":"Galil, Z., Seiferas, J.: Time-space optimal string matching. Journal of Computer and System Sciences\u00a026(3), 280\u2013294 (1983)","journal-title":"Journal of Computer and System Sciences"},{"key":"33_CR12","series-title":"Computer Science and Computational Biology","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)"},{"key":"33_CR13","first-page":"596","volume-title":"Proc. of FOCS 1999","author":"R. Kolpakov","year":"1999","unstructured":"Kolpakov, R., Kucherov, G.: Finding maximal repetitions in a word in linear time. In: Proc. of FOCS 1999, pp. 596\u2013604. IEEE Comp. Soc., New York (1999)"},{"key":"33_CR14","first-page":"162","volume-title":"Proc. of the 7th SPIRE","author":"R. Kolpakov","year":"2000","unstructured":"Kolpakov, R., Kucherov, G.: Finding repeats with fixed gap. In: Proc. of the 7th SPIRE, La Coru\u00f1a, Spain, pp. 162\u2013168. IEEE, Los Alamitos (2000)"},{"key":"33_CR15","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":"33_CR16","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM Journal of Computing\u00a06, 323\u2013350 (1977)","journal-title":"SIAM Journal of Computing"},{"key":"33_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/3-540-58094-8_13","volume-title":"Proc. of the 5th CPM","author":"S.R. Kosaraju","year":"1994","unstructured":"Kosaraju, S.R.: Computation of squares in string. In: Crochemore, M., Gusfield, D. (eds.) CPM 1994. LNCS, vol.\u00a0807, pp. 146\u2013150. Springer, Heidelberg (1994)"},{"key":"33_CR18","series-title":"Encyclopedia of Mathematics and Its Applications","volume-title":"Combinatorics on Words","author":"M. Lothaire","year":"1983","unstructured":"Lothaire, M.: Combinatorics on Words. Encyclopedia of Mathematics and Its Applications, vol.\u00a017. Addison Wesley, Reading (1983)"},{"key":"33_CR19","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":"33_CR20","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0166-218X(89)90051-6","volume":"25","author":"M.G. Main","year":"1989","unstructured":"Main, M.G.: Detecting leftmost maximal periodicities. Discrete Applied Mathematics\u00a025, 145\u2013153 (1989)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"33_CR21","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/0196-6774(84)90021-X","volume":"5","author":"M.G. Main","year":"1984","unstructured":"Main, M.G., Lorentz, R.J.: An O(n logn) algorithm for finding all repetitions in a string. Journal of Algorithms\u00a05(3), 422\u2013432 (1984)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"33_CR22","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/322234.322237","volume":"28","author":"M. Rodeh","year":"1981","unstructured":"Rodeh, M., Pratt, V.R., Even, S.: Linear algorithm for data compression via string matching. Journal of the ACM\u00a028(1), 16\u201324 (1981)","journal-title":"Journal of the ACM"},{"key":"33_CR23","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: van Leuween, J., Orejas, P., Spirakis, P.G. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 615\u2013626. Springer, Heidelberg (2001)"},{"key":"33_CR24","volume-title":"Data Compression: Methods and Theory","author":"J.A. Storer","year":"1988","unstructured":"Storer, J.A.: Data Compression: Methods and Theory. Computer Science Press, Rockville (1988)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45138-9_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T01:29:45Z","timestamp":1552613385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45138-9_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406716","9783540451389"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45138-9_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}