Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences
From MaRDI portal
Publication:2397155
DOI10.1016/j.jda.2017.01.003zbMath1370.68343OpenAlexW2586556622MaRDI QIDQ2397155
Publication date: 29 May 2017
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2017.01.003
Related Items
Finding the largest fixed-density necklace and Lyndon word, Ranking and unranking bordered and unbordered words, Ranking and Unranking k-Subsequence Universal Words, Ranking and unranking fixed-density necklaces and Lyndon words, Ranking binary unlabelled necklaces in polynomial time
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lexicographically least circular substrings
- Lexicographic compositions and de Bruijn sequences
- A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects
- Necklaces of beads in k colors and k-ary de Bruijn sequences
- Ranking and unranking permutations in linear time
- The standard factorization of Lyndon words: an average point of view
- Generating Bracelets in Constant Amortized Time
- Factorizing words over an ordered alphabet
- Enumerating, Ranking and Unranking Binary Trees
- Ranking and Unranking of AVL-Trees
- A Unified Setting for Selection Algorithms (II)
- Ranking and Unranking of 2-3 Trees
- Generating necklaces
- Ranking Algorithms for Lists of Partitions
- Ranking and Listing Algorithms for k-Ary Trees
- Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)
- Ranking and unranking of B-trees
- Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence
- Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields
