{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T06:06:33Z","timestamp":1775541993084,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T00:00:00Z","timestamp":1775520000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T00:00:00Z","timestamp":1775520000000},"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":["Theory Comput Syst"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s00224-025-10256-5","type":"journal-article","created":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T05:20:46Z","timestamp":1775539246000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Faster Algorithms for Ranking\/Unranking Bordered and Unbordered Words"],"prefix":"10.1007","volume":"70","author":[{"given":"Jakub","family":"Radoszewski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomasz","family":"Wale\u0144","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,4,7]]},"reference":[{"issue":"1","key":"10256_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":"10256_CR2","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., 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."},{"issue":"1","key":"10256_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."},{"issue":"2","key":"10256_CR4","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."},{"issue":"1","key":"10256_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":"10256_CR6","doi-asserted-by":"publisher","first-page":"106452","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":"10256_CR7","doi-asserted-by":"publisher","first-page":"106027","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":"10256_CR8","doi-asserted-by":"publisher","unstructured":"Gawrychowski, P., Kucherov, G., Sach, B., Starikovskaya, T.: Computing the longest unbordered substring. In: Iliopoulos, C.S., Puglisi, S.J., Yilmaz, E. (eds.), String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, London, UK, September 1-4, 2015, Proceedings, volume 9309 of Lecture Notes in Computer Science, 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":"1","key":"10256_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."},{"issue":"3","key":"10256_CR10","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, Ser. A 119(3), 668\u2013682 (2012). https:\/\/doi.org\/10.1016\/J.JCTA.2011.11.004","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"2","key":"10256_CR11","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"DE Knuth","year":"1977","unstructured":"Knuth, D.E., Morris, J.H., Jr., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323\u2013350 (1977). https:\/\/doi.org\/10.1137\/0206024","journal-title":"SIAM J. Comput."},{"key":"10256_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, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, 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":"10256_CR13","doi-asserted-by":"publisher","unstructured":"Loptev, A., Kucherov, G., Starikovskaya, T.: On maximal unbordered factors. In: Cicalese, F., Porat, E., Vaccaro, U. (eds.), Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 - July 1, 2015, Proceedings, volume 9133 of Lecture Notes in Computer Science, 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":"10256_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566097","volume-title":"Combinatorics on words","author":"M Lothaire","year":"1997","unstructured":"Lothaire, M.: Combinatorics on words, 2nd edn. Cambridge University Press, Cambridge mathematical library (1997)","edition":"2"},{"issue":"6","key":"10256_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."},{"issue":"5","key":"10256_CR16","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1109\/TIT.1973.1055065","volume":"19","author":"PT Nielsen","year":"1973","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","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10256_CR17","doi-asserted-by":"publisher","unstructured":"Radoszewski, J., Rytter, W., Wale\u0144, T.: Faster algorithms for ranking\/unranking bordered and unbordered words. In: Lipt\u00e1k, Z., de\u00a0Moura, E.S., Figueroa, K., Baeza-Yates, R. (eds.), String Processing and Information Retrieval - 31st International Symposium, SPIRE 2024, Puerto Vallarta, Mexico, September 23-25, 2024, Proceedings, volume 14899 of Lecture Notes in Computer Science, pp. 257\u2013271. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-72200-4_20","DOI":"10.1007\/978-3-031-72200-4_20"},{"issue":"9","key":"10256_CR18","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":"10256_CR19","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1051\/ITA\/1992260403031","volume":"26","author":"Mireille R\u00e9gnier","year":"1992","unstructured":"R\u00e9gnier, Mireille: Enumeration of bordered words. Le langage de la vache-qui-rit. RAIRO Theor. Informatics Appl. 26, 303\u2013317 (1992). https:\/\/doi.org\/10.1051\/ITA\/1992260403031","journal-title":"RAIRO Theor. Informatics Appl."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-025-10256-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-025-10256-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-025-10256-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T05:20:47Z","timestamp":1775539247000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-025-10256-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,7]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["10256"],"URL":"https:\/\/doi.org\/10.1007\/s00224-025-10256-5","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,7]]},"assertion":[{"value":"7 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"24"}}