{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T09:01:06Z","timestamp":1762074066793,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031206429"},{"type":"electronic","value":"9783031206436"}],"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-20643-6_2","type":"book-chapter","created":{"date-parts":[[2022,10,31]],"date-time":"2022-10-31T13:18:09Z","timestamp":1667222289000},"page":"16-23","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Maximal Closed Substrings"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5550-7149","authenticated-orcid":false,"given":"Golnaz","family":"Badkobeh","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1704-773X","authenticated-orcid":false,"given":"Alessandro","family":"De Luca","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3536-327X","authenticated-orcid":false,"given":"Gabriele","family":"Fici","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7668-7636","authenticated-orcid":false,"given":"Simon J.","family":"Puglisi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,1]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-319-15579-1_29","volume-title":"Language and Automata Theory and Applications","author":"G Badkobeh","year":"2015","unstructured":"Badkobeh, G., Fici, G., Lipt\u00e1k, Z.: On the number of closed factors in a word. In: Dediu, A.-H., Formenti, E., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2015. LNCS, vol. 8977, pp. 381\u2013390. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-15579-1_29"},{"issue":"5","key":"2_CR2","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1137\/15M1011032","volume":"46","author":"HIT Bannai","year":"2017","unstructured":"Bannai, H.I.T., Inenaga, S., Nakashima, Y., Takeda, M., Tsuruta, K.: The \u201cruns\u2019\u2019 theorem. SIAM J. Comput. 46(5), 1501\u20131514 (2017)","journal-title":"SIAM J. Comput."},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/3-540-48452-3_11","volume-title":"Combinatorial Pattern Matching","author":"GS Brodal","year":"1999","unstructured":"Brodal, G.S., Lyngs\u00f8, R.B., Pedersen, C.N.S., Stoye, J.: Finding maximal pairs with bounded gap. In: Crochemore, M., Paterson, M. (eds.) CPM 1999. LNCS, vol. 1645, pp. 134\u2013149. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48452-3_11"},{"issue":"2","key":"2_CR4","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1145\/322123.322127","volume":"26","author":"MR Brown","year":"1979","unstructured":"Brown, M.R., Tarjan, R.E.: A fast merging algorithm. J. ACM 26(2), 211\u2013226 (1979)","journal-title":"J. ACM"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.tcs.2012.11.007","volume":"468","author":"M Bucci","year":"2013","unstructured":"Bucci, M., De Luca, A., Fici, G.: Enumeration and structure of trapezoidal words. Theor. Comput. Sci. 468, 12\u201322 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"8","key":"2_CR6","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/PL00013314","volume":"37","author":"A Carpi","year":"2001","unstructured":"Carpi, A., de Luca, A.: Periodic-like words, periodicity, and boxes. Acta Informatica 37(8), 597\u2013618 (2001). https:\/\/doi.org\/10.1007\/PL00013314","journal-title":"Acta Informatica"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.aam.2017.04.007","volume":"90","author":"A De Luca","year":"2017","unstructured":"De Luca, A., Fici, G., Zamboni, L.Q.: The sequence of open and closed prefixes of a Sturmian word. Adv. Appl. Math. 90, 27\u201345 (2017)","journal-title":"Adv. Appl. Math."},{"key":"2_CR8","first-page":"140","volume":"123","author":"G Fici","year":"2017","unstructured":"Fici, G.: Open and Closed Words. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 123, 140\u2013149 (2017)","journal-title":"Bull. Eur. Assoc. Theor. Comput. Sci. EATCS"},{"issue":"1","key":"2_CR9","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. P. Am. Math. Soc. 16(1), 109\u2013114 (1965)","journal-title":"P. Am. Math. Soc."},{"issue":"1","key":"2_CR10","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/s00224-017-9794-5","volume":"62","author":"P Gawrychowski","year":"2017","unstructured":"Gawrychowski, P., I, T., Inenaga, S., K\u00f6ppl, D., Manea, F.: Tighter bounds and optimal algorithms for all maximal $$\\alpha $$-gapped repeats and palindromes. Theor. Comput. Syst. 62(1), 162\u2013191 (2017). https:\/\/doi.org\/10.1007\/s00224-017-9794-5","journal-title":"Theor. Comput. Syst."},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-07566-2_22","volume":"46\u201347","author":"R Kolpakov","year":"2017","unstructured":"Kolpakov, R., Podolskiy, M., Posypkin, M., Khrapov, N.: Searching of gapped repeats and subrepetitions in a word. J. Discrete Algorithms 46\u201347, 1\u201315 (2017). https:\/\/doi.org\/10.1007\/978-3-319-07566-2_22","journal-title":"J. Discrete Algorithms"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Kolpakov, R.M., Kucherov, G.: Finding maximal repetitions in a word in linear time. In: 40th Annual Symposium on Foundations of Computer Science, FOCS 1999, 17\u201318 October 1999, New York, NY, USA, pp. 596\u2013604. IEEE Computer Society (1999)","DOI":"10.1109\/SFFCS.1999.814634"},{"key":"2_CR13","unstructured":"Morris, J.H., Pratt, V.R.: A linear pattern-matching algorithm. Technical Report 40, University of California, Berkeley (1970)"}],"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-031-20643-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,6]],"date-time":"2024-10-06T22:52:38Z","timestamp":1728255158000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20643-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031206429","9783031206436"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20643-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 November 2022","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":"Concepci\u00f3n","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chile","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":"8 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spire2022.inf.udec.cl\/","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":"43","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":"23","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":"53% - 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":"3.62","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)"}}]}}