{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T03:22:21Z","timestamp":1787368941127,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540323013","type":"print"},{"value":"9783540322887","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11672142_14","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T03:27:54Z","timestamp":1141097274000},"page":"184-195","source":"Crossref","is-referenced-by-count":24,"title":["The Number of Runs in a String: Improved Analysis of the Linear Upper Bound"],"prefix":"10.1007","author":[{"given":"Wojciech","family":"Rytter","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"5","key":"14_CR1","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0020-0190(81)90024-7","volume":"42","author":"M. Crochemore","year":"1981","unstructured":"Crochemore, M.: An optimal algorithm for computing the repetitions in a word. Inf. Proc. Letters\u00a042(5), 244\u2013250 (1981)","journal-title":"Inf. Proc. Letters"},{"key":"14_CR2","unstructured":"Franek, F., Simpson, R.J., Smyth, W.F.: The maximum number of runs in a string. In: Miller, M., Park, K. (eds.) Proc. 14-th Australian Workshop on Combinatorial Algorithms, pp. 26\u201335 (2003)"},{"key":"14_CR3","volume-title":"Jewels of stringology: text algorithms","author":"M. Crochemore","year":"2003","unstructured":"Crochemore, M., Rytter, W.: Jewels of stringology: text algorithms. World Scientific, Singapore (2003)"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/11496656_22","volume-title":"Combinatorial Pattern Matching","author":"K. Fan","year":"2005","unstructured":"Fan, K., Smyth, W.F., Simpson, R.J.: A New Periodicity Lemma. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol.\u00a03537, pp. 257\u2013265. Springer, Heidelberg (2005)"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0304-3975(00)00063-3","volume":"249-2","author":"F. Franek","year":"2000","unstructured":"Franek, F., Karaman, A., Smyth, W.F.: Repetitions in Sturmian strings. TCS\u00a0249-2, 289\u2013303 (2000)","journal-title":"TCS"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0304-3975(96)00141-7","volume":"172","author":"C. Iliopoulos","year":"1997","unstructured":"Iliopoulos, C., Moore, D., Smyth, W.F.: A characterization of the squares in a Fibonacci string. TCS\u00a0172, 281\u2013291 (1997)","journal-title":"TCS"},{"key":"14_CR7","first-page":"159","volume":"1","author":"R. Kolpakov","year":"2000","unstructured":"Kolpakov, R., Kucherov, G.: On maximal repetitions in words. Journal of Discr. Algorithms\u00a01, 159\u2013186 (2000)","journal-title":"Journal of Discr. Algorithms"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Kolpakov, R., Kucherov, G.: Finding maximal repetitions in a word in linear time, FOCS, pp. 596\u2013604 (1999)","DOI":"10.1109\/SFFCS.1999.814634"},{"key":"14_CR9","unstructured":"Lothaire,: Algebraic combinatorics on words. Cambridge University Press, Cambridge"},{"key":"14_CR10","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(nlogn) algorithm for finding all repetitions in a string. Journal of Algorithms\u00a05, 422\u2013432 (1984)","journal-title":"Journal of Algorithms"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Rytter, W.: The structure of subword graphs and suffix trees of Fibonacci words. In: Colloquium on Implementation and Application of Automata, CIAA (2005)","DOI":"10.1007\/11605157_21"},{"key":"14_CR12","volume-title":"Computing patterns in strings","author":"W.F. Smyth","year":"2003","unstructured":"Smyth, W.F.: Computing patterns in strings. Addison-Wesley, Reading (2003)"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0304-3975(00)00067-0","volume":"249-2","author":"W.F. Smyth","year":"2000","unstructured":"Smyth, W.F.: Repetitive perhaps, but certainly not boring. TCS\u00a0249-2, 343\u2013355 (2000)","journal-title":"TCS"}],"container-title":["Lecture Notes in Computer Science","STACS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11672142_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T23:31:32Z","timestamp":1555457492000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11672142_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540323013","9783540322887"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11672142_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}