{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:09:18Z","timestamp":1772294958619,"version":"3.50.1"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319075655","type":"print"},{"value":"9783319075662","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07566-2_21","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T23:50:31Z","timestamp":1402530631000},"page":"202-211","source":"Crossref","is-referenced-by-count":5,"title":["Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence"],"prefix":"10.1007","author":[{"given":"Tomasz","family":"Kociumaka","sequence":"first","affiliation":[]},{"given":"Jakub","family":"Radoszewski","sequence":"additional","affiliation":[]},{"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-642-38771-5_13","volume-title":"Developments in Language Theory","author":"S. Bonomo","year":"2013","unstructured":"Bonomo, S., Mantaci, S., Restivo, A., Rosone, G., Sciortino, M.: Suffixes, conjugates and Lyndon words. In: B\u00e9al, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol.\u00a07907, pp. 131\u2013142. Springer, Heidelberg (2013)"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Iliopoulos, C.S., Kubica, M., Radoszewski, J., Rytter, W., Wale\u0144, T.: Extracting powers and periods in a word from its runs structure. Theor. Comput. Sci. (2013), doi:10.1016\/j.tcs.2013.11.018","DOI":"10.1016\/j.tcs.2013.11.018"},{"key":"21_CR3","unstructured":"Crochemore, M., Rytter, W.: Text Algorithms. Oxford University Press (1994)"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0304-3975(88)90113-2","volume":"60","author":"J.-P. Duval","year":"1988","unstructured":"Duval, J.-P.: G\u00e9n\u00e9ration d\u2019une section des classes de conjugaison et arbre des mots de Lyndon de longueur born\u00e9e. Theor. Comput. Sci.\u00a060, 255\u2013283 (1988)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0012-365X(92)90699-G","volume":"110","author":"R.G.F. Chung","year":"1992","unstructured":"Chung, R.G.F., Diaconis, P.: Universal cycles for combinatorial structures. Discrete Mathematics\u00a0110, 43\u201359 (1992)","journal-title":"Discrete Mathematics"},{"issue":"2-3","key":"21_CR6","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0012-365X(86)90089-0","volume":"61","author":"H. Fredricksen","year":"1986","unstructured":"Fredricksen, H., Kessler, I.J.: An algorithm for generating necklaces of beads in two colors. Discrete Mathematics\u00a061(2-3), 181\u2013188 (1986)","journal-title":"Discrete Mathematics"},{"issue":"3","key":"21_CR7","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0012-365X(78)90002-X","volume":"23","author":"H. Fredricksen","year":"1978","unstructured":"Fredricksen, H., Maiorana, J.: Necklaces of beads in k colors and k-ary de Bruijn sequences. Discrete Mathematics\u00a023(3), 207\u2013210 (1978)","journal-title":"Discrete Mathematics"},{"key":"21_CR8","unstructured":"Hin Au, Y.: Shortest sequences containing primitive words and powers. ArXiv e-prints (April 2009)"},{"key":"21_CR9","unstructured":"Knuth, D.E.: The Art of Computer Programming, vol. 4, Fascicle 2. Addison-Wesley (2005)"},{"key":"21_CR10","volume-title":"Combinatorics on Words","author":"M. Lothaire","year":"1983","unstructured":"Lothaire, M.: Combinatorics on Words. Addison-Wesley, Reading (1983)"},{"issue":"5","key":"21_CR11","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1109\/18.532887","volume":"42","author":"C.J. Mitchell","year":"1996","unstructured":"Mitchell, C.J., Etzion, T., Paterson, K.G.: A method for constructing decodable de Bruijn sequences. IEEE Transactions on Information Theory\u00a042(5), 1472\u20131478 (1996)","journal-title":"IEEE Transactions on Information Theory"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Mucha, M.: Lyndon words and short superstrings. In: Khanna, S. (ed.) SODA, pp. 958\u2013972. SIAM (2013)","DOI":"10.1137\/1.9781611973105.69"},{"key":"21_CR13","unstructured":"Radoszewski, J.: Generation of lexicographically minimal de Bruijn sequences with prime words. Master\u2019s thesis, University of Warsaw (2008) (in Polish)"},{"issue":"3","key":"21_CR14","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1016\/0196-6774(92)90047-G","volume":"13","author":"F. Ruskey","year":"1992","unstructured":"Ruskey, F., Savage, C.D., Wang, T.M.Y.: Generating necklaces. J. Algorithms\u00a013(3), 414\u2013430 (1992)","journal-title":"J. Algorithms"},{"issue":"1-3","key":"21_CR15","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/S0012-365X(00)00117-5","volume":"226","author":"J. Tuliani","year":"2001","unstructured":"Tuliani, J.: De Bruijn sequences with efficient decoding algorithms. Discrete Mathematics\u00a0226(1-3), 313\u2013336 (2001)","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07566-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T22:16:36Z","timestamp":1558908996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07566-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319075655","9783319075662"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07566-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}