{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:49:27Z","timestamp":1770994167358,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032046994","type":"print"},{"value":"9783032047007","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-04700-7_19","type":"book-chapter","created":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:38Z","timestamp":1758498338000},"page":"252-266","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Combinatorics of\u00a0Palindromes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-4783-2537","authenticated-orcid":false,"given":"Michael","family":"Itzhaki","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,11]]},"reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-540-45138-9_15","volume-title":"Mathematical Foundations of Computer Science 2003","author":"H Bannai","year":"2003","unstructured":"Bannai, H., Inenaga, S., Shinohara, A., Takeda, M.: Inferring strings from graphs and arrays. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 208\u2013217. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45138-9_15"},{"issue":"2","key":"19_CR2","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1093\/nar\/27.2.573","volume":"27","author":"G Benson","year":"1999","unstructured":"Benson, G.: Tandem repeats finder: a program to analyze DNA sequence. Nucleic Acids Res. 27(2), 573\u2013580 (1999)","journal-title":"Nucleic Acids Res."},{"key":"19_CR3","unstructured":"Borozdin, K., Kosolobov, D., Rubinchik, M., Shur, A.: Palindromic length in linear time. In: CPM 2017, vol.\u00a078, pp. 23:1\u201323:12 (2017)"},{"key":"19_CR4","unstructured":"Charalampopoulos, P., Pissis, S., Radoszewski, J.: Longest palindromic substring in sublinear time. In: CPM 2022, vol.\u00a0223, pp. 20:1\u201320:9 (2022)"},{"issue":"4","key":"19_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/270563.571472","volume":"28","author":"G Dan","year":"1997","unstructured":"Dan, G.: Algorithms on stings, trees, and sequences: computer science and computational biology. SIGACT News 28(4), 41\u201360 (1997)","journal-title":"SIGACT News"},{"issue":"11","key":"19_CR6","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1016\/S0168-9525(01)02492-1","volume":"17","author":"E Eichler","year":"2001","unstructured":"Eichler, E.: Recent duplication, domain accretion and the dynamic mutation of the human genome. Trends Genet. 17(11), 661\u2013669 (2001)","journal-title":"Trends Genet."},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1090\/S0002-9939-1965-0174934-9","volume":"16","author":"N Fine","year":"1965","unstructured":"Fine, N., Wilf, H.: Uniqueness theorems for periodic functions. Proc. Amer. Math. Soc. 16, 109\u2013114 (1965)","journal-title":"Proc. Amer. Math. Soc."},{"issue":"2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/j.bbrc.2003.09.014","volume":"310","author":"A Fuglsang","year":"2003","unstructured":"Fuglsang, A.: Distribution of potential type II restriction sites (palindromes) in prokaryotes. Biochem. Biophys. Res. Commun. 310(2), 280\u2013285 (2003)","journal-title":"Biochem. Biophys. Res. Commun."},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"2430","DOI":"10.1093\/nar\/25.12.2430","volume":"25","author":"M Gelfand","year":"1997","unstructured":"Gelfand, M., Koonin, E.: Avoidance of palindromic words in bacterial and archaeal genomes: a close connection with restriction enzymes. Nucleic Acids Res. 25, 2430\u20132439 (1997)","journal-title":"Nucleic Acids Res."},{"key":"19_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":"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. 6393, pp. 135\u2013146. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16321-0_13"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-319-07566-2_16","volume-title":"Combinatorial Pattern Matching","author":"T I","year":"2014","unstructured":"I, T., Sugimoto, S., Inenaga, S., Bannai, H., Takeda, M.: Computing palindromic factorizations and palindromic covers on-line. In: Kulikov, A.S., Kuznetsov, S.O., Pevzner, P. (eds.) CPM 2014. LNCS, vol. 8486, pp. 150\u2013161. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07566-2_16"},{"key":"19_CR12","unstructured":"Itzhaki, M.: Combinatorics of palindromes (2025). https:\/\/arxiv.org\/abs\/2507.13671"},{"issue":"6","key":"19_CR13","doi-asserted-by":"publisher","first-page":"1160","DOI":"10.1093\/molbev\/msh115","volume":"21","author":"Y Jialiang","year":"2004","unstructured":"Jialiang, Y., Louxin, Z.: On counting tandem duplication trees. Mol. Biol. Evol. 21(6), 1160\u20131163 (2004)","journal-title":"Mol. Biol. Evol."},{"issue":"2","key":"19_CR14","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/BF01182773","volume":"11","author":"J Johan","year":"1994","unstructured":"Johan, J.: The derivation of on-line algorithms, with an application to finding palindromes. Algorithmica 11(2), 146\u2013184 (1994)","journal-title":"Algorithmica"},{"key":"19_CR15","unstructured":"Knuth, D.E., Graham, R.L., Patashnik, O.: Concrete Mathematics: A Foundation for Computer Science, 2nd edn. Addison-Wesley (1994)"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D Knuth","year":"1977","unstructured":"Knuth, D., Morris, J., Pratt, V.: Fast pattern matching in strings. SIAM J. Comput. 6, 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"19_CR17","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s10623-018-0523-0","volume":"87","author":"A Lenz","year":"2019","unstructured":"Lenz, A., Wachter-Zeh, A., Yaakobi, E.: Duplication-correcting codes. Des. Codes Crypt. 87(2), 277\u2013298 (2019)","journal-title":"Des. Codes Crypt."},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s00294-005-0573-5","volume":"47","author":"B Lisnic","year":"2005","unstructured":"Lisnic, B., Svetec, I., Saric, H., Nikolic, I., Zgaga, Z.: Palindrome content of the yeast Saccharomyces cerevisiae genome. Curr. Genet. 47, 289\u2013297 (2005)","journal-title":"Curr. Genet."},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Manacher, G.: A new linear-time \u201con-line\u201d algorithm for finding the smallest initial palindrome of a string. J. ACM 22(3), 346\u2013351 (1975)","DOI":"10.1145\/321892.321896"},{"key":"19_CR20","unstructured":"Nagashita, S., I, T.: PalFM-index: FM-index for palindrome pattern matching. In: CPM 2023, vol.\u00a0259, pp. 23:1\u201323:15 (2023)"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Rubinchik, M., Shur, A.: EERTREE: an efficient data structure for processing palindromes in strings. In: Combinatorial Algorithms, pp. 321\u2013333 (2016)","DOI":"10.1007\/978-3-319-29516-9_27"},{"issue":"12","key":"19_CR22","doi-asserted-by":"publisher","first-page":"e52250","DOI":"10.1371\/journal.pone.0052250","volume":"7","author":"S Srivastava","year":"2012","unstructured":"Srivastava, S., Robins, H.: Palindromic nucleotide analysis in human T cell receptor rearrangements. PLoS ONE 7(12), e52250 (2012)","journal-title":"PLoS ONE"},{"key":"19_CR23","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/j.tcs.2019.10.027","volume":"812","author":"P Walen","year":"2020","unstructured":"Walen, P.: Universal reconstruction of a string. Theor. Comput. Sci. 812, 174\u2013186 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Zvi, G., Joel, S.: Recognizing certain repetitions and reversals within strings. In: 17th Annual Symposium on Foundations of Computer Science (SFCS 1976), pp. 236\u2013252 (1976)","DOI":"10.1109\/SFCS.1976.25"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-04700-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:40Z","timestamp":1758498340000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04700-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,11]]},"ISBN":["9783032046994","9783032047007"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-04700-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,11]]},"assertion":[{"value":"11 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wroc\u0142aw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/fct.ii.uni.wroc.pl","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}