{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T16:47:46Z","timestamp":1775580466987,"version":"3.50.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031721991","type":"print"},{"value":"9783031722004","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T00:00:00Z","timestamp":1726704000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T00:00:00Z","timestamp":1726704000000},"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-72200-4_20","type":"book-chapter","created":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T19:01:50Z","timestamp":1726686110000},"page":"257-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Faster Algorithms for\u00a0Ranking\/Unranking Bordered and\u00a0Unbordered Words"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0067-6401","authenticated-orcid":false,"given":"Jakub","family":"Radoszewski","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9162-6724","authenticated-orcid":false,"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7369-3309","authenticated-orcid":false,"given":"Tomasz","family":"Wale\u0144","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,19]]},"reference":[{"issue":"1","key":"20_CR1","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":"20_CR2","doi-asserted-by":"publisher","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","DOI":"10.1016\/J.TCS.2020.11.019"},{"issue":"1","key":"20_CR3","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0012-365X(82)90186-8","volume":"40","author":"J-P Duval","year":"1982","unstructured":"Duval, J.-P.: 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."},{"key":"20_CR4","doi-asserted-by":"publisher","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","DOI":"10.1016\/0012-365X(79)90116-X"},{"issue":"1","key":"20_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.2307\/2034009","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.2307\/2034009","journal-title":"Proc. Am. Math. Soc."},{"key":"20_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2023.106452","volume":"184","author":"D Gabric","year":"2024","unstructured":"Gabric, D.: Ranking and unranking bordered and unbordered words. Inf. Process. Lett. 184, 106452 (2024). https:\/\/doi.org\/10.1016\/j.ipl.2023.106452","journal-title":"Inf. Process. Lett."},{"key":"20_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/J.IPL.2020.106027","volume":"165","author":"D Gabric","year":"2021","unstructured":"Gabric, D., Shallit, J.O.: Borders, palindrome prefixes, and square prefixes. Inf. Process. Lett. 165, 106027 (2021). https:\/\/doi.org\/10.1016\/J.IPL.2020.106027","journal-title":"Inf. Process. Lett."},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-319-23826-5_24","volume-title":"String Processing and Information Retrieval","author":"P Gawrychowski","year":"2015","unstructured":"Gawrychowski, P., Kucherov, G., Sach, B., Starikovskaya, T.: Computing the longest unbordered substring. In: Iliopoulos, C., Puglisi, S., Yilmaz, E. (eds.) SPIRE 2015. LNCS, vol. 9309, pp. 246\u2013257. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23826-5_24"},{"issue":"1","key":"20_CR9","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/J.TCS.2005.03.040","volume":"340","author":"T Harju","year":"2005","unstructured":"Harju, T., Nowotka, D.: Counting bordered and primitive words with a fixed weight. Theor. Comput. Sci. 340(1), 273\u2013279 (2005). https:\/\/doi.org\/10.1016\/J.TCS.2005.03.040","journal-title":"Theor. Comput. Sci."},{"key":"20_CR10","doi-asserted-by":"publisher","unstructured":"Holub, S., Nowotka, D.: The Ehrenfeucht-Silberger problem. J. Comb. Theory, Ser. A 119(3), 668\u2013682 (2012). https:\/\/doi.org\/10.1016\/J.JCTA.2011.11.004","DOI":"10.1016\/J.JCTA.2011.11.004"},{"key":"20_CR11","doi-asserted-by":"publisher","unstructured":"Knuth, D.E., Morris, Jr., J.H., 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":"20_CR12","doi-asserted-by":"publisher","unstructured":"Kociumaka, T., Kundu, R., Mohamed, M., Pissis, S.P.: Longest unbordered factor in quasilinear time. In: Hsu, W.-L., Lee, D.-T., Liao, C.-S. (eds.) 29th International Symposium on Algorithms and Computation, ISAAC 2018, 16\u201319 December 2018, Jiaoxi, Yilan, volume 123 of LIPIcs, 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"},{"key":"20_CR13","doi-asserted-by":"publisher","unstructured":"Loptev, A., Kucherov, G., Starikovskaya, T.: On maximal unbordered factors. In: Cicalese, F., Porat, E., Vaccaro, U. (eds.) CPM 2015. LNCS, vol. 9133, pp. 343\u2013354. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-319-19929-0_29","DOI":"10.1007\/978-3-319-19929-0_29"},{"key":"20_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566097","volume-title":"Combinatorics on Words. Cambridge Mathematical Library","author":"M Lothaire","year":"1997","unstructured":"Lothaire, M.: Combinatorics on Words. Cambridge Mathematical Library, 2nd edn. Cambridge University Press (1997)","edition":"2"},{"issue":"6","key":"20_CR15","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0020-0190(01)00141-7","volume":"79","author":"WJ Myrvold","year":"2001","unstructured":"Myrvold, W.J., Ruskey, F.: Ranking and unranking permutations in linear time. Inf. Process. Lett. 79(6), 281\u2013284 (2001). https:\/\/doi.org\/10.1016\/S0020-0190(01)00141-7","journal-title":"Inf. Process. Lett."},{"key":"20_CR16","doi-asserted-by":"publisher","unstructured":"Nielsen, P.T.: A note on bifix-free sequences (corresp.). IEEE Trans. Inf. Theory 19(5), 704\u2013706 (1973). https:\/\/doi.org\/10.1109\/TIT.1973.1055065","DOI":"10.1109\/TIT.1973.1055065"},{"issue":"9","key":"20_CR17","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/J.IPL.2011.01.018","volume":"111","author":"N Rampersad","year":"2011","unstructured":"Rampersad, N., Shallit, J.O., Wang, M.: Inverse star, borders, and palstars. Inf. Process. Lett. 111(9), 420\u2013422 (2011). https:\/\/doi.org\/10.1016\/J.IPL.2011.01.018","journal-title":"Inf. Process. Lett."},{"key":"20_CR18","doi-asserted-by":"publisher","unstructured":"R\u00e9gnier, M.: Enumeration of bordered words. Le langage de la vache-qui-rit. RAIRO Theor. Inf. Appl. 26, 303\u2013317 (1992). https:\/\/doi.org\/10.1051\/ITA\/1992260403031","DOI":"10.1051\/ITA\/1992260403031"}],"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-72200-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T19:02:53Z","timestamp":1726686173000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-72200-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,19]]},"ISBN":["9783031721991","9783031722004"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-72200-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,19]]},"assertion":[{"value":"19 September 2024","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":"Puerto Vallarta","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/computo.fismat.umich.mx\/spire2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}