{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T23:24:08Z","timestamp":1750461848540},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642341083"},{"type":"electronic","value":"9783642341090"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34109-0_8","type":"book-chapter","created":{"date-parts":[[2012,9,13]],"date-time":"2012-09-13T11:14:53Z","timestamp":1347534893000},"page":"61-72","source":"Crossref","is-referenced-by-count":8,"title":["Computing the Maximal-Exponent Repeats of an Overlap-Free String in Linear Time"],"prefix":"10.1007","author":[{"given":"Golnaz","family":"Badkobeh","sequence":"first","affiliation":[]},{"given":"Maxime","family":"Crochemore","sequence":"additional","affiliation":[]},{"given":"Chalita","family":"Toopsuwan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","volume-title":"Text compression","author":"T.C. Bell","year":"1990","unstructured":"Bell, T.C., Cleary, J.G., Witten, I.H.: Text compression. Prentice-Hall, Englewood Cliffs (1990)"},{"issue":"1","key":"8_CR2","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1006\/inco.1995.1162","volume":"123","author":"O. Berkman","year":"1995","unstructured":"Berkman, O., Iliopoulos, C.S., Park, K.: The subtree max gap problem with application to parallel string covering. Information and Computation\u00a0123(1), 127\u2013137 (1995)","journal-title":"Information and Computation"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/3-540-48452-3_11","volume-title":"Combinatorial Pattern Matching","author":"G.S. Brodal","year":"1999","unstructured":"Brodal, G.S., Lyngs\u00f8, R.B., Pedersen, C.N.S., Stoye, J.: Finding Maximal Pairs with Bounded Gap. In: Crochemore, M., Paterson, M. (eds.) CPM 1999. LNCS, vol.\u00a01645, pp. 134\u2013149. Springer, Heidelberg (1999)"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/3-540-45123-4_33","volume-title":"Combinatorial Pattern Matching","author":"G.S. Brodal","year":"2000","unstructured":"Brodal, G.S., Pedersen, C.N.S.: Finding Maximal Quasiperiodicities in Strings. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol.\u00a01848, pp. 397\u2013411. Springer, Heidelberg (2000)"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-642-21458-5_30","volume-title":"Combinatorial Pattern Matching","author":"M. Christou","year":"2011","unstructured":"Christou, M., Crochemore, M., Iliopoulos, C.S., Kubica, M., Pissis, S.P., Radoszewski, J., Rytter, W., Szreder, B., Wale\u0144, T.: Efficient Seeds Computation Revisited. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol.\u00a06661, pp. 350\u2013363. Springer, Heidelberg (2011)"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings, 392 pages. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511546853"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1016\/j.jcss.2007.09.003","volume":"74","author":"M. Crochemore","year":"2008","unstructured":"Crochemore, M., Ilie, L.: Maximal repetitions in strings. Journal of Computer and System Sciences\u00a074, 796\u2013807 (2008), doi:10.1016\/j.jcss.2007.09.003","journal-title":"Journal of Computer and System Sciences"},{"issue":"27","key":"8_CR8","doi-asserted-by":"publisher","first-page":"2931","DOI":"10.1016\/j.tcs.2010.06.019","volume":"412","author":"M. Crochemore","year":"2011","unstructured":"Crochemore, M., Ilie, L., Tinta, L.: The \u201cruns\u201d conjecture. Theoretical Computer Science\u00a0412(27), 2931\u20132941 (2011)","journal-title":"Theoretical Computer Science"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.ipl.2010.12.005","volume":"111","author":"M. Crochemore","year":"2011","unstructured":"Crochemore, M., Tischler, G.: Computing longest previous non-overlapping factors. Information Processing Letters\u00a0111, 291\u2013295 (2011)","journal-title":"Information Processing Letters"},{"issue":"274","key":"8_CR10","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1090\/S0025-5718-2010-02407-X","volume":"80","author":"J.D. Currie","year":"2011","unstructured":"Currie, J.D., Rampersad, N.: A proof of Dejean\u2019s conjecture. Mathematics of Computation\u00a080(274), 1063\u20131070 (2011)","journal-title":"Mathematics of Computation"},{"issue":"1","key":"8_CR11","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/0097-3165(72)90011-8","volume":"13","author":"F. Dejean","year":"1972","unstructured":"Dejean, F.: Sur un th\u00e9or\u00e8me de Thue. Journal of Combinatorial Theory, Series A\u00a013(1), 90\u201399 (1972)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"8_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees and sequences: computer science and computational biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on strings, trees and sequences: computer science and computational biology. Cambridge University Press, Cambridge (1997)"},{"issue":"3","key":"8_CR13","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/BF01955677","volume":"16","author":"C.S. Iliopoulos","year":"1996","unstructured":"Iliopoulos, C.S., Moore, D.W.G., Park, K.: Covering a string. Algorithmica\u00a016(3), 288\u2013297 (1996)","journal-title":"Algorithmica"},{"issue":"1","key":"8_CR14","first-page":"159","volume":"1","author":"R. Kolpakov","year":"2000","unstructured":"Kolpakov, R., Kucherov, G.: On maximal repetitions in words. Journal of Discrete Algorithms\u00a01(1), 159\u2013186 (2000)","journal-title":"Journal of Discrete Algorithms"},{"issue":"7","key":"8_CR15","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.ipl.2010.01.005","volume":"110","author":"R. Kolpakov","year":"2010","unstructured":"Kolpakov, R., Kucherov, G., Ochem, P.: On maximal repetitions of arbitrary exponent. Information Processing Letters\u00a0110(7), 252\u2013256 (2010)","journal-title":"Information Processing Letters"},{"issue":"27","key":"8_CR16","doi-asserted-by":"publisher","first-page":"3010","DOI":"10.1016\/j.tcs.2010.06.020","volume":"412","author":"M. Rao","year":"2011","unstructured":"Rao, M.: Last cases of Dejean\u2019s conjecture. Theoretical Computer Science\u00a0412(27), 3010\u20133018 (2011)","journal-title":"Theoretical Computer Science"},{"issue":"9","key":"8_CR17","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1016\/j.ic.2007.01.007","volume":"205","author":"W. Rytter","year":"2007","unstructured":"Rytter, W.: The number of runs in a string. Information and Computation\u00a0205(9), 1459\u20131469 (2007)","journal-title":"Information and Computation"},{"key":"8_CR18","first-page":"1","volume":"7","author":"A. Thue","year":"1906","unstructured":"Thue, A.: \u00dcber unendliche Zeichenreihen. Norske Vid. Selsk. Skr. I Math-Nat. Kl.\u00a07, 1\u201322 (1906)","journal-title":"Norske Vid. Selsk. Skr. I Math-Nat. Kl."},{"key":"8_CR19","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression 23, 337\u2013343 (1977)"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34109-0_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:45:21Z","timestamp":1620132321000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34109-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642341083","9783642341090"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34109-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}