{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T17:22:35Z","timestamp":1768584155695,"version":"3.49.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030866914","type":"print"},{"value":"9783030866921","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-86692-1_4","type":"book-chapter","created":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T21:24:41Z","timestamp":1632777881000},"page":"33-46","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Minimal Unique Palindromic Substrings After Single-Character Substitution"],"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"}]}],"member":"297","published-online":{"date-parts":[[2021,9,27]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"Abedin, P., Hooshmand, S., Ganguly, A., Thankachan, S.V.: The heaviest induced ancestors problem revisited. 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. 20:1\u201320:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2018.20","DOI":"10.4230\/LIPIcs.CPM.2018.20"},{"key":"4_CR2","unstructured":"Amir, A., Boneh, I.: Dynamic palindrome detection. CoRR abs\/1906.09732 (2019). arXiv:1906.09732"},{"key":"4_CR3","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":"4_CR4","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"},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"Amir, A., Charalampopoulos, P., Pissis, S.P., Radoszewski, J.: Longest common substring made fully dynamic. 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. 6:1\u20136:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2019.6","DOI":"10.4230\/LIPIcs.ESA.2019.6"},{"issue":"1&2","key":"4_CR6","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0304-3975(94)00083-U","volume":"141","author":"A Apostolico","year":"1995","unstructured":"Apostolico, A., Breslauer, D., Galil, Z.: Parallel detection of all palindromes in a string. Theor. Comput. Sci. 141(1 & 2), 163\u2013173 (1995). https:\/\/doi.org\/10.1016\/0304-3975(94)00083-U","journal-title":"Theor. Comput. Sci."},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.tcs.2015.08.009","volume":"638","author":"P Bille","year":"2016","unstructured":"Bille, P., Gawrychowski, P., G\u00f8rtz, I.L., Landau, G.M., Weimann, O.: Longest common extensions in trees. Theor. Comput. Sci. 638, 98\u2013107 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2015.08.009","journal-title":"Theor. Comput. Sci."},{"key":"4_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":"1\u20132","key":"4_CR9","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. Theor. Comput. Sci. 255(1\u20132), 539\u2013553 (2001). https:\/\/doi.org\/10.1016\/S0304-3975(99)00320-5","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"4_CR10","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"},{"key":"4_CR11","unstructured":"Funakoshi, M., Mieno, T.: Minimal unique palindromic substrings after single-character substitution. CoRR abs\/2105.11693 (2021). https:\/\/arxiv.org\/abs\/2105.11693"},{"key":"4_CR12","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."},{"issue":"1","key":"4_CR13","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/s00224-017-9794-5","volume":"62","author":"P Gawrychowski","year":"2017","unstructured":"Gawrychowski, P., Tomohiro, I., Inenaga, S., K\u00f6ppl, D., Manea, F.: Tighter bounds and optimal algorithms for all maximal $${{\\alpha }}$$-gapped repeats and palindromes. Theory of Computing Systems 62(1), 162\u2013191 (2017). https:\/\/doi.org\/10.1007\/s00224-017-9794-5","journal-title":"Theory of Computing Systems"},{"key":"4_CR14","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":"4_CR15","doi-asserted-by":"publisher","unstructured":"Kociumaka, T., Kubica, M., Radoszewski, J., Rytter, W., Walen, T.: A linear-time algorithm for seeds computation. ACM Trans. Algorithms 16(2), 27:1\u201327:23 (2020). https:\/\/doi.org\/10.1145\/3386369","DOI":"10.1145\/3386369"},{"issue":"3","key":"4_CR16","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"},{"issue":"8\u201310","key":"4_CR17","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1016\/j.tcs.2008.12.016","volume":"410","author":"W Matsubara","year":"2009","unstructured":"Matsubara, W., Inenaga, S., Ishino, A., Shinohara, A., Nakamura, T., Hashimoto, K.: Efficient algorithms to compute compressed longest common substrings and compressed palindromes. Theor. Comput. Sci. 410(8\u201310), 900\u2013913 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2008.12.016","journal-title":"Theor. Comput. Sci."},{"key":"4_CR18","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., 106174 (2021). https:\/\/doi.org\/10.1016\/j.ipl.2021.106174. ISSN 0020-0190","DOI":"10.1016\/j.ipl.2021.106174"},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.ejc.2017.07.021","volume":"68","author":"M Rubinchik","year":"2018","unstructured":"Rubinchik, M., Shur, A.M.: EERTREE: an efficient data structure for processing palindromes in strings. Eur. J. Comb. 68, 249\u2013265 (2018). https:\/\/doi.org\/10.1016\/j.ejc.2017.07.021","journal-title":"Eur. J. Comb."},{"key":"4_CR20","doi-asserted-by":"publisher","unstructured":"Rubinchik, M., Shur, A.M.: Palindromic k-factorization in pure linear time. In: Esparza, J., Kr\u00e1l\u2019, D. (eds.) 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, 24\u201328 August 2020, Prague, Czech Republic. LIPIcs, vol. 170, pp. 81:1\u201381:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2020.81","DOI":"10.4230\/LIPIcs.MFCS.2020.81"},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-642-10631-6_18","volume-title":"Algorithms and Computation","author":"JM Schmidt","year":"2009","unstructured":"Schmidt, J.M.: Interval stabbing problems in small integer ranges. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 163\u2013172. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10631-6_18"},{"key":"4_CR22","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"},{"issue":"7","key":"4_CR23","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1007\/s00224-020-09980-x","volume":"64","author":"K Watanabe","year":"2020","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","journal-title":"Theory Comput. Syst."},{"key":"4_CR24","doi-asserted-by":"publisher","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: 14th Annual Symposium on Switching and Automata Theory, Iowa City, Iowa, USA, 15\u201317 October 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","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86692-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T21:26:04Z","timestamp":1632777964000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86692-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030866914","9783030866921"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86692-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"27 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SPIRE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on String Processing and Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lille","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cristal.univ-lille.fr\/spire2021\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","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":"14","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":"4","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":"47% - 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.87","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":"2.32","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)"}},{"value":"2 invited papers are also included. The symposium was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}