{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:58Z","timestamp":1759639018637,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,1,3]],"date-time":"2017-01-03T00:00:00Z","timestamp":1483401600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004281","name":"Narodowe Centrum Nauki","doi-asserted-by":"publisher","award":["2014\/13\/B\/ST6\/00770"],"award-info":[{"award-number":["2014\/13\/B\/ST6\/00770"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004569","name":"Ministerstwo Nauki i Szkolnictwa Wyz.szego","doi-asserted-by":"publisher","award":["0392\/IP3\/2015\/73","0392\/IP3\/2015\/73"],"award-info":[{"award-number":["0392\/IP3\/2015\/73","0392\/IP3\/2015\/73"]}],"id":[{"id":"10.13039\/501100004569","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004569","name":"Ministerstwo Nauki i Szkolnictwa Wyz.szego","doi-asserted-by":"publisher","award":["0179\/DIA\/2013\/42"],"award-info":[{"award-number":["0179\/DIA\/2013\/42"]}],"id":[{"id":"10.13039\/501100004569","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s00453-016-0271-3","type":"journal-article","created":{"date-parts":[[2017,1,3]],"date-time":"2017-01-03T14:54:22Z","timestamp":1483455262000},"page":"814-834","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["String Powers in Trees"],"prefix":"10.1007","volume":"79","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2477-1702","authenticated-orcid":false,"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":[[2017,1,3]]},"reference":[{"issue":"1","key":"271_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). doi:\n                        10.1006\/jagm.1999.1063","journal-title":"J. Algorithms"},{"issue":"4","key":"271_CR2","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/BF01294132","volume":"14","author":"D Breslauer","year":"1995","unstructured":"Breslauer, D., Galil, Z.: Finding all periods and initial palindromes of a string in parallel. Algorithmica 14(4), 355\u2013366 (1995). doi:\n                        10.1007\/BF01294132","journal-title":"Algorithmica"},{"issue":"2","key":"271_CR3","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. Discret. Math. 307(2), 163\u2013172 (2007). doi:\n                        10.1016\/j.disc.2006.06.017","journal-title":"Discret. Math."},{"doi-asserted-by":"publisher","unstructured":"Brlek, S., Lafreni\u00e8re, N., Proven\u00e7al, X.: Palindromic complexity of trees. In: Potapov, I. (ed.) Developments in Language Theory, DLT 2015, LNCS, vol. 9168, pp. 155\u2013166. Springer (2015). doi:\n                        10.1007\/978-3-319-21500-6_12","key":"271_CR4","DOI":"10.1007\/978-3-319-21500-6_12"},{"key":"271_CR5","doi-asserted-by":"crossref","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, New York (2007)"},{"doi-asserted-by":"publisher","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.) Combinatorial Pattern Matching, CPM 2012, LNCS, vol. 7354, pp. 27\u201340. Springer, Berlin (2012). doi:\n                        10.1007\/978-3-642-31265-6_3","key":"271_CR6","DOI":"10.1007\/978-3-642-31265-6_3"},{"key":"271_CR7","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.dam.2014.08.016","volume":"180","author":"A Deza","year":"2015","unstructured":"Deza, A., Franek, F., Thierry, A.: How many double squares can a string contain? Discret. Appl. Math. 180, 52\u201369 (2015). doi:\n                        10.1016\/j.dam.2014.08.016","journal-title":"Discret. Appl. Math."},{"issue":"1\u20132","key":"271_CR8","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/S0304-3975(99)00320-5","volume":"255","author":"X Droubay","year":"2001","unstructured":"Droubay, X., Justin, J., Pirillo, G.: Episturmian words and some constructions of de Luca and Rauzy. Theor. Comput. Sci. 255(1\u20132), 539\u2013553 (2001). doi:\n                        10.1016\/S0304-3975(99)00320-5","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"271_CR9","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). doi:\n                        10.1006\/jcta.1997.2843","journal-title":"J. Comb. Theory Ser. A"},{"doi-asserted-by":"publisher","unstructured":"Gawrychowski, P., Kociumaka, T., Rytter, W., Wale\u0144, T.: Tight bound for the number of distinct palindromes in a tree. In: Iliopoulos, C.S., Puglisi, S.J., Yilmaz, E. (eds.) String Processing and Information Retrieval, SPIRE 2015, LNCS, vol. 9309, pp. 270\u2013276. Springer (2015). doi:\n                        10.1007\/978-3-319-23826-5_26","key":"271_CR10","DOI":"10.1007\/978-3-319-23826-5_26"},{"issue":"19","key":"271_CR11","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. Discret. Math. 308(19), 4419\u20134429 (2008). doi:\n                        10.1016\/j.disc.2007.08.039","journal-title":"Discret. Math."},{"issue":"1","key":"271_CR12","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                        $$n$$\n                        \n                            \n                                            \n                                n\n                            \n                        \n                     has at most \n                        $$2n$$\n                        \n                            \n                                            \n                                \n                                    2\n                                    n\n                                \n                            \n                        \n                     distinct squares. J. Comb. Theory Ser. A 112(1), 163\u2013164 (2005). doi:\n                        10.1016\/j.jcta.2005.01.006","journal-title":"J. Comb. Theory Ser. A"},{"issue":"3","key":"271_CR13","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). doi:\n                        10.1016\/j.tcs.2007.03.025","journal-title":"Theor. Comput. Sci."},{"key":"271_CR14","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). doi:\n                        10.1016\/j.tcs.2014.04.015","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"publisher","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.) Developments in Language Theory, LNCS, vol. 8633, pp. 215\u2013226. Springer (2014). doi:\n                        10.1007\/978-3-319-09698-8_19","key":"271_CR15","DOI":"10.1007\/978-3-319-09698-8_19"},{"doi-asserted-by":"publisher","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W., Wale\u0144, T.: String powers in trees. In: Cicalese, F., Porat, E., Vaccaro, U. (eds.) Combinatorial Pattern Matching, CPM 2015, LNCS, vol. 9133, pp. 284\u2013294. Springer (2015). doi:\n                        10.1007\/978-3-319-19929-0_24","key":"271_CR16","DOI":"10.1007\/978-3-319-19929-0_24"},{"issue":"1","key":"271_CR17","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.ejc.2012.07.012","volume":"34","author":"M Kubica","year":"2013","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:\n                        10.1016\/j.ejc.2012.07.012","journal-title":"Eur. J. Comb."},{"key":"271_CR18","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511566097","volume-title":"Combinatorics on Words","author":"M Lothaire","year":"1997","unstructured":"Lothaire, M.: Combinatorics on Words, 2nd edn. Cambridge Mathematical Library, Cambridge University Press, Cambridge (1997)","edition":"2"},{"unstructured":"Thue, A.: \u00dcber unendliche Zeichenreihen. Skrifter udgivne af Videnskabsselskabet i Christiania. I. Mathematisk-naturvidenskabelig klasse 1, 7 (1906). \n                        http:\/\/www.biodiversitylibrary.org\/item\/52020","key":"271_CR19"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-016-0271-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0271-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0271-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,9,11]],"date-time":"2017-09-11T18:28:19Z","timestamp":1505154499000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-016-0271-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,3]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["271"],"URL":"https:\/\/doi.org\/10.1007\/s00453-016-0271-3","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2017,1,3]]}}}