{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:51:21Z","timestamp":1742964681422,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031826962"},{"type":"electronic","value":"9783031826979"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-82697-9_13","type":"book-chapter","created":{"date-parts":[[2025,2,15]],"date-time":"2025-02-15T10:17:56Z","timestamp":1739614676000},"page":"172-183","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Online and\u00a0Offline Algorithms for\u00a0Counting Distinct Closed Factors via\u00a0Sliding Suffix Trees"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2922-9434","authenticated-orcid":false,"given":"Takuya","family":"Mieno","sequence":"first","affiliation":[]},{"given":"Shun","family":"Takahashi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9043-7019","authenticated-orcid":false,"given":"Kazuhisa","family":"Seto","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9451-259X","authenticated-orcid":false,"given":"Takashi","family":"Horiyama","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,16]]},"reference":[{"issue":"5","key":"13_CR1","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1142\/S0129054120500288","volume":"31","author":"H Alamro","year":"2020","unstructured":"Alamro, H., Alzamel, M., Iliopoulos, C.S., Pissis, S.P., Sung, W., Watts, S.: Efficient identification of k-closed strings. Int. J. Found. Comput. Sci. 31(5), 595\u2013610 (2020). https:\/\/doi.org\/10.1142\/S0129054120500288","journal-title":"Int. J. Found. Comput. Sci."},{"key":"13_CR2","doi-asserted-by":"publisher","unstructured":"Alzamel, M., Iliopoulos, C.S., Smyth, W.F., Sung, W.: Off-line and on-line algorithms for closed string factorization. Theor. Comput. Sci. 792, 12\u201319 (2019). https:\/\/doi.org\/10.1016\/J.TCS.2018.10.033","DOI":"10.1016\/J.TCS.2018.10.033"},{"key":"13_CR3","unstructured":"Badkobeh, G., et al.: Closed factorization. In: Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, September 1-3, 2014, pp. 162\u2013168. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague (2014). http:\/\/www.stringology.org\/event\/2014\/p15.html"},{"key":"13_CR4","doi-asserted-by":"publisher","unstructured":"Badkobeh, G., et al.: Closed factorization. Discret. Appl. Math. 212, 23\u201329 (2016). https:\/\/doi.org\/10.1016\/J.DAM.2016.04.009","DOI":"10.1016\/J.DAM.2016.04.009"},{"key":"13_CR5","doi-asserted-by":"publisher","unstructured":"Badkobeh, G., Fici, G., Lipt\u00e1k, Z.: On the number of closed factors in a word. In: Language and Automata Theory and Applications - 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings. Lecture Notes in Computer Science, vol.\u00a08977, pp. 381\u2013390. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-319-15579-1_29","DOI":"10.1007\/978-3-319-15579-1_29"},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"Badkobeh, G., Luca, A.D., Fici, G., Puglisi, S.J.: Maximal closed substrings. In: String Processing and Information Retrieval - 29th International Symposium, SPIRE 2022, Concepci\u00f3n, Chile, November 8-10, 2022, Proceedings. Lecture Notes in Computer Science, vol. 13617, pp. 16\u201323. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-20643-6_2","DOI":"10.1007\/978-3-031-20643-6_2"},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Badkobeh, G., Luca, A.D., Fici, G., Puglisi, S.J.: Maximal closed substrings. CoRR abs\/2209.00271 (2022). https:\/\/doi.org\/10.48550\/ARXIV.2209.00271","DOI":"10.48550\/ARXIV.2209.00271"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-319-23826-5_10","volume-title":"String Processing and Information Retrieval","author":"H Bannai","year":"2015","unstructured":"Bannai, H., et al.: Efficient algorithms for longest closed factor array. In: Iliopoulos, C., Puglisi, S., Yilmaz, E. (eds.) SPIRE 2015. LNCS, vol. 9309, pp. 95\u2013102. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23826-5_10"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/J.JCSS.2020.11.002","volume":"117","author":"D Belazzougui","year":"2021","unstructured":"Belazzougui, D., et al.: Block trees. J. Comput. Syst. Sci. 117, 1\u201322 (2021). https:\/\/doi.org\/10.1016\/J.JCSS.2020.11.002","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR10","doi-asserted-by":"publisher","unstructured":"Belazzougui, D., Kosolobov, D., Puglisi, S.J., Raman, R.: Weighted ancestors in suffix trees revisited. In: 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, July 5-7, 2021, Wroc\u0142aw, Poland. LIPIcs, vol.\u00a0191, pp. 8:1\u20138:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPICS.CPM.2021.8","DOI":"10.4230\/LIPICS.CPM.2021.8"},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"Belazzougui, D., Puglisi, S.J.: Range predecessor and Lempel-Ziv parsing. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, pp. 2053\u20132071. SIAM (2016). https:\/\/doi.org\/10.1137\/1.9781611974331.CH143","DOI":"10.1137\/1.9781611974331.CH143"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-642-02737-6_11","volume-title":"Developments in Language Theory","author":"M Bucci","year":"2009","unstructured":"Bucci, M., de Luca, A., De Luca, A.: Rich and periodic-like words. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol. 5583, pp. 145\u2013155. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02737-6_11"},{"issue":"8","key":"13_CR13","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"},{"issue":"50","key":"13_CR14","doi-asserted-by":"publisher","first-page":"5227","DOI":"10.1016\/J.TCS.2009.08.024","volume":"410","author":"M Crochemore","year":"2009","unstructured":"Crochemore, M., Ilie, L., Rytter, W.: Repetitions in strings: algorithms and combinatorics. Theor. Comput. Sci. 410(50), 5227\u20135235 (2009). https:\/\/doi.org\/10.1016\/J.TCS.2009.08.024","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"13_CR15","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S0012-365X(97)00029-0","volume":"179","author":"F Durand","year":"1998","unstructured":"Durand, F.: A characterization of substitutive sequences using return words. Discret. Math. 179(1\u20133), 89\u2013101 (1998). https:\/\/doi.org\/10.1016\/S0012-365X(97)00029-0","journal-title":"Discret. Math."},{"key":"13_CR16","doi-asserted-by":"publisher","unstructured":"Farach, M.: Optimal suffix tree construction with large alphabets. In: 38th Annual Symposium on Foundations of Computer Science, FOCS \u201997, Miami Beach, Florida, USA, October 19-22, 1997, pp. 137\u2013143. IEEE Computer Society (1997). https:\/\/doi.org\/10.1109\/SFCS.1997.646102","DOI":"10.1109\/SFCS.1997.646102"},{"issue":"4","key":"13_CR17","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"},{"key":"13_CR18","doi-asserted-by":"publisher","unstructured":"Fici, G.: A classification of trapezoidal words. In: Proceedings 8th International Conference Words 2011, Prague, Czech Republic, 12-16th September 2011. EPTCS, vol.\u00a063, pp. 129\u2013137 (2011). https:\/\/doi.org\/10.4204\/EPTCS.63.18","DOI":"10.4204\/EPTCS.63.18"},{"key":"13_CR19","unstructured":"Fici, G.: Open and closed words. Bulletin of EATCS (123) (2017). http:\/\/bulletin.eatcs.org\/index.php\/beatcs\/article\/view\/508"},{"issue":"3","key":"13_CR20","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/0022-0000(83)90002-8","volume":"26","author":"Z Galil","year":"1983","unstructured":"Galil, Z., Seiferas, J.I.: Time-space-optimal string matching. J. Comput. Syst. Sci. 26(3), 280\u2013294 (1983). https:\/\/doi.org\/10.1016\/0022-0000(83)90002-8","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"13_CR21","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1016\/J.EJC.2008.04.006","volume":"30","author":"A Glen","year":"2009","unstructured":"Glen, A., Justin, J., Widmer, S., Zamboni, L.Q.: Palindromic richness. Eur. J. Comb. 30(2), 510\u2013531 (2009). https:\/\/doi.org\/10.1016\/J.EJC.2008.04.006","journal-title":"Eur. J. Comb."},{"key":"13_CR22","doi-asserted-by":"publisher","unstructured":"Kempa, D., Prezza, N.: At the roots of dictionary compression: string attractors. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018, pp. 827\u2013840. ACM (2018). https:\/\/doi.org\/10.1145\/3188745.3188814","DOI":"10.1145\/3188745.3188814"},{"key":"13_CR23","doi-asserted-by":"publisher","unstructured":"Knuth, D.E., Jr., J.H.M., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323\u2013350 (1977). https:\/\/doi.org\/10.1137\/0206024","DOI":"10.1137\/0206024"},{"issue":"4","key":"13_CR24","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1007\/S00453-023-01186-0","volume":"86","author":"T Kociumaka","year":"2024","unstructured":"Kociumaka, T., Navarro, G., Olivares, F.: Near-optimal search time in $$\\delta $$-optimal space, and vice versa. Algorithmica 86(4), 1031\u20131056 (2024). https:\/\/doi.org\/10.1007\/S00453-023-01186-0","journal-title":"Algorithmica"},{"key":"13_CR25","doi-asserted-by":"publisher","unstructured":"Larsson, N.J.: Extended application of suffix trees to data compression. In: Proceedings of the 6th Data Compression Conference (DCC \u201996), Snowbird, Utah, USA, March 31 - April 3, 1996, pp. 190\u2013199. IEEE Computer Society (1996). https:\/\/doi.org\/10.1109\/DCC.1996.488324","DOI":"10.1109\/DCC.1996.488324"},{"key":"13_CR26","doi-asserted-by":"publisher","unstructured":"Leonard, L., Inenaga, S., Bannai, H., Mieno, T.: Constant-time edge label and leaf pointer maintenance on sliding suffix trees. CoRRabs\/2307.01412 (2024). https:\/\/doi.org\/10.48550\/ARXIV.2307.01412","DOI":"10.48550\/ARXIV.2307.01412"},{"key":"13_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-642-40579-2_15","volume-title":"Combinatorics on Words","author":"A De Luca","year":"2013","unstructured":"De Luca, A., Fici, G.: Open and closed prefixes of sturmian words. In: Karhum\u00e4ki, J., Lepist\u00f6, A., Zamboni, L. (eds.) WORDS 2013. LNCS, vol. 8079, pp. 132\u2013142. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40579-2_15"},{"key":"13_CR28","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/J.AAM.2017.04.007","volume":"90","author":"AD Luca","year":"2017","unstructured":"Luca, A.D., Fici, G., Zamboni, L.Q.: The sequence of open and closed prefixes of a Sturmian word. Adv. Appl. Math. 90, 27\u201345 (2017). https:\/\/doi.org\/10.1016\/J.AAM.2017.04.007","journal-title":"Adv. Appl. Math."},{"key":"13_CR29","doi-asserted-by":"publisher","unstructured":"Navarro, G.: Indexing highly repetitive string collections, part I: repetitiveness measures. ACM Comput. Surv. 54(2), 29:1\u201329:31 (2022). https:\/\/doi.org\/10.1145\/3434399","DOI":"10.1145\/3434399"},{"key":"13_CR30","doi-asserted-by":"publisher","unstructured":"Navarro, G.: Indexing highly repetitive string collections, part II: compressed indexes. ACM Comput. Surv. 54(2), 26:1\u201326:32 (2022). https:\/\/doi.org\/10.1145\/3432999","DOI":"10.1145\/3432999"},{"key":"13_CR31","doi-asserted-by":"publisher","unstructured":"Parshina, O.G., Puzynina, S.: Finite and infinite closed-rich words. Theor. Comput. Sci. 984, 114315 (2024). https:\/\/doi.org\/10.1016\/J.TCS.2023.114315","DOI":"10.1016\/J.TCS.2023.114315"},{"key":"13_CR32","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/J.AAM.2019.02.007","volume":"107","author":"OG Parshina","year":"2019","unstructured":"Parshina, O.G., Zamboni, L.Q.: Open and closed factors in Arnoux-Rauzy words. Adv. Appl. Math. 107, 22\u201331 (2019). https:\/\/doi.org\/10.1016\/J.AAM.2019.02.007","journal-title":"Adv. Appl. Math."},{"key":"13_CR33","unstructured":"Senft, M.: Suffix tree for a sliding window: an overview. In: 14th Annual Conference of Doctoral Students - WDS 2005, pp. 41\u201346. Matfyzpress (2005). https:\/\/physics.mff.cuni.cz\/wds\/proc\/proc-contents.php?year=2005"},{"issue":"1","key":"13_CR34","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/J.EJC.2012.07.010","volume":"34","author":"WF Smyth","year":"2013","unstructured":"Smyth, W.F.: Computing regularities in strings: a survey. Eur. J. Comb. 34(1), 3\u201314 (2013). https:\/\/doi.org\/10.1016\/J.EJC.2012.07.010","journal-title":"Eur. J. Comb."},{"key":"13_CR35","doi-asserted-by":"publisher","unstructured":"Sumiyoshi, W., Mieno, T., Inenaga, S.: Faster and simpler online\/sliding rightmost lempel-ziv factorizations. In: String Processing and Information Retrieval - 31th International Symposium, SPIRE 2024. Lecture Notes in Computer Science, vol. 14899, pp. 321\u2013335. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-72200-4_24","DOI":"10.1007\/978-3-031-72200-4_24"},{"key":"13_CR36","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"},{"issue":"2","key":"13_CR37","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1006\/EUJC.2000.0444","volume":"22","author":"L Vuillon","year":"2001","unstructured":"Vuillon, L.: A characterization of Sturmian words by return words. Eur. J. Comb. 22(2), 263\u2013275 (2001). https:\/\/doi.org\/10.1006\/EUJC.2000.0444","journal-title":"Eur. J. Comb."},{"key":"13_CR38","doi-asserted-by":"publisher","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: 14th Annual Symposium on Switching and Automata Theory, Iowa City, Iowa, USA, October 15-17, 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","SOFSEM 2025: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-82697-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,15]],"date-time":"2025-02-15T10:18:02Z","timestamp":1739614682000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-82697-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031826962","9783031826979"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-82697-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"16 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bratislava","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","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":"21 January 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 January 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"50","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.sofsem.sk","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}