Abstract
Let Σ be a finite ordered alphabet. We present polynomial-time algorithms for computing the k-th in the lexicographic order Lyndon word of a given length n over Σ and counting Lyndon words of length n that are smaller than a given word. We also use the connections between Lyndon words and minimal de Bruijn sequences (theorem of Fredricksen and Maiorana) to develop the first polynomial time algorithm for decoding minimal de Bruijn sequence of any rank n (it determines the position of an arbitrary word of length n within the de Bruijn sequence). Our tools mostly rely on combinatorics on words and automata theory.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bonomo, S., Mantaci, S., Restivo, A., Rosone, G., Sciortino, M.: Suffixes, conjugates and Lyndon words. In: Béal, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol. 7907, pp. 131–142. Springer, Heidelberg (2013)
Crochemore, M., Iliopoulos, C.S., Kubica, M., Radoszewski, J., Rytter, W., Waleń, T.: Extracting powers and periods in a word from its runs structure. Theor. Comput. Sci. (2013), doi:10.1016/j.tcs.2013.11.018
Crochemore, M., Rytter, W.: Text Algorithms. Oxford University Press (1994)
Duval, J.-P.: Génération d’une section des classes de conjugaison et arbre des mots de Lyndon de longueur bornée. Theor. Comput. Sci. 60, 255–283 (1988)
Chung, R.G.F., Diaconis, P.: Universal cycles for combinatorial structures. Discrete Mathematics 110, 43–59 (1992)
Fredricksen, H., Kessler, I.J.: An algorithm for generating necklaces of beads in two colors. Discrete Mathematics 61(2-3), 181–188 (1986)
Fredricksen, H., Maiorana, J.: Necklaces of beads in k colors and k-ary de Bruijn sequences. Discrete Mathematics 23(3), 207–210 (1978)
Hin Au, Y.: Shortest sequences containing primitive words and powers. ArXiv e-prints (April 2009)
Knuth, D.E.: The Art of Computer Programming, vol. 4, Fascicle 2. Addison-Wesley (2005)
Lothaire, M.: Combinatorics on Words. Addison-Wesley, Reading (1983)
Mitchell, C.J., Etzion, T., Paterson, K.G.: A method for constructing decodable de Bruijn sequences. IEEE Transactions on Information Theory 42(5), 1472–1478 (1996)
Mucha, M.: Lyndon words and short superstrings. In: Khanna, S. (ed.) SODA, pp. 958–972. SIAM (2013)
Radoszewski, J.: Generation of lexicographically minimal de Bruijn sequences with prime words. Master’s thesis, University of Warsaw (2008) (in Polish)
Ruskey, F., Savage, C.D., Wang, T.M.Y.: Generating necklaces. J. Algorithms 13(3), 414–430 (1992)
Tuliani, J.: De Bruijn sequences with efficient decoding algorithms. Discrete Mathematics 226(1-3), 313–336 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Kociumaka, T., Radoszewski, J., Rytter, W. (2014). Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence. In: Kulikov, A.S., Kuznetsov, S.O., Pevzner, P. (eds) Combinatorial Pattern Matching. CPM 2014. Lecture Notes in Computer Science, vol 8486. Springer, Cham. https://doi.org/10.1007/978-3-319-07566-2_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-07566-2_21
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07565-5
Online ISBN: 978-3-319-07566-2
eBook Packages: Computer ScienceComputer Science (R0)