Ranking and unranking fixed-density necklaces and Lyndon words

DOI10.1016/j.tcs.2019.04.007zbMath1430.68461OpenAlexW2946240107WikidataQ127824588 ScholiaQ127824588MaRDI QIDQ2272399

Joe Sawada, Patrick Hartman

Publication date: 10 September 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.04.007

zbMATH Keywords

rankingLyndon wordunrankingnecklacefixed-density

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Algorithms on strings (68W32)

Related Items (2)

Ranking and unranking bordered and unbordered words ⋮ Closure and nonclosure properties of the classes of compressible and rankable sets

Cites Work

• Unnamed Item
• Unnamed Item
• A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
• Symmetry types of periodic sequences
• Lexicographically least circular substrings
• Gray codes for necklaces
• Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences
• Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence
• A Gray Code for Necklaces of Fixed Density
• An Efficient Algorithm for Generating Necklaces with Fixed Density

This page was built for publication: Ranking and unranking fixed-density necklaces and Lyndon words