Generating Bracelets in Constant Amortized Time

  • Sawada J
  • 10


    Mendeley users who have this article in their library.
  • 23


    Citations of this article.


A bracelet is the lexicographically smallest element in an equivalence class of strings under string rotation and reversal. We present a fast, simple, recursive algorithm for generating (i.e., listing) k-ary bracelets. Using simple bounding techniques, we prove that the algorithm is optimal in the sense that the running time is proportional to the number of bracelets produced. This is an improvement by a factor of n (where n is the length of the bracelets being generated) over the fastest, previously known algorithm to generate bracelets.

Author-supplied keywords

  • 05-04
  • 1
  • 68r05
  • 68r15
  • ams subject classifications
  • bracelet
  • cat algorithm
  • chemistry and
  • forbidden substring
  • generate
  • introduction
  • necklace
  • pii
  • s0097539700377037
  • the fields of combinatorial
  • the rapid growth in

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Joe Sawada

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free