{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:18:55Z","timestamp":1725567535915},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642163203"},{"type":"electronic","value":"9783642163210"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16321-0_27","type":"book-chapter","created":{"date-parts":[[2010,10,5]],"date-time":"2010-10-05T10:51:32Z","timestamp":1286275892000},"page":"258-269","source":"Crossref","is-referenced-by-count":12,"title":["Extracting Powers and Periods in a String from Its Runs Structure"],"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":[{"issue":"3","key":"27_CR1","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1137\/0217026","volume":"17","author":"B. Chazelle","year":"1988","unstructured":"Chazelle, B.: A functional approach to data structures and its use in multidimensional searching. SIAM J. Comput.\u00a017(3), 427\u2013462 (1988)","journal-title":"SIAM J. Comput."},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-540-73437-6_31","volume-title":"Combinatorial Pattern Matching","author":"G. Chen","year":"2007","unstructured":"Chen, G., Puglisi, S.J., Smyth, W.F.: Fast and practical algorithms for computing all the runs in a string. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol.\u00a04580, pp. 307\u2013315. Springer, Heidelberg (2007)"},{"key":"27_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546853","volume-title":"Algorithms on Strings","author":"M. Crochemore","year":"2007","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press, Cambridge (2007)"},{"issue":"50","key":"27_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":"27_CR5","volume-title":"Jewels of Stringology","author":"M. Crochemore","year":"2003","unstructured":"Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific, Singapore (2003)"},{"issue":"1-3","key":"27_CR6","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.tcs.2004.06.024","volume":"326","author":"J.-P. Duval","year":"2004","unstructured":"Duval, J.-P., Kolpakov, R., Kucherov, G., Lecroq, T., Lefebvre, A.: Linear-time computation of local periods. Theor. Comput. Sci.\u00a0326(1-3), 229\u2013240 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-540-74450-4_41","volume-title":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","author":"J. Fischer","year":"2007","unstructured":"Fischer, J., Heun, V.: A new succinct representation of RMQ-information and improvements in the enhanced suffix array. In: Chen, B., Paterson, M., Zhang, G. (eds.) ESCAPE 2007. LNCS, vol.\u00a04614, pp. 459\u2013470. Springer, Heidelberg (2007)"},{"key":"27_CR8","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. of Combinatorial Theory Series A\u00a082, 112\u2013120 (1998)","journal-title":"J. of Combinatorial Theory Series A"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Gabow, H.N., Tarjan, R.E.: A linear-time algorithm for a special case of disjoint set union. In: Proceedings of the 15th Annual ACM Symposium on Theory of Computing (STOC), pp. 246\u2013251 (1983)","DOI":"10.1145\/800061.808753"},{"issue":"4","key":"27_CR10","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1016\/j.jcss.2004.03.004","volume":"69","author":"D. Gusfield","year":"2004","unstructured":"Gusfield, D., Stoye, J.: Linear time algorithms for finding and representing all the tandem repeats in a string. J. Comput. Syst. Sci.\u00a069(4), 525\u2013546 (2004)","journal-title":"J. Comput. Syst. Sci."},{"key":"27_CR11","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. of Combinatorial Theory Series A\u00a0112, 163\u2013164 (2005)","journal-title":"J. of Combinatorial Theory Series A"},{"key":"27_CR12","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. Theoretical Computer Science\u00a0380, 373\u2013376 (2007)","journal-title":"Theoretical Computer Science"},{"key":"27_CR13","unstructured":"Itai, A.: Linear time restricted union\/find (2006), \n                    \n                      http:\/\/www.cs.technion.ac.il\/~itai\/Courses\/ds2\/lectures\/lecture.html"},{"key":"27_CR14","first-page":"159","volume":"1","author":"R.M. Kolpakov","year":"1999","unstructured":"Kolpakov, R.M., Kucherov, G.: On maximal repetitions in words. J. of Discrete Algorithms\u00a01, 159\u2013186 (1999)","journal-title":"J. of Discrete Algorithms"},{"key":"27_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-642-10217-2_34","volume-title":"Combinatorial Algorithms","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)"},{"issue":"1","key":"27_CR16","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.jda.2006.03.011","volume":"5","author":"K. Sadakane","year":"2007","unstructured":"Sadakane, K.: Succinct data structures for flexible text retrieval systems. J. Discrete Algorithms\u00a05(1), 12\u201322 (2007)","journal-title":"J. Discrete Algorithms"}],"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-16321-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T10:34:45Z","timestamp":1553164485000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16321-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642163203","9783642163210"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16321-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}