{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T23:24:20Z","timestamp":1775949860085,"version":"3.50.1"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031630200","type":"print"},{"value":"9783031630217","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-63021-7_13","type":"book-chapter","created":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:02:29Z","timestamp":1718974949000},"page":"165-179","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Computing Maximal Palindromes in\u00a0Non-standard Matching Models"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2547-1509","authenticated-orcid":false,"given":"Mitsuru","family":"Funakoshi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2922-9434","authenticated-orcid":false,"given":"Takuya","family":"Mieno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6269-9353","authenticated-orcid":false,"given":"Yuto","family":"Nakashima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1833-010X","authenticated-orcid":false,"given":"Shunsuke","family":"Inenaga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6856-5185","authenticated-orcid":false,"given":"Hideo","family":"Bannai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6138-1607","authenticated-orcid":false,"given":"Masayuki","family":"Takeda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,22]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"Auvray, B., David, J., Groult, R., Lecroq, T.: Approximate Cartesian tree matching: an approach using swaps. In: Nardini, F.M., Pisanti, N., Venturini, R. (eds.) String Processing and Information Retrieval, SPIRE 2023, LNCS, vol. 14240, pp. 49\u201361. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-43980-3_5","DOI":"10.1007\/978-3-031-43980-3_5"},{"key":"13_CR2","doi-asserted-by":"publisher","unstructured":"Baker, B.S.: A theory of parameterized pattern matching: algorithms and applications. In: 25th Annual ACM Symposium on Theory of Computing, ACM 1993, pp. 71\u201380. ACM (1993). https:\/\/doi.org\/10.1145\/167088.167115","DOI":"10.1145\/167088.167115"},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1006\/jcss.1996.0003","volume":"52","author":"BS Baker","year":"1996","unstructured":"Baker, B.S.: Parameterized pattern matching: algorithms and applications. J. Comput. Syst. Sci. 52(1), 28\u201342 (1996). https:\/\/doi.org\/10.1006\/jcss.1996.0003","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/10719839_9","volume-title":"LATIN 2000: Theoretical Informatics","author":"MA Bender","year":"2000","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 88\u201394. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10719839_9"},{"issue":"6","key":"13_CR5","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1145\/355541.355547","volume":"47","author":"M Farach-Colton","year":"2000","unstructured":"Farach-Colton, M., Ferragina, P., Muthukrishnan, S.: On the sorting-complexity of suffix tree construction. J. ACM 47(6), 987\u20131011 (2000). https:\/\/doi.org\/10.1145\/355541.355547","journal-title":"J. ACM"},{"issue":"4","key":"13_CR6","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1093\/COMJNL\/BXAB204","volume":"66","author":"S Faro","year":"2023","unstructured":"Faro, S., Lecroq, T., Park, K., Scafiti, S.: On the longest common Cartesian substring problem. Comput. J. 66(4), 907\u2013923 (2023). https:\/\/doi.org\/10.1093\/COMJNL\/BXAB204","journal-title":"Comput. J."},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Gawrychowski, P., Ghazawi, S., Landau, G.M.: On indeterminate strings matching. In: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark. LIPIcs, vol.\u00a0161, pp. 14:1\u201314:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPICS.CPM.2020.14","DOI":"10.4230\/LIPICS.CPM.2020.14"},{"key":"13_CR8","doi-asserted-by":"publisher","unstructured":"Gawrychowski, P., Ghazawi, S., Landau, G.M.: Order-preserving squares in strings. In: 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, 26\u201328 June 2023, Marne-la-Vall\u00e9e, France. LIPIcs, vol.\u00a0259, pp. 13:1\u201313:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPICS.CPM.2023.13","DOI":"10.4230\/LIPICS.CPM.2023.13"},{"key":"13_CR9","doi-asserted-by":"publisher","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997). https:\/\/doi.org\/10.1017\/cbo9780511574931","DOI":"10.1017\/cbo9780511574931"},{"issue":"2","key":"13_CR10","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM J. Comput. 13(2), 338\u2013355 (1984). https:\/\/doi.org\/10.1137\/0213024","journal-title":"SIAM J. Comput."},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-030-39881-1_11","volume-title":"WALCOM: Algorithms and Computation","author":"D Hendrian","year":"2020","unstructured":"Hendrian, D.: Generalized dictionary matching under substring consistent equivalence relations. In: Rahman, M.S., Sadakane, K., Sung, W.-K. (eds.) WALCOM 2020. LNCS, vol. 12049, pp. 120\u2013132. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-39881-1_11"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Palindrome pattern matching: I, T., Inenaga, S., Takeda, M. Theor. Comput. Sci. 483, 162\u2013170 (2013). https:\/\/doi.org\/10.1016\/j.tcs.2012.01.047","DOI":"10.1016\/j.tcs.2012.01.047"},{"key":"13_CR13","doi-asserted-by":"publisher","unstructured":"Jargalsaikhan, D., Hendrian, D., Yoshinaka, R., Shinohara, A.: Parallel algorithm for pattern matching problems under substring consistent equivalence relations. In: 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022. LIPIcs, vol.\u00a0223, pp. 28:1\u201328:21. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2022.28","DOI":"10.4230\/LIPIcs.CPM.2022.28"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-540-77962-9_29","volume-title":"DNA Computing","author":"L Kari","year":"2008","unstructured":"Kari, L., Mahalingam, K.: Watson-Crick conjugate and commutative words. In: Garzon, M.H., Yan, H. (eds.) DNA 2007. LNCS, vol. 4848, pp. 273\u2013283. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77962-9_29"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-030-59212-7_10","volume-title":"String Processing and Information Retrieval","author":"N Kikuchi","year":"2020","unstructured":"Kikuchi, N., Hendrian, D., Yoshinaka, R., Shinohara, A.: Computing covers under substring consistent equivalence relations. In: Boucher, C., Thankachan, S.V. (eds.) SPIRE 2020. LNCS, vol. 12303, pp. 131\u2013146. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59212-7_10"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.tcs.2013.10.006","volume":"525","author":"J Kim","year":"2014","unstructured":"Kim, J., Eades, P., Fleischer, R., Hong, S., Iliopoulos, C.S., Park, K., Puglisi, S.J., Tokuyama, T.: Order-preserving matching. Theor. Comput. Sci. 525, 68\u201379 (2014). https:\/\/doi.org\/10.1016\/j.tcs.2013.10.006","journal-title":"Theor. Comput. Sci."},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Kim, S., Cho, H.: A compact index for Cartesian tree matching. In: 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wroc\u0142aw, Poland. LIPIcs, vol.\u00a0191, pp. 18:1\u201318:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPICS.CPM.2021.18","DOI":"10.4230\/LIPICS.CPM.2021.18"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.tcs.2016.08.010","volume":"648","author":"T Kociumaka","year":"2016","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W., Walen, T.: Maximum number of distinct and nonequivalent nonstandard squares in a word. Theor. Comput. Sci. 648, 84\u201395 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2016.08.010","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"13_CR19","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.tcs.2006.07.009","volume":"362","author":"A de Luca","year":"2006","unstructured":"de Luca, A., Luca, A.D.: Pseudopalindrome closure operators in free monoids. Theor. Comput. Sci. 362(1\u20133), 282\u2013300 (2006). https:\/\/doi.org\/10.1016\/j.tcs.2006.07.009","journal-title":"Theor. Comput. Sci."},{"key":"13_CR20","doi-asserted-by":"publisher","unstructured":"Manacher, G.K.: A new linear-time \u201con-line\u201d algorithm for finding the smallest initial palindrome of a string. J. ACM 22(3), 346\u2013351 (1975). https:\/\/doi.org\/10.1145\/321892.321896","DOI":"10.1145\/321892.321896"},{"key":"13_CR21","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.tcs.2016.02.017","volume":"656","author":"Y Matsuoka","year":"2016","unstructured":"Matsuoka, Y., Aoki, T., Inenaga, S., Bannai, H., Takeda, M.: Generalized pattern matching and periodicity under substring consistent equivalence relations. Theor. Comput. Sci. 656, 225\u2013233 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2016.02.017","journal-title":"Theor. Comput. Sci."},{"key":"13_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-030-86692-1_20","volume-title":"String Processing and Information Retrieval","author":"A Nishimoto","year":"2021","unstructured":"Nishimoto, A., Fujisato, N., Nakashima, Y., Inenaga, S.: Position heaps for Cartesian-tree matching on strings and tries. In: Lecroq, T., Touzet, H. (eds.) SPIRE 2021. LNCS, vol. 12944, pp. 241\u2013254. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86692-1_20"},{"key":"13_CR23","doi-asserted-by":"publisher","unstructured":"Oizumi, T., Kai, T., Mieno, T., Inenaga, S., Arimura, H.: Cartesian tree subsequence matching. In: 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, 27-29 June 2022, Prague, Czech Republic. LIPIcs, vol.\u00a0223, pp. 14:1\u201314:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPICS.CPM.2022.14","DOI":"10.4230\/LIPICS.CPM.2022.14"},{"key":"13_CR24","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.tcs.2020.09.014","volume":"845","author":"SG Park","year":"2020","unstructured":"Park, S.G., Bataa, M., Amir, A., Landau, G.M., Park, K.: Finding patterns and periods in Cartesian tree matching. Theor. Comput. Sci. 845, 181\u2013197 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2020.09.014","journal-title":"Theor. Comput. Sci."},{"key":"13_CR25","doi-asserted-by":"publisher","unstructured":"Pei, J., Wu, W.C., Yeh, M.: On shortest unique substring queries. In: 29th IEEE International Conference on Data Engineering, ICDE 2013, Brisbane, Australia, 8\u201312 April 2013, pp. 937\u2013948. IEEE Computer Society (2013). https:\/\/doi.org\/10.1109\/ICDE.2013.6544887","DOI":"10.1109\/ICDE.2013.6544887"},{"issue":"6","key":"13_CR26","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B Schieber","year":"1988","unstructured":"Schieber, B., Vishkin, U.: On finding lowest common ancestors: simplification and parallelization. SIAM J. Comput. 17(6), 1253\u20131262 (1988). https:\/\/doi.org\/10.1137\/0217079","journal-title":"SIAM J. Comput."},{"key":"13_CR27","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/J.TCS.2020.10.009","volume":"849","author":"S Song","year":"2021","unstructured":"Song, S., Gu, G., Ryu, C., Faro, S., Lecroq, T., Park, K.: Fast algorithms for single and multiple pattern Cartesian tree matching. Theor. Comput. Sci. 849, 47\u201363 (2021). https:\/\/doi.org\/10.1016\/J.TCS.2020.10.009","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"13_CR28","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/358841.358852","volume":"23","author":"J Vuillemin","year":"1980","unstructured":"Vuillemin, J.: A unifying look at data structures. Commun. ACM 23(4), 229\u2013239 (1980). https:\/\/doi.org\/10.1145\/358841.358852","journal-title":"Commun. ACM"},{"key":"13_CR29","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1038\/171737a0","volume":"171","author":"JD Watson","year":"1953","unstructured":"Watson, J.D., Crick, F.H.: Molecular structure of nucleic acids: a structure for deoxyribose nucleic acid. Nature 171, 737\u2013738 (1953). https:\/\/doi.org\/10.1038\/171737a0","journal-title":"Nature"},{"key":"13_CR30","doi-asserted-by":"publisher","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: 14th Annual Symposium on Switching and Automata Theory, SWAT 1973, pp. 1\u201311. IEEE Computer Society (1973). https:\/\/doi.org\/10.1109\/SWAT.1973.13","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-63021-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:11:54Z","timestamp":1718975514000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63021-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031630200","9783031630217"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63021-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ischia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwoca2024.di.unisa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}