{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T05:21:54Z","timestamp":1741152114420,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642192210"},{"type":"electronic","value":"9783642192227"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-19222-7_2","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T08:03:12Z","timestamp":1300089792000},"page":"10-19","source":"Crossref","is-referenced-by-count":2,"title":["On the Maximal Sum of Exponents of Runsin a String"],"prefix":"10.1007","author":[{"given":"Maxime","family":"Crochemore","sequence":"first","affiliation":[]},{"given":"Marcin","family":"Kubica","sequence":"additional","affiliation":[]},{"given":"Jakub","family":"Radoszewski","sequence":"additional","affiliation":[]},{"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[]},{"given":"Tomasz","family":"Wale\u0144","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","first-page":"178","volume":"79","author":"J. Berstel","year":"2003","unstructured":"Berstel, J., Karhumaki, J.: Combinatorics on words: a tutorial. Bulletin of the EATCS\u00a079, 178\u2013228 (2003)","journal-title":"Bulletin of the EATCS"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-540-74456-6_42","volume-title":"Mathematical Foundations of Computer Science 2007","author":"M. Crochemore","year":"2007","unstructured":"Crochemore, M., Ilie, L.: Analysis of maximal repetitions in strings. In: Kucera, L., Kucera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, pp. 465\u2013476. Springer, Heidelberg (2007)"},{"issue":"5","key":"2_CR3","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. J. Comput. Syst. Sci.\u00a074(5), 796\u2013807 (2008)","journal-title":"J. Comput. Syst. Sci."},{"issue":"50","key":"2_CR4","doi-asserted-by":"publisher","first-page":"5227","DOI":"10.1016\/j.tcs.2009.08.024","volume":"410","author":"M. Crochemore","year":"2009","unstructured":"Crochemore, M., Ilie, L., Rytter, W.: Repetitions in strings: Algorithms and combinatorics. Theor. Comput. Sci.\u00a0410(50), 5227\u20135235 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-540-69068-9_27","volume-title":"Combinatorial Pattern Matching","author":"M. Crochemore","year":"2008","unstructured":"Crochemore, M., Ilie, L., Tinta, L.: Towards a solution to the \u201druns\u201d conjecture. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol.\u00a05029, pp. 290\u2013302. Springer, Heidelberg (2008)"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-642-13089-2_19","volume-title":"Language and Automata Theory and Applications","author":"M. Crochemore","year":"2010","unstructured":"Crochemore, M., Iliopoulos, C.S., Kubica, M., Radoszewski, J., Rytter, W., Walen, T.: On the maximal number of cubic runs in a string. In: Dediu, A.H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol.\u00a06031, pp. 227\u2013238. Springer, Heidelberg (2010)"},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1142\/S0129054108005620","volume":"19","author":"F. Franek","year":"2008","unstructured":"Franek, F., Yang, Q.: An asymptotic lower bound for the maximal number of runs in a string. Int. J. Found. Comput. Sci.\u00a019(1), 195\u2013203 (2008)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-540-88282-4_22","volume-title":"Language and Automata Theory and Applications","author":"M. Giraud","year":"2008","unstructured":"Giraud, M.: Not so many runs in strings. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol.\u00a05196, pp. 232\u2013239. Springer, Heidelberg (2008)"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/BFb0030787","volume-title":"Combinatorial Pattern Matching","author":"D. Gusfield","year":"1998","unstructured":"Gusfield, D., Stoye, J.: Simple and flexible detection of contiguous repeats using a suffix tree (preliminary version). In: Farach-Colton, M. (ed.) CPM 1998. LNCS, vol.\u00a01448, pp. 140\u2013152. Springer, Heidelberg (1998)"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Kolpakov, R.M., Kucherov, G.: Finding maximal repetitions in a word in linear time. In: Proceedings of the 40th Symposium on Foundations of Computer Science, pp. 596\u2013604 (1999)","DOI":"10.1109\/SFFCS.1999.814634"},{"key":"2_CR11","first-page":"159","volume":"1","author":"R.M. Kolpakov","year":"1999","unstructured":"Kolpakov, R.M., Kucherov, G.: On maximal repetitions in words. J. of Discr. Alg.\u00a01, 159\u2013186 (1999)","journal-title":"J. of Discr. Alg."},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Kolpakov, R.M., 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":"2_CR13","unstructured":"Kusano, K., Matsubara, W., Ishino, A., Bannai, H., Shinohara, A.: New lower bounds for the maximum number of runs in a string. CoRR, abs\/0804.1214 (2008)"},{"key":"2_CR14","volume-title":"Combinatorics on Words","author":"M. Lothaire","year":"1983","unstructured":"Lothaire, M.: Combinatorics on Words. Addison-Wesley, Reading (1983)"},{"issue":"1-3","key":"2_CR15","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.tcs.2008.04.020","volume":"401","author":"S.J. Puglisi","year":"2008","unstructured":"Puglisi, S.J., Simpson, J., Smyth, W.F.: How many runs can a string contain? Theor. Comput. Sci.\u00a0401(1-3), 165\u2013171 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR16","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)"},{"issue":"9","key":"2_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. Inf. Comput.\u00a0205(9), 1459\u20131469 (2007)","journal-title":"Inf. Comput."},{"key":"2_CR18","first-page":"129","volume":"46","author":"J. Simpson","year":"2010","unstructured":"Simpson, J.: Modified Padovan words and the maximum number of runs in a word. Australasian J. of Comb.\u00a046, 129\u2013145 (2010)","journal-title":"Australasian J. of Comb."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19222-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T06:36:39Z","timestamp":1741070199000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19222-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642192210","9783642192227"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19222-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}