{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:47:14Z","timestamp":1725806834647},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319119175"},{"type":"electronic","value":"9783319119182"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11918-2_17","type":"book-chapter","created":{"date-parts":[[2014,10,10]],"date-time":"2014-10-10T09:09:45Z","timestamp":1412932185000},"page":"173-178","source":"Crossref","is-referenced-by-count":0,"title":["Online Multiple Palindrome Pattern Matching"],"prefix":"10.1007","author":[{"given":"Hwee","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yo-Sub","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"17_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A.V. Aho","year":"1975","unstructured":"Aho, A.V., Corasick, M.J.: Efficient string matching: An aid to bibliographic search. Communications of the ACM\u00a018(6), 333\u2013340 (1975)","journal-title":"Communications of the ACM"},{"issue":"1","key":"17_CR2","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":"17_CR3","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":"2","key":"17_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"},{"issue":"1-2","key":"17_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. Theoretical Computer Science\u00a0255(1-2), 539\u2013553 (2001)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"17_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. European Journal of Combinatorics\u00a030(2), 510\u2013531 (2009)","journal-title":"European Journal of Combinatorics"},{"issue":"20","key":"17_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. Information Processing Letters\u00a0110(20), 908\u2013912 (2010)","journal-title":"Information Processing Letters"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511574931"},{"key":"17_CR9","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison\u2013Wesley (1979)"},{"key":"17_CR10","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":"I. Tomohiro","year":"2010","unstructured":"Tomohiro, I., 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)"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.tcs.2012.01.047","volume":"483","author":"I. Tomohiro","year":"2013","unstructured":"Tomohiro, I., Inenaga, S., Bannai, H., Takeda, M.: Palindrome pattern matching. Theoretical Computer Science\u00a0483, 162\u2013170 (2013)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"17_CR12","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":"17_CR13","unstructured":"Wood, D.: Theory of Computation. Harper & Row (1986)"}],"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-319-11918-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T03:30:19Z","timestamp":1559014219000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11918-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319119175","9783319119182"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11918-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}