{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:27:45Z","timestamp":1755998865956},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642214578"},{"type":"electronic","value":"9783642214585"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21458-5_21","type":"book-chapter","created":{"date-parts":[[2011,6,27]],"date-time":"2011-06-27T17:11:27Z","timestamp":1309194687000},"page":"232-245","source":"Crossref","is-referenced-by-count":6,"title":["Palindrome Pattern Matching"],"prefix":"10.1007","author":[{"given":"Tomohiro","family":"I.","sequence":"first","affiliation":[]},{"given":"Shunsuke","family":"Inenaga","sequence":"additional","affiliation":[]},{"given":"Masayuki","family":"Takeda","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/S0304-3975(01)00212-2","volume":"292","author":"J.P. Allouche","year":"2003","unstructured":"Allouche, J.P., Baake, M., Cassaigne, J., Damanik, D.: Palindrome complexity. Theoretical Computer Science\u00a0292(1), 9\u201331 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"21_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.disc.2009.08.002","volume":"310","author":"M.C. Anisiu","year":"2010","unstructured":"Anisiu, M.C., Anisiu, V., K\u00e1sa, Z.: Total palindrome complexity of finite words. Discrete Mathematics\u00a0310(1), 109\u2013114 (2010)","journal-title":"Discrete Mathematics"},{"issue":"1","key":"21_CR3","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1006\/jcss.1996.0003","volume":"52","author":"B.S. Baker","year":"1996","unstructured":"Baker, B.S.: Parameterized pattern matching: Algorithms and applications. Journal of Computer and System Sciences\u00a052(1), 28\u201342 (1996)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"21_CR4","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. International Journal of Foundations of Computer Science\u00a015(2), 293\u2013306 (2004)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"21_CR5","unstructured":"Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Tech. rep., DIGITAL System Research Center (1994)"},{"issue":"1\u20132","key":"21_CR6","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. Theoretical Computer Science\u00a0255(1\u20132), 539\u2013553 (2001)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"21_CR7","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. European Journal of Combinatorics\u00a030(2), 510\u2013531 (2009)","journal-title":"European Journal of Combinatorics"},{"issue":"20","key":"21_CR8","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. Information Processing Letters\u00a0110(20), 908\u2013912 (2010)","journal-title":"Information Processing Letters"},{"key":"21_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, New York (1997)"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1007\/978-3-642-10631-6_109","volume-title":"Algorithms and Computation","author":"P.H. Hsu","year":"2009","unstructured":"Hsu, P.H., Chen, K.Y., Chao, K.M.: Finding all approximate gapped palindromes. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 1084\u20131093. Springer, Heidelberg (2009)"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-16321-0_13","volume-title":"String Processing and Information Retrieval","author":"T. I","year":"2010","unstructured":"I, T., Inenaga, S., Bannai, H., Takeda, M.: Counting and verifying maximal palindromes. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol.\u00a06393, pp. 135\u2013146. Springer, Heidelberg (2010)"},{"issue":"51","key":"21_CR12","doi-asserted-by":"publisher","first-page":"5365","DOI":"10.1016\/j.tcs.2009.09.013","volume":"410","author":"R. Kolpakov","year":"2009","unstructured":"Kolpakov, R., Kucherov, G.: Searching for gapped palindromes. Theoretical Computer Science\u00a0410(51), 5365\u20135373 (2009)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"21_CR13","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1145\/321892.321896","volume":"22","author":"G. Manacher","year":"1975","unstructured":"Manacher, G.: A new linear-time \u201con-line\u201d algorithm for finding the smallest initial palindrome of a string. Journal of the ACM\u00a022(3), 346\u2013351 (1975)","journal-title":"Journal of the ACM"},{"key":"21_CR14","first-page":"101","volume":"273","author":"A.B. Mass\u00e9","year":"2008","unstructured":"Mass\u00e9, A.B., Brlek, S., Frosini, A., Labb\u00e9, S., Rinaldi, S.: Reconstructing words from a fixed palindromic length sequence. Proc. TCS 2008. IFIP\u00a0273, 101\u2013114 (2008)","journal-title":"Proc. TCS 2008. IFIP"},{"key":"21_CR15","unstructured":"Morris, J.H., Pratt, V.R.: A linear pattern-matching algorithm. Tech. Rep.\u00a040, University of California, Berkeley (1970)"},{"issue":"30\u201332","key":"21_CR16","doi-asserted-by":"publisher","first-page":"3018","DOI":"10.1016\/j.tcs.2009.03.008","volume":"410","author":"A. Restivo","year":"2009","unstructured":"Restivo, A., Rosone, G.: Burrows-Wheeler transform and palindromic richness. Theoretical Computer Science\u00a0410(30\u201332), 3018\u20133026 (2009)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"21_CR17","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E. Ukkonen","year":"1995","unstructured":"Ukkonen, E.: On-line construction of suffix trees. Algorithmica\u00a014(3), 249\u2013260 (1995)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21458-5_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T06:55:49Z","timestamp":1553928949000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21458-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642214578","9783642214585"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21458-5_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}