Finding the largest fixed-density necklace and Lyndon word

DOI10.1016/J.IPL.2017.04.010MaRDI QIDQ2628279zbMATH OpenOpenAlexFDO

Authors Joe Sawada, Patrick Hartman

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

zbMATH Keywords

fixed-densityLyndon wordnecklaceranking

Mathematics Subject Classification ID

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

Recommendations

• Ranking and unranking fixed-density necklaces and Lyndon words
• An Efficient Algorithm for Generating Necklaces with Fixed Density
• scientific article; zbMATH DE number 1305469
• Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences
• A Gray code for fixed-density necklaces and Lyndon words in constant amortized time

Cites work

• A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
• A Gray Code for Necklaces of Fixed Density
• An Efficient Algorithm for Generating Necklaces with Fixed Density
• De Bruijn sequences for fixed-weight binary strings
• Efficient indexing of necklaces and irreducible polynomials over finite fields
• Efficient ranking of Lyndon words and decoding lexicographically minimal de Bruijn sequence
• Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)
• Generating fixed density bracelets of arbitrary base
• scientific article; zbMATH DE number 417855 (Why is no real title available?)
• Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences

Cited in

(3)

• Ranking and unranking fixed-density necklaces and Lyndon words
• A dynamical approach to necklaces and words
• Lyndon pairs and the lexicographically greatest perfect necklace

This page was built for publication: Finding the largest fixed-density necklace and Lyndon word

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2628279)