SIAM Journal on Computing · 2001 · 55 citations · 9 references
ComputingComputer ScienceMathematicsAlgorithmsCombinatoricsComputational GeometryAlgebraic CombinatoricsCombinatorial EnumerationString AlgorithmsComplexity Of String AlgorithmsPermutation GenerationRecursive Algorithm Design
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.
9
Algorithms on strings, trees, and sequences
Dan Gusfield · 1997 · 1.7K citations
Factorizing words over an ordered alphabet
Jean Pierre Duval · Journal of Algorithms · 1983 · 236 citations
Symmetry types of periodic sequences
E. N. Gilbert, John Riordan · Illinois Journal of Mathematics · 1961 · 110 citations
Frank Ruskey, Carla D. Savage, Terry Min Yih Wang · Journal of Algorithms · 1992 · 91 citations