Finding the largest fixed-density necklace and Lyndon word
From MaRDI portal
Publication:2628279
DOI10.1016/j.ipl.2017.04.010zbMath1409.68359OpenAlexW2610512692MaRDI QIDQ2628279
Publication date: 13 June 2017
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2017.04.010
Cites Work
- Unnamed Item
- Unnamed Item
- A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
- Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences
- Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence
- Generating fixed density bracelets of arbitrary base
- De Bruijn Sequences for Fixed-Weight Binary Strings
- Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)
- A Gray Code for Necklaces of Fixed Density
- An Efficient Algorithm for Generating Necklaces with Fixed Density