{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T17:15:16Z","timestamp":1768583716041,"version":"3.49.0"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319238258","type":"print"},{"value":"9783319238265","type":"electronic"}],"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-23826-5_26","type":"book-chapter","created":{"date-parts":[[2015,9,4]],"date-time":"2015-09-04T08:20:20Z","timestamp":1441354820000},"page":"270-276","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Tight Bound for the Number of Distinct Palindromes in a Tree"],"prefix":"10.1007","author":[{"given":"Pawe\u0142","family":"Gawrychowski","sequence":"first","affiliation":[]},{"given":"Tomasz","family":"Kociumaka","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,9,5]]},"reference":[{"issue":"1","key":"26_CR1","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.disc.2009.08.002","volume":"310","author":"M Anisiu","year":"2010","unstructured":"Anisiu, M., Anisiu, V., K\u00e1sa, Z.: Total palindrome complexity of finite words. Discrete Mathematics 310(1), 109\u2013114 (2010)","journal-title":"Discrete Mathematics"},{"issue":"2","key":"26_CR2","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1142\/S012905410400242X","volume":"15","author":"S Brlek","year":"2004","unstructured":"Brlek, S., Hamel, S., Nivat, M., Reutenauer, C.: On the palindromic complexity of infinite words. Int. J. Found. Comput. Sci. 15(2), 293\u2013306 (2004)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-319-21500-6_12","volume-title":"Developments in Language Theory","author":"S Brlek","year":"2015","unstructured":"Brlek, S., Lafreni\u00e8re, N., Proven\u00e7al, X.: Palindromic complexity of trees. In: Potapov, I. (ed.) DLT 2015. LNCS, vol. 9168, pp. 155\u2013166. Springer, Heidelberg (2015). arXiv:1505.02695"},{"key":"26_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\u20132","key":"26_CR5","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)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"26_CR6","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1016\/j.ejc.2008.04.006","volume":"30","author":"A Glen","year":"2009","unstructured":"Glen, A., Justin, J., Widmer, S., Zamboni, L.Q.: Palindromic richness. Eur. J. Comb. 30(2), 510\u2013531 (2009)","journal-title":"Eur. J. Comb."},{"issue":"20","key":"26_CR7","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1016\/j.ipl.2010.07.018","volume":"110","author":"R Groult","year":"2010","unstructured":"Groult, R., Prieur, \u00c9., Richomme, G.: Counting distinct palindromes in a word in linear time. Inf. Process. Lett. 110(20), 908\u2013912 (2010)","journal-title":"Inf. Process. Lett."},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-319-19929-0_24","volume-title":"Combinatorial Pattern Matching","author":"T Kociumaka","year":"2015","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W., Wale\u0144, T.: String powers in trees. In: Cicalese, F., Porat, E., Vaccaro, U. (eds.) CPM 2015. LNCS, vol. 9133, pp. 284\u2013294. Springer, Heidelberg (2015)"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.tcs.2014.07.012","volume":"550","author":"J Simpson","year":"2014","unstructured":"Simpson, J.: Palindromes in circular words. Theor. Comput. Sci. 550, 66\u201378 (2014)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23826-5_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T16:38:48Z","timestamp":1675874328000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23826-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319238258","9783319238265"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23826-5_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"5 September 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}