{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:09:02Z","timestamp":1760202542377},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744559"},{"type":"electronic","value":"9783540744566"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74456-6_42","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T07:29:48Z","timestamp":1187076588000},"page":"465-476","source":"Crossref","is-referenced-by-count":9,"title":["Analysis of Maximal Repetitions in Strings"],"prefix":"10.1007","author":[{"given":"Maxime","family":"Crochemore","sequence":"first","affiliation":[]},{"given":"Lucian","family":"Ilie","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"42_CR1","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0304-3975(83)90109-3","volume":"22","author":"A. Apostolico","year":"1983","unstructured":"Apostolico, A., Preparata, F.: Optimal off-line detection of repetitions in a string. Theoret. Comput. Sci.\u00a022(3), 297\u2013315 (1983)","journal-title":"Theoret. Comput. Sci."},{"key":"42_CR2","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. Inform. Proc. Letters\u00a012, 244\u2013250 (1981)","journal-title":"Inform. Proc. Letters"},{"key":"42_CR3","unstructured":"Crochemore, M., Ilie, L.: A simple proof that the number of runs in a word is linear (manuscript, 2006)"},{"key":"42_CR4","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":"42_CR5","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1006\/jcta.1997.2843","volume":"82","author":"A.S. Fraenkel","year":"1998","unstructured":"Fraenkel, A.S., Simpson, J.: How many squares can a string contain? J.\u00a0Combin.\u00a0Theory, Ser.\u00a0A\u00a082, 112\u2013120 (1998)","journal-title":"J.\u00a0Combin.\u00a0Theory, Ser.\u00a0A"},{"key":"42_CR6","unstructured":"Franek, F., Simpson, R.J., Smyth, W.F.: The maximum number of runs in a string. In: Miller, M., Park, K. (eds.) Proc.\u00a014th Australasian Workshop on Combinatorial Algorithms, pp. 26\u201335 (2003)"},{"issue":"1","key":"42_CR7","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.jcta.2005.01.006","volume":"112","author":"L. Ilie","year":"2005","unstructured":"Ilie, L.: A simple proof that a word of length n has at most 2n distinct squares. J.\u00a0Combin.\u00a0Theory, Ser.\u00a0A\u00a0112(1), 163\u2013164 (2005)","journal-title":"J.\u00a0Combin.\u00a0Theory, Ser.\u00a0A"},{"issue":"3","key":"42_CR8","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.tcs.2007.03.025","volume":"380","author":"L. Ilie","year":"2007","unstructured":"Ilie, L.: A note on the number of squares in a word. Theoret. Comput. Sci.\u00a0380(3), 373\u2013376 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"42_CR9","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0304-3975(96)00141-7","volume":"172","author":"C.S. Iliopoulos","year":"1997","unstructured":"Iliopoulos, C.S., Moore, D., Smyth, W.F.: A characterization of the squares in a Fibonacci string. Theoret.\u00a0Comput.\u00a0Sci.\u00a0172, 281\u2013291 (1997)","journal-title":"Theoret.\u00a0Comput.\u00a0Sci."},{"key":"42_CR10","doi-asserted-by":"crossref","unstructured":"Kolpakov, R., Kucherov, G.: On the sum of exponents of maximal repetitions in a word, Tech. Report 99-R-034, LORIA (1999)","DOI":"10.1007\/3-540-48321-7_31"},{"key":"42_CR11","first-page":"596","volume-title":"Proc.\u00a0of FOCS 1999","author":"R. Kolpakov","year":"1999","unstructured":"Kolpakov, R., Kucherov, G.: Finding maximal repetitions in a word in linear time. In: Proc.\u00a0of FOCS 1999, pp. 596\u2013604. IEEE Computer Society Press, Los Alamitos (1999)"},{"issue":"1","key":"42_CR12","first-page":"159","volume":"1","author":"R. Kolpakov","year":"2000","unstructured":"Kolpakov, R., Kucherov, G.: On maximal repetitions in words. J.\u00a0Discrete Algorithms\u00a01(1), 159\u2013186 (2000)","journal-title":"J.\u00a0Discrete Algorithms"},{"key":"42_CR13","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 Univ.\u00a0Press, Cambridge (2002)"},{"key":"42_CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107341005","volume-title":"Applied Combinatorics on Words","author":"M. Lothaire","year":"2005","unstructured":"Lothaire, M.: Applied Combinatorics on Words. Cambridge Univ.\u00a0Press, Cambridge (2005)"},{"key":"42_CR15","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 lefmost maximal periodicities. Discrete Applied Math.\u00a025, 145\u2013153 (1989)","journal-title":"Discrete Applied Math."},{"key":"42_CR16","unstructured":"Puglisi, S.J., Simpson, J., Smyth, B.: How many runs can a string contain? (submitted, 2006)"},{"key":"42_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/11672142_14","volume-title":"STACS 2006","author":"W. Rytter","year":"2006","unstructured":"Rytter, W.: The number of runs in a string: improved analysis of the linear upper bound. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 184\u2013195. Springer, Heidelberg (2006)"},{"key":"42_CR18","unstructured":"Rytter, W.: The number of runs in a string (submitted, 2006)"},{"key":"42_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/BFb0030787","volume-title":"Combinatorial Pattern Matching","author":"J. Stoye","year":"1998","unstructured":"Stoye, J., Gusfield, D.: Simple and flexible detection of contiguous repeats using a suffix tree. In: Farach-Colton, M. (ed.) CPM 1998. LNCS, vol.\u00a01448, pp. 140\u2013152. Springer, Heidelberg (1998)"},{"key":"42_CR20","unstructured":"Thue, A., Zeichenreihen, \u00dc.u.: Kra. Vidensk. Selsk. Skrifter. I. Mat.-Nat. Kl. Cristiana\u00a07 (1906)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74456-6_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:29:09Z","timestamp":1619519349000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74456-6_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744559","9783540744566"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74456-6_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}