Generating necklaces and strings with forbidden substrings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1858, Issue , 2000, Pages 330-339

  Ruskey, Frank ^a   Sawada, Joe ^a  

^a UNIVERSITY OF VICTORIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AMORTIZED TIME; INTEGER-N; SUB-STRINGS; SUBSTRING;

COMBINATORIAL MATHEMATICS;

EID: 84956973072     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44968-x_33     Document Type: Conference Paper

References (5)

1. A. Aho, J. Hopcroft, and J. Ullman, The Design and Analysis of Computer Algorithms, Addisom-Wesley, 1974.
2. D. Gusfield, Algorithms on Strings, Trees, and Sequences, Cambridge University Press, 1997.
3. F. Ruskey, J. Sawada, An efficient algorithm for generating necklaces of fixed density, SIAM Journal on Computing, 29 (1999) 671-684.
4. F. Ruskey, J. Sawada, A fast algorithm to generate unlabeled necklaces, 11th Annual ACM-SIGACT Symposium on Discrete Algorithms (SODA), 2000, 256-262.
5. R.P. Stanley, Enumerative Combinatorics, Volume I, Wadsworth & Brooks/Cole, 1986.