Enumerative combinatorics
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
An Efficient Algorithm for Generating Necklaces with Fixed Density
SIAM Journal on Computing
A fast algorithm to generate unlabeled necklaces
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Minimal de bruijn sequence in a language with forbidden substrings
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
Given a length m string f over a k-ary alphabet and a positive integer n, we develop effcient algorithms to generate (a) all k-ary strings of length n that have no substring equal to f, (b) all k-ary circular strings of length n that have no substring equal to f, and (c) all k-ary necklaces of length n that have no substring equal to f, where f is an aperiodic necklace. Each of the algorithms runs in amortized time O(1) per string generated, independent of k, m, and n.