{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:54:27Z","timestamp":1725555267703},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642130885"},{"type":"electronic","value":"9783642130892"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13089-2_19","type":"book-chapter","created":{"date-parts":[[2010,5,7]],"date-time":"2010-05-07T12:05:27Z","timestamp":1273233927000},"page":"227-238","source":"Crossref","is-referenced-by-count":3,"title":["On the Maximal Number of Cubic Runs in a String"],"prefix":"10.1007","author":[{"given":"Maxime","family":"Crochemore","sequence":"first","affiliation":[]},{"given":"Costas","family":"Iliopoulos","sequence":"additional","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":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-540-70844-5_26","volume-title":"Implementation and Applications of Automata","author":"P. Baturo","year":"2008","unstructured":"Baturo, P., Piatkowski, M., Rytter, W.: The number of runs in Sturmian words. In: Ibarra, O.H., Ravikumar, B. (eds.) CIAA 2008. LNCS, vol.\u00a05148, pp. 252\u2013261. Springer, Heidelberg (2008)"},{"key":"19_CR2","first-page":"178","volume":"79","author":"J. Berstel","year":"2003","unstructured":"Berstel, J., Karhum\u00e4ki, J.: Combinatorics on words: a tutorial. Bulletin of the EATCS\u00a079, 178\u2013228 (2003)","journal-title":"Bulletin of the EATCS"},{"key":"19_CR3","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: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, pp. 465\u2013476. Springer, Heidelberg (2007)"},{"issue":"5","key":"19_CR4","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":"19_CR5","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":"19_CR6","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 \u201cruns\u201d conjecture. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol.\u00a05029, pp. 290\u2013302. Springer, Heidelberg (2008)"},{"issue":"5","key":"19_CR7","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(5), 405\u2013425 (1995)","journal-title":"Algorithmica"},{"issue":"1","key":"19_CR8","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":"19_CR9","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":"19_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":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/978-3-642-10217-2_34","volume-title":"IWOCA 2009","author":"M. Kubica","year":"2009","unstructured":"Kubica, M., Radoszewski, J., Rytter, W., Walen, T.: On the maximal number of cubic subwords in a string. In: Fiala, J., Kratochv\u00edl, J., Miller, M. (eds.) IWOCA 2009. LNCS, vol.\u00a05874, pp. 345\u2013355. Springer, Heidelberg (2009)"},{"key":"19_CR12","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":"19_CR13","volume-title":"Combinatorics on Words","author":"M. Lothaire","year":"1983","unstructured":"Lothaire, M.: Combinatorics on Words. Addison-Wesley, Reading (1983)"},{"key":"19_CR14","first-page":"199","volume":"26","author":"F. Mignosi","year":"1992","unstructured":"Mignosi, F., Pirillo, G.: Repetitions in the Fibonacci infinite word. ITA\u00a026, 199\u2013204 (1992)","journal-title":"ITA"},{"key":"19_CR15","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":"2","key":"19_CR16","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.tcs.2006.07.025","volume":"363","author":"W. Rytter","year":"2006","unstructured":"Rytter, W.: The structure of subword graphs and suffix trees in Fibonacci words. Theor. Comput. Sci.\u00a0363(2), 211\u2013223 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"9","key":"19_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":"19_CR18","unstructured":"Simpson, J.: Modified Padovan words and the maximum number of runs in a word. Australasian Journal of Combinatorics (to appear, 2010)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13089-2_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:54:34Z","timestamp":1619783674000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13089-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130885","9783642130892"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13089-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}