{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:00:11Z","timestamp":1758585611997,"version":"3.44.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032052278","type":"print"},{"value":"9783032052285","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,22]],"date-time":"2025-09-22T00:00:00Z","timestamp":1758499200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,22]],"date-time":"2025-09-22T00:00:00Z","timestamp":1758499200000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-05228-5_19","type":"book-chapter","created":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T17:01:26Z","timestamp":1758474086000},"page":"233-247","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Longest Unbordered Factors on\u00a0Run-Length Encoded Strings"],"prefix":"10.1007","author":[{"given":"Shoma","family":"Sekizaki","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":[[2025,9,22]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","unstructured":"Akram, W., Mieno, T.: Sorted consecutive occurrence queries in substrings. In: 36th Annual Symposium on Combinatorial Pattern Matching, CPM 2025, June 17-19, 2025, Milan, Italy. LIPIcs, vol.\u00a0331, pp. 24:1\u201324:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2025). https:\/\/doi.org\/10.4230\/LIPICS.CPM.2025.24","DOI":"10.4230\/LIPICS.CPM.2025.24"},{"issue":"1","key":"19_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0012-365X(79)90146-8","volume":"25","author":"R Assous","year":"1979","unstructured":"Assous, R., Pouzet, M.: Une caracterisation des mots periodiques. Discret. Math. 25(1), 1\u20135 (1979). https:\/\/doi.org\/10.1016\/0012-365X(79)90146-8","journal-title":"Discret. Math."},{"key":"19_CR3","doi-asserted-by":"publisher","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: LATIN 2000: Theoretical Informatics, 4th Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000, Proceedings. Lecture Notes in Computer Science, vol.\u00a01776, pp. 88\u201394. Springer (2000). https:\/\/doi.org\/10.1007\/10719839_9","DOI":"10.1007\/10719839_9"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/J.TCS.2020.11.019","volume":"852","author":"PH Cording","year":"2021","unstructured":"Cording, P.H., Gagie, T., Knudsen, M.B.T., Kociumaka, T.: Maximal unbordered factors of random strings. Theor. Comput. Sci. 852, 78\u201383 (2021). https:\/\/doi.org\/10.1016\/J.TCS.2020.11.019","journal-title":"Theor. Comput. Sci."},{"key":"19_CR5","doi-asserted-by":"publisher","unstructured":"Crochemore, M., Mignosi, F., Restivo, A., Salemi, S.: Text compression using antidictionaries. In: Automata, Languages and Programming, 26th International Colloquium, ICALP\u201999, Prague, Czech Republic, July 11-15, 1999, Proceedings. Lecture Notes in Computer Science, vol.\u00a01644, pp. 261\u2013270. Springer (1999). https:\/\/doi.org\/10.1007\/3-540-48523-6_23","DOI":"10.1007\/3-540-48523-6_23"},{"issue":"1","key":"19_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0012-365X(82)90186-8","volume":"40","author":"J Duval","year":"1982","unstructured":"Duval, J.: Relationship between the period of a finite word and the length of its unbordered segments. Discret. Math. 40(1), 31\u201344 (1982). https:\/\/doi.org\/10.1016\/0012-365X(82)90186-8","journal-title":"Discret. Math."},{"issue":"11","key":"19_CR7","doi-asserted-by":"publisher","first-page":"2261","DOI":"10.1016\/J.DISC.2006.09.054","volume":"308","author":"J Duval","year":"2008","unstructured":"Duval, J., Harju, T., Nowotka, D.: Unbordered factors and Lyndon words. Discret. Math. 308(11), 2261\u20132264 (2008). https:\/\/doi.org\/10.1016\/J.DISC.2006.09.054","journal-title":"Discret. Math."},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/J.TCS.2013.12.008","volume":"522","author":"J Duval","year":"2014","unstructured":"Duval, J., Lecroq, T., Lefebvre, A.: Linear computation of unbordered conjugate on unordered alphabet. Theor. Comput. Sci. 522, 77\u201384 (2014). https:\/\/doi.org\/10.1016\/J.TCS.2013.12.008","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"19_CR9","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0012-365X(79)90116-X","volume":"26","author":"A Ehrenfeucht","year":"1979","unstructured":"Ehrenfeucht, A., Silberger, D.M.: Periodicity and unbordered segments of words. Discret. Math. 26(2), 101\u2013109 (1979). https:\/\/doi.org\/10.1016\/0012-365X(79)90116-X","journal-title":"Discret. Math."},{"key":"19_CR10","doi-asserted-by":"publisher","unstructured":"Gawrychowski, P., Kucherov, G., Sach, B., Starikovskaya, T.: Computing the longest unbordered substring. In: String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, London, UK, September 1-4, 2015, Proceedings. Lecture Notes in Computer Science, vol.\u00a09309, pp. 246\u2013257. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-319-23826-5_24","DOI":"10.1007\/978-3-319-23826-5_24"},{"issue":"2","key":"19_CR11","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1142\/S0129054104002467","volume":"15","author":"T Harju","year":"2004","unstructured":"Harju, T., Nowotka, D.: Minimal Duval extensions. Int. J. Found. Comput. Sci. 15(2), 349\u2013354 (2004). https:\/\/doi.org\/10.1142\/S0129054104002467","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"4","key":"19_CR12","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/1255443.1255448","volume":"54","author":"T Harju","year":"2007","unstructured":"Harju, T., Nowotka, D.: Periodicity and unbordered words: a proof of the extended Duval conjecture. J. ACM 54(4), 20 (2007). https:\/\/doi.org\/10.1145\/1255443.1255448","journal-title":"J. ACM"},{"issue":"1","key":"19_CR13","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/J.TCS.2005.01.008","volume":"339","author":"S Holub","year":"2005","unstructured":"Holub, S.: A proof of the extended Duval\u2019s conjecture. Theor. Comput. Sci. 339(1), 61\u201367 (2005). https:\/\/doi.org\/10.1016\/J.TCS.2005.01.008","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"19_CR14","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1016\/J.JCTA.2011.11.004","volume":"119","author":"S Holub","year":"2012","unstructured":"Holub, S., Nowotka, D.: The Ehrenfeucht-Silberger problem. J. Comb. Theory A 119(3), 668\u2013682 (2012). https:\/\/doi.org\/10.1016\/J.JCTA.2011.11.004","journal-title":"J. Comb. Theory A"},{"key":"19_CR15","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"},{"key":"19_CR16","doi-asserted-by":"publisher","unstructured":"Kociumaka, T., Kundu, R., Mohamed, M., Pissis, S.P.: Longest unbordered factor in quasilinear time. In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan. LIPIcs, vol.\u00a0123, pp. 70:1\u201370:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPICS.ISAAC.2018.70","DOI":"10.4230\/LIPICS.ISAAC.2018.70"},{"issue":"5","key":"19_CR17","doi-asserted-by":"publisher","first-page":"1524","DOI":"10.1137\/23M1567618","volume":"53","author":"T Kociumaka","year":"2024","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W., Walen, T.: Internal pattern matching queries in a text and applications. SIAM J. Comput. 53(5), 1524\u20131577 (2024). https:\/\/doi.org\/10.1137\/23M1567618","journal-title":"SIAM J. Comput."},{"key":"19_CR18","doi-asserted-by":"publisher","unstructured":"Loptev, A., Kucherov, G., Starikovskaya, T.: On maximal unbordered factors. In: Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 - July 1, 2015, Proceedings. Lecture Notes in Computer Science, vol.\u00a09133, pp. 343\u2013354. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-319-19929-0_29","DOI":"10.1007\/978-3-319-19929-0_29"},{"key":"19_CR19","doi-asserted-by":"publisher","unstructured":"Margaritis, D., Skiena, S.: Reconstructing strings from substrings in rounds. In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 613\u2013620. IEEE Computer Society (1995). https:\/\/doi.org\/10.1109\/SFCS.1995.492591","DOI":"10.1109\/SFCS.1995.492591"},{"issue":"1","key":"19_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1051\/ITA:2002001","volume":"36","author":"F Mignosi","year":"2002","unstructured":"Mignosi, F., Zamboni, L.Q.: A note on a conjecture of Duval and Sturmian words. RAIRO Theor. Inform. Appl. 36(1), 1\u20133 (2002). https:\/\/doi.org\/10.1051\/ITA:2002001","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"19_CR21","doi-asserted-by":"publisher","unstructured":"Mitani, K., Mieno, T., Seto, K., Horiyama, T.: Shortest cover after edit. In: 35th Annual Symposium on Combinatorial Pattern Matching, CPM 2024, June 25-27, 2024, Fukuoka, Japan. LIPIcs, vol.\u00a0296, pp. 24:1\u201324:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024). https:\/\/doi.org\/10.4230\/LIPICS.CPM.2024.24","DOI":"10.4230\/LIPICS.CPM.2024.24"},{"key":"19_CR22","doi-asserted-by":"publisher","unstructured":"Sekizaki, S., Mieno, T.: Longest unbordered factors on run-length encoded strings. CoRR abs\/2507.16285 (2025). https:\/\/doi.org\/10.48550\/ARXIV.2507.16285","DOI":"10.48550\/ARXIV.2507.16285"},{"key":"19_CR23","doi-asserted-by":"publisher","unstructured":"Tamakoshi, Y., Goto, K., Inenaga, S., Bannai, H., Takeda, M.: An opportunistic text indexing structure based on run length encoding. In: Algorithms and Complexity - 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings. Lecture Notes in Computer Science, vol.\u00a09079, pp. 390\u2013402. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-319-18173-8_29","DOI":"10.1007\/978-3-319-18173-8_29"}],"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-032-05228-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T17:01:28Z","timestamp":1758474088000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-05228-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,22]]},"ISBN":["9783032052278","9783032052285"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-05228-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,22]]},"assertion":[{"value":"22 September 2025","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":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"8 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/spire-2025\/home","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}