{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:44:51Z","timestamp":1743057891096,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319199283"},{"type":"electronic","value":"9783319199290"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19929-0_24","type":"book-chapter","created":{"date-parts":[[2015,6,15]],"date-time":"2015-06-15T13:09:49Z","timestamp":1434373789000},"page":"284-294","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["String Powers in Trees"],"prefix":"10.1007","author":[{"given":"Tomasz","family":"Kociumaka","sequence":"first","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","published-online":{"date-parts":[[2015,6,16]]},"reference":[{"issue":"1","key":"24_CR1","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1006\/jagm.1999.1063","volume":"35","author":"A Amir","year":"2000","unstructured":"Amir, A., Lewenstein, M., Lewenstein, N.: Pattern matching in hypertext. J. Algorithms 35(1), 82\u201399 (2000)","journal-title":"J. Algorithms"},{"issue":"2","key":"24_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.disc.2006.06.017","volume":"307","author":"B Bre\u0161ar","year":"2007","unstructured":"Bre\u0161ar, B., Grytczuk, J., Klav\u017ear, S., Niwczyk, S., Peterin, I.: Nonrepetitive colorings of trees. Discrete Math. 307(2), 163\u2013172 (2007)","journal-title":"Discrete Math."},{"key":"24_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)"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-31265-6_3","volume-title":"Combinatorial Pattern Matching","author":"M Crochemore","year":"2012","unstructured":"Crochemore, M., Iliopoulos, C.S., Kociumaka, T., Kubica, M., Radoszewski, J., Rytter, W., Tyczy\u0144ski, W., Wale\u0144, T.: The maximum number of squares in a tree. In: K\u00e4rkk\u00e4inen, J., Stoye, J. (eds.) CPM 2012. LNCS, vol. 7354, pp. 27\u201340. Springer, Heidelberg (2012)"},{"issue":"1","key":"24_CR5","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1006\/jcta.1997.2843","volume":"82","author":"AS Fraenkel","year":"1998","unstructured":"Fraenkel, A.S., Simpson, J.: How many squares can a string contain? J. Comb. Theory Ser. A 82(1), 112\u2013120 (1998)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"19","key":"24_CR6","doi-asserted-by":"publisher","first-page":"4419","DOI":"10.1016\/j.disc.2007.08.039","volume":"308","author":"J Grytczuk","year":"2008","unstructured":"Grytczuk, J.: Thue type problems for graphs, points, and numbers. Discrete Math. 308(19), 4419\u20134429 (2008)","journal-title":"Discrete Math."},{"issue":"1","key":"24_CR7","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. Comb. Theory Ser. A 112(1), 163\u2013164 (2005)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"3","key":"24_CR8","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. Theor. Comput. Sci. 380(3), 373\u2013376 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.tcs.2014.04.015","volume":"544","author":"T Kociumaka","year":"2014","unstructured":"Kociumaka, T., Pachocki, J., Radoszewski, J., Rytter, W., Wale\u0144, T.: Efficient counting of square substrings in a tree. Theor. Comput. Sci. 544, 60\u201373 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/978-3-319-09698-8_19","volume-title":"Developments in Language Theory","author":"T Kociumaka","year":"2014","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W., Wale\u0144, T.: Maximum number of distinct and nonequivalent nonstandard squares in a word. In: Shur, A.M., Volkov, M.V. (eds.) DLT 2014. LNCS, vol. 8633, pp. 215\u2013226. Springer, Heidelberg (2014)"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W., Wale\u0144, T.: Internal pattern matching queries in a text and applications. In: Indyk, P. (ed.) 26th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, pp. 532\u2013551. SIAM (2015)","DOI":"10.1137\/1.9781611973730.36"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Kubica, M., Radoszewski, J., Rytter, W., Wale\u0144, T.: On the maximum number of cubic subwords in a word. Eur. J. Comb. 34(1), 27\u201337 (2013)","DOI":"10.1016\/j.ejc.2012.07.012"},{"key":"24_CR13","series-title":"Cambridge Mathematical Library","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566097","volume-title":"Combinatorics on Words","author":"M Lothaire","year":"1997","unstructured":"Lothaire, M.: Combinatorics on Words. Cambridge Mathematical Library, second edn. Cambridge University Press, New York (1997)","edition":"second"},{"key":"24_CR14","unstructured":"Thue, A.: \u00dcber unendliche Zeichenreihen. Norske Videnskabers Selskabs Skrifter Mat.-Nat. Kl. 7, 1\u201322 (1906)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19929-0_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T08:35:50Z","timestamp":1676018150000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19929-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319199283","9783319199290"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19929-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}