{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T17:25:33Z","timestamp":1768584333844,"version":"3.49.0"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031066771","type":"print"},{"value":"9783031066788","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-06678-8_31","type":"book-chapter","created":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:03:31Z","timestamp":1653779011000},"page":"425-438","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2922-9434","authenticated-orcid":false,"given":"Takuya","family":"Mieno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2547-1509","authenticated-orcid":false,"given":"Mitsuru","family":"Funakoshi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,29]]},"reference":[{"key":"31_CR1","doi-asserted-by":"publisher","unstructured":"Abedin, P., Hooshmand, S., Ganguly, A., Thankachan, S.V.: The heaviest induced ancestors problem: better data structures and applications. Algorithmica (2022). https:\/\/doi.org\/10.1007\/s00453-022-00955-7","DOI":"10.1007\/s00453-022-00955-7"},{"key":"31_CR2","doi-asserted-by":"publisher","unstructured":"Alstrup, S., Husfeldt, T., Rauhe, T.: Marked ancestor problems. In: 39th Annual Symposium on Foundations of Computer Science, FOCS 1998, 8\u201311 November 1998, Palo Alto, California, USA, pp. 534\u2013544. IEEE Computer Society (1998). https:\/\/doi.org\/10.1109\/SFCS.1998.743504","DOI":"10.1109\/SFCS.1998.743504"},{"key":"31_CR3","unstructured":"Amir, A., Boneh, I.: Dynamic palindrome detection. CoRR abs\/1906.09732 (2019). http:\/\/arxiv.org\/abs\/1906.09732"},{"key":"31_CR4","doi-asserted-by":"publisher","unstructured":"Amir, A., Boneh, I., Charalampopoulos, P., Kondratovsky, E.: Repetition detection in a dynamic string. In: Bender, M.A., Svensson, O., Herman, G. (eds.) 27th Annual European Symposium on Algorithms, ESA 2019, 9\u201311 September 2019, Munich\/Garching, Germany. LIPIcs, vol. 144, pp. 5:1\u20135:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2019.5","DOI":"10.4230\/LIPIcs.ESA.2019.5"},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-319-67428-5_2","volume-title":"String Processing and Information Retrieval","author":"A Amir","year":"2017","unstructured":"Amir, A., Charalampopoulos, P., Iliopoulos, C.S., Pissis, S.P., Radoszewski, J.: Longest common factor after one edit operation. In: Fici, G., Sciortino, M., Venturini, R. (eds.) SPIRE 2017. LNCS, vol. 10508, pp. 14\u201326. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67428-5_2"},{"issue":"12","key":"31_CR6","doi-asserted-by":"publisher","first-page":"3707","DOI":"10.1007\/s00453-020-00744-0","volume":"82","author":"A Amir","year":"2020","unstructured":"Amir, A., Charalampopoulos, P., Pissis, S.P., Radoszewski, J.: Dynamic and internal longest common substring. Algorithmica 82(12), 3707\u20133743 (2020). https:\/\/doi.org\/10.1007\/s00453-020-00744-0","journal-title":"Algorithmica"},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-642-22300-6_25","volume-title":"Algorithms and Data Structures","author":"GS Brodal","year":"2011","unstructured":"Brodal, G.S., Davoodi, P., Srinivasa Rao, S.: Path minima queries in dynamic weighted trees. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol. 6844, pp. 290\u2013301. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22300-6_25"},{"key":"31_CR8","doi-asserted-by":"publisher","unstructured":"Charalampopoulos, P., Gawrychowski, P., Pokorski, K.: Dynamic longest common substring in polylogarithmic time. In: Czumaj, A., Dawar, A., Merelli, E. (eds.) 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, 8\u201311 July 2020, Saarbr\u00fccken, Germany (Virtual Conference). LIPIcs, vol. 168, pp. 27:1\u201327:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2020.27","DOI":"10.4230\/LIPIcs.ICALP.2020.27"},{"issue":"4","key":"31_CR9","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1109\/TCOM.1984.1096090","volume":"32","author":"JG Cleary","year":"1984","unstructured":"Cleary, J.G., Witten, I.H.: Data compression using adaptive coding and partial string matching. IEEE Trans. Commun. 32(4), 396\u2013402 (1984). https:\/\/doi.org\/10.1109\/TCOM.1984.1096090","journal-title":"IEEE Trans. Commun."},{"key":"31_CR10","doi-asserted-by":"publisher","unstructured":"Crochemore, M., H\u00e9liou, A., Kucherov, G., Mouchard, L., Pissis, S.P., Ramusat, Y.: Absent words in a sliding window with applications. Inf. Comput. 270 (2020). https:\/\/doi.org\/10.1016\/j.ic.2019.104461","DOI":"10.1016\/j.ic.2019.104461"},{"issue":"3","key":"31_CR11","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","volume":"6","author":"P van Emde Boas","year":"1977","unstructured":"van Emde Boas, P.: Preserving order in a forest in less than logarithmic time and linear space. Inf. Process. Lett. 6(3), 80\u201382 (1977). https:\/\/doi.org\/10.1016\/0020-0190(77)90031-X","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"31_CR12","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1145\/63334.63341","volume":"32","author":"ER Fiala","year":"1989","unstructured":"Fiala, E.R., Greene, D.H.: Data compression with finite windows. Commun. ACM 32(4), 490\u2013505 (1989). https:\/\/doi.org\/10.1145\/63334.63341","journal-title":"Commun. ACM"},{"issue":"1","key":"31_CR13","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1090\/S0002-9939-1965-0174934-9","volume":"16","author":"NJ Fine","year":"1965","unstructured":"Fine, N.J., Wilf, H.S.: Uniqueness theorems for periodic functions. Proc. Am. Math. Soc. 16(1), 109\u2013114 (1965). https:\/\/doi.org\/10.1090\/S0002-9939-1965-0174934-9","journal-title":"Proc. Am. Math. Soc."},{"key":"31_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-030-86692-1_4","volume-title":"String Processing and Information Retrieval","author":"M Funakoshi","year":"2021","unstructured":"Funakoshi, M., Mieno, T.: Minimal unique palindromic substrings after single-character substitution. In: Lecroq, T., Touzet, H. (eds.) SPIRE 2021. LNCS, vol. 12944, pp. 33\u201346. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86692-1_4"},{"key":"31_CR15","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.tcs.2021.01.014","volume":"859","author":"M Funakoshi","year":"2021","unstructured":"Funakoshi, M., Nakashima, Y., Inenaga, S., Bannai, H., Takeda, M.: Computing longest palindromic substring after single-character or block-wise edits. Theor. Comput. Sci. 859, 116\u2013133 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2021.01.014","journal-title":"Theor. Comput. Sci."},{"key":"31_CR16","doi-asserted-by":"publisher","unstructured":"Gawrychowski, P., Karczmarz, A., Kociumaka, T., Lacki, J., Sankowski, P.: Optimal dynamic strings. In: Czumaj, A. (ed.) Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, 7\u201310 January 2018, pp. 1509\u20131528. SIAM (2018). https:\/\/doi.org\/10.1137\/1.9781611975031.99","DOI":"10.1137\/1.9781611975031.99"},{"issue":"9","key":"31_CR17","doi-asserted-by":"publisher","first-page":"3630","DOI":"10.1007\/s00453-019-00591-8","volume":"81","author":"P Gawrychowski","year":"2019","unstructured":"Gawrychowski, P., Merkurev, O., Shur, A.M., Uzna\u0144ski, P.: Tight tradeoffs for real-time approximation of longest palindromes in streams. Algorithmica 81(9), 3630\u20133654 (2019). https:\/\/doi.org\/10.1007\/s00453-019-00591-8","journal-title":"Algorithmica"},{"key":"31_CR18","doi-asserted-by":"publisher","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology. Cambridge University Press (1997). https:\/\/doi.org\/10.1017\/cbo9780511574931","DOI":"10.1017\/cbo9780511574931"},{"key":"31_CR19","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jda.2018.11.009","volume":"52\u201353","author":"H Inoue","year":"2018","unstructured":"Inoue, H., Nakashima, Y., Mieno, T., Inenaga, S., Bannai, H., Takeda, M.: Algorithms and combinatorial properties on shortest unique palindromic substrings. J. Discrete Algorithms 52\u201353, 122\u2013132 (2018). https:\/\/doi.org\/10.1016\/j.jda.2018.11.009","journal-title":"J. Discrete Algorithms"},{"key":"31_CR20","unstructured":"Kempa, D., Kociumaka, T.: Dynamic suffix array with polylogarithmic queries and updates. CoRR abs\/2201.01285 (2021). https:\/\/arxiv.org\/abs\/2201.01285"},{"key":"31_CR21","doi-asserted-by":"publisher","unstructured":"Kuramoto, E., et al.: Oligonucleotide sequences required for natural killer cell activation. Jpn. J. Cancer Res. 83(11), 1128\u20131131 (1992). https:\/\/doi.org\/10.1111\/j.1349-7006.1992.tb02734.x","DOI":"10.1111\/j.1349-7006.1992.tb02734.x"},{"key":"31_CR22","doi-asserted-by":"publisher","unstructured":"Larsson, N.J.: Extended application of suffix trees to data compression. In: Storer, J.A., Cohn, M. (eds.) Proceedings of the 6th Data Compression Conference (DCC 1996), Snowbird, Utah, USA, 31 March\u20133 April 1996, pp. 190\u2013199. IEEE Computer Society (1996). https:\/\/doi.org\/10.1109\/DCC.1996.488324","DOI":"10.1109\/DCC.1996.488324"},{"issue":"3","key":"31_CR23","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1145\/321892.321896","volume":"22","author":"GK Manacher","year":"1975","unstructured":"Manacher, G.K.: A new linear-time \u201con-line\u2019\u2019 algorithm for finding the smallest initial palindrome of a string. J. ACM 22(3), 346\u2013351 (1975). https:\/\/doi.org\/10.1145\/321892.321896","journal-title":"J. ACM"},{"key":"31_CR24","doi-asserted-by":"publisher","unstructured":"Mieno, T., Fujishige, Y., Nakashima, Y., Inenaga, S., Bannai, H., Takeda, M.: Computing minimal unique substrings for a sliding window. Algorithmica (9), 1\u201324 (2021). https:\/\/doi.org\/10.1007\/s00453-021-00864-1","DOI":"10.1007\/s00453-021-00864-1"},{"key":"31_CR25","doi-asserted-by":"publisher","unstructured":"Mieno, T., Watanabe, K., Nakashima, Y., Inenaga, S., Bannai, H., Takeda, M.: Palindromic trees for a sliding window and its applications. Inf. Process. Lett. 173, 106174 (2022). https:\/\/doi.org\/10.1016\/j.ipl.2021.106174","DOI":"10.1016\/j.ipl.2021.106174"},{"key":"31_CR26","doi-asserted-by":"publisher","unstructured":"Nakashima, Y., Inoue, H., Mieno, T., Inenaga, S., Bannai, H., Takeda, M.: Shortest unique palindromic substring queries in optimal time. In: Brankovic, L., Ryan, J., Smyth, W.F. (eds.) IWOCA 2017. LNCS, vol. 10765, pp. 397\u2013408. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78825-8_32","DOI":"10.1007\/978-3-319-78825-8_32"},{"key":"31_CR27","unstructured":"Senft, M.: Suffix tree for a sliding window: an overview. In: WDS 2005, pp. 41\u201346 (2005)"},{"key":"31_CR28","doi-asserted-by":"publisher","unstructured":"Ukkonen, E.: On-line construction of suffix trees. Algorithmica 14(3), 249\u2013260 (1995). https:\/\/doi.org\/10.1007\/BF01206331","DOI":"10.1007\/BF01206331"},{"key":"31_CR29","doi-asserted-by":"publisher","unstructured":"Urabe, Y., Nakashima, Y., Inenaga, S., Bannai, H., Takeda, M.: Longest Lyndon substring after edit. In: Navarro, G., Sankoff, D., Zhu, B. (eds.) Annual Symposium on Combinatorial Pattern Matching, CPM 2018, 2\u20134 July 2018, Qingdao, China. LIPIcs, vol. 105, pp. 19:1\u201319:10. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2018.19","DOI":"10.4230\/LIPIcs.CPM.2018.19"},{"key":"31_CR30","doi-asserted-by":"publisher","unstructured":"Watanabe, K., Nakashima, Y., Inenaga, S., Bannai, H., Takeda, M.: Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings. Theory Comput. Syst. 64(7), 1273\u20131291 (2020). https:\/\/doi.org\/10.1007\/s00224-020-09980-x","DOI":"10.1007\/s00224-020-09980-x"},{"key":"31_CR31","doi-asserted-by":"crossref","unstructured":"Yamamoto, S., Yamamoto, T., Kataoka, T., Kuramoto, E., Yano, O., Tokunaga, T.: Unique palindromic sequences in synthetic oligonucleotides are required to induce IFN [correction of INF] and augment IFN-mediated [correction of INF] natural killer activity. J. Immunol. 148(12), 4072\u20134076 (1992). https:\/\/www.jimmunol.org\/content\/148\/12\/4072","DOI":"10.4049\/jimmunol.148.12.4072"},{"key":"31_CR32","doi-asserted-by":"publisher","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory 23(3), 337\u2013343 (1977). https:\/\/doi.org\/10.1109\/TIT.1977.1055714","DOI":"10.1109\/TIT.1977.1055714"}],"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-06678-8_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T17:01:28Z","timestamp":1675702888000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06678-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031066771","9783031066788"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06678-8_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 May 2022","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":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.informatik.uni-trier.de\/iwoca-2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"86","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}