{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,7]],"date-time":"2026-09-07T14:47:50Z","timestamp":1788792470865,"version":"build-2803163510"},"reference-count":35,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","funder":[{"DOI":"10.13039\/501100004569","name":"Ministry of Science and Higher Education, Republic of Poland","doi-asserted-by":"crossref","award":["DI2012 01794"],"award-info":[{"award-number":["DI2012 01794"]}],"id":[{"id":"10.13039\/501100004569","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Polish National Science Center","award":["2014\/13\/B\/ST6\/00770"],"award-info":[{"award-number":["2014\/13\/B\/ST6\/00770"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2016,1]]},"abstract":"<jats:p>We give efficient algorithms for ranking Lyndon words of length $n$ over an alphabet of size $\\sigma$. The rank of a Lyndon word is its position in the sequence of lexicographically ordered Lyndon words of the same length. The outputs are integers of exponential size, and complexity of arithmetic operations on such large integers cannot be ignored. Our model of computations is the word RAM, in which basic arithmetic operations on (large) numbers of size at most $\\sigma^n$ take $\\mathcal{O}(n)$ time. Our algorithm for ranking Lyndon words makes $O(n^2)$ arithmetic operations (this would imply directly cubic time on word RAM). However, using an algebraic approach we are able to reduce the total time complexity on word RAM to $O(n^2 \\log\\sigma)$. We also present an $O(n^3 \\log^2 \\sigma)$-time algorithm that generates the Lyndon word of a given length and rank in lexicographic order. Finally we use the connections between Lyndon words and lexicographically minimal de Bruijn sequences (a theorem of Fredricksen and Maiorana) to develop the first polynomial-time algorithm for decoding the minimal de Bruijn sequence of any rank $n$ (it determines the position of a given word of length $n$ within the de Bruijn sequence).<\/jats:p>","DOI":"10.1137\/15m1043248","type":"journal-article","created":{"date-parts":[[2016,10,27]],"date-time":"2016-10-27T12:21:53Z","timestamp":1477570913000},"page":"2027-2046","source":"Crossref","is-referenced-by-count":8,"title":["Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence"],"prefix":"10.1137","volume":"30","author":[{"given":"Tomasz","family":"Kociumaka","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jakub","family":"Radoszewski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2016,10,27]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2015.05.025"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)00013-1"},{"key":"atypb3","first-page":"131","author":"Bonomo S.","year":"2013","journal-title":"Heidelberg"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1108"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.2307\/1970044"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(92)90699-G"},{"key":"atypb7","doi-asserted-by":"crossref","unstructured":"M. Crochemore, C. Hancart, and T. Lecroq,\n                      Algorithms on Strings\n                      , Cambridge University Press, New York, 2007.","DOI":"10.1017\/CBO9780511546853"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.11.018"},{"key":"atypb9","unstructured":"M. Crochemore and W. Rytter,\n                      Text Algorithms\n                      , Oxford University Press, New York, 1994."},{"key":"atypb10","first-page":"758","volume":"49","author":"N.","year":"1946","journal-title":"Proc. Konink. Nederl. Akad. Wetensch."},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(83)90017-2"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(88)90113-2"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(70)80050-3"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(72)90091-X"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(86)90089-0"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(78)90002-X"},{"key":"atypb17","first-page":"660","author":"Fu\u0308rer M.","year":"2014","journal-title":"Heidelberg"},{"key":"atypb18","doi-asserted-by":"crossref","unstructured":"K. O. Geddes, S. R. Czapor, and G. Labahn,\n                      Algorithms for Computer Algebra\n                      , Kluwer Academic Publishers, Boston, MA, 1992.","DOI":"10.1007\/b102438"},{"key":"atypb19","first-page":"366","author":"Hagerup T.","year":"1998","journal-title":"Heidelberg"},{"key":"atypb20","unstructured":"D. E. Knuth,\n                      The Art of Computer Programming\n                      , Vol. 4, Fasc. 2, Addison-Wesley, Upper Saddle River, NJ, 2005."},{"key":"atypb21","doi-asserted-by":"crossref","unstructured":"T. Kociumaka, J. Radoszewski, and W. Rytter,\n                      Computing $k$th Lyndon word and decoding lexicographically minimal de Bruijn sequence\n                      , in Proceedings of the 25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), Lecture Notes in Comput. Sci. 8486, A. S. Kulikov, S. O. Kuznetsov, and P. A. Pevzner, eds., Springer, Cham, 2014, pp. 202-211,https:\/\/doi.org\/10.1007\/978-3-319-07566-2_21.","DOI":"10.1007\/978-3-319-07566-2_21"},{"key":"atypb22","doi-asserted-by":"crossref","unstructured":"S. Kopparty, M. Kumar, and M. E. Saks,\n                      Efficient indexing of necklaces and irreducible polynomials over finite fields\n                      , in Proceedings of the 41st International Colloquium on Automata, Languages and Programming (ICALP 2014), Part I, Lecture Notes in Comput. Sci. 8572, J. Esparza, P. Fraigniaud, T. Husfeldt, and E. Koutsoupias, eds., Springer, Heidelberg, 2014, pp. 726-737,https:\/\/doi.org\/10.1007\/978-3-662-43948-7_60.","DOI":"10.1007\/978-3-662-43948-7_60"},{"key":"atypb23","unstructured":"M. Lothaire,\n                      Combinatorics on Words\n                      , 2nd ed., Cambridge Math. Lib., Cambridge University Press, Cambridge, UK, 1997."},{"key":"atypb24","first-page":"202","volume":"77","author":"Lyndon R. C.","year":"1954","journal-title":"Trans. Amer. Math. Soc."},{"key":"atypb25","first-page":"187","author":"Marti\u0301nez C.","year":"2004","journal-title":"Basel"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1109\/18.532887"},{"key":"atypb27","first-page":"958","author":"Mucha M.","year":"2013","journal-title":"Philadelphia"},{"key":"atypb28","unstructured":"J. Radoszewski,\n                      Generation of Lexicographically Minimal de Bruijn Sequences with Prime Words\n                      , Master's thesis, University of Warsaw, Warsaw, Poland, 2008, in Polish,http:\/\/www.mimuw.edu.pl\/ jrad\/dyplomowe\/mgr.pdf."},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(81)90007-9"},{"key":"atypb30","unstructured":"F. Ruskey,\n                      Combinatorial Generation\n                      , draft version of a book, 2003,http:\/\/www.1stworks.com\/ref\/RuskeyCombGen.pdf."},{"key":"atypb31","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(92)90047-G"},{"key":"atypb32","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539798344112"},{"key":"atypb33","unstructured":"J. Sawada and A. Williams,\n                      private communication\n                      , 2015."},{"key":"atypb34","doi-asserted-by":"publisher","DOI":"10.1007\/BF02242389"},{"key":"atypb35","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(00)00117-5"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/15M1043248","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:02:30Z","timestamp":1787320950000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/15M1043248"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["10.1137\/15M1043248"],"URL":"https:\/\/doi.org\/10.1137\/15m1043248","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1]]}}}