Generating bracelets in constant amortized time

SIAM Journal on Computing

Volumn 31, Issue 1, 2001, Pages 259-268

  Sawada, Joe ^a  

^a UNIVERSITY OF SYDNEY   (Australia)

Author keywords

Bracelet; CAT algorithm; Forbidden substring; Generate; Necklace

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; RECURSIVE FUNCTIONS; SET THEORY;

CONSTANT AMORTIZED TIME (CAT) ALGORITHMS;

COMBINATORIAL MATHEMATICS;

EID: 0036215403     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539700377037     Document Type: Article

References (13)

1. L. BATTON, C. BOHUN, A. BONA, K. CHENG, T. DOMAN, J. DREW, R. EDWARDS, S. KUTAY, C. LAFLAMME, D. MCCREA, W. MYRVOLD, F. RUSKEY, J. SAWADA, P. VAN DEN DRIESSCHE, J. VANDER KLOET, AND K. WOOD, Classification of chemical compound pharmacophore structures, in Proceedings of the Third PIMS Industrial Problem Solving Workshop, C. Bose, ed., 1999, pp. 83-93.
2. K. CATTELL, F. RUSKEY, J. SAWADA, C.R. MIERS, AND M. SERRA, Fast algorithms to generate necklaces, unlabeled necklaces, and irreducible polynomials over GF(2), J. Algorithms, 37 (2000), pp. 267-282.
3. W. CHEN AND J. LOUCK, Necklaces, MSS sequences, and DNA sequences, Adv. Appl. Math., 18 (1997), pp. 18-32.
4. J.-P. DUVAL, Factoring words over an ordered alphabet, J. Algorithms, 4 (1983), pp. 363-381.
5. P. EMMEL AND R. HERSCH, Exploring ink spreading, in Proceedings of the 8th IS & T/SID Color Imaging Conference: Color Science and Engineering, Scottsdale, AZ, 2000, pp. 335-341.
6. H. FREDRICKSEN AND I.J. KESSLER, An algorithm for generating necklaces of beads in two colors, Discrete Math., 61 (1986), pp. 181-188.
7. H. FREDRICKSEN AND J. MAIORANA, Necklaces of beads in k colors and k-ary de Bruijn sequences, Discrete Math., 23 (1978), pp. 207-210.
8. E.N. GILBERT AND J. RIORDAN, Symmetry types of periodic sequences, Illinois J. Math., 5 (1961), pp. 657-665.
9. D. GUSFIELD, Algorithms on Strings, Trees, and Sequences, Cambridge University Press, Cambridge, UK, 1997.
10. P. LISONEK, Computer-Assisted Studies in Algebraic Combinatorics, dissertation, Johannes Kepler University, Linz, Austria, 1994.
11. F. RUSKEY, C.D. SAVAGE, AND T. WANG, Generating necklaces, J. Algorithms, 13 (1992), pp. 414-430.
12. F. RUSKEY AND J. SAWADA, An efficient algorithm for generating necklaces with fixed density, SIAM J. Comput., 29 (1999), pp. 671-684.
13. F. RUSKEY AND J. SAWADA, Generating necklaces and strings with forbidden substrings, in Computing and Combinatorics, Lecture Notes in Comput. Sci. 1858, D.-Z. Du, P. Eades, V. Estivill-Castro, X. Lin, and A. Sharma, eds., Springer-Verlag, New York, 2000, pp. 330-339.