Analysis of Algorithms for Listing Equivalence Classes of k-ary Strings

@article{Proskurowski1998AnalysisOA,
  title={Analysis of Algorithms for Listing Equivalence Classes of k-ary Strings},
  author={Andrzej Proskurowski and Frank Ruskey and Malcolm A Smith},
  journal={SIAM J. Discrete Math.},
  year={1998},
  volume={11},
  pages={94-109}
}
We give eecient algorithms for listing equivalence classes of k-ary strings under reversal and permutation of alphabet symbols. As representative of each equivalence class we choose that string which is lexicographically smallest. These algorithms use space O(n) and time O(p kN), where N is the total number of strings generated and n is the length of each string. For k = 2, we obtain a recursive decomposition of the set of binary strings that allows the strings to be generated without rejecting… CONTINUE READING
Highly Cited
This paper has 19 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 19 references

Generatingfunctionology

  • H. S. Wilf
  • Academic Press
  • 1990
Highly Influential
3 Excerpts

Listing all bitstrings inequivalent under reversal

  • F. Ruskey
  • unpublished manuscript
  • 1990
Highly Influential
7 Excerpts

Constructive Combinatorics

  • D. Stanton, D. White
  • Springer-Verlag
  • 1986
Highly Influential
5 Excerpts

Combinatorics for Computer

  • S. G. Williamson
  • 1985
Highly Influential
4 Excerpts

Analysis of algorithms for generating k-paths

  • A. Proskurowski, F. Ruskey, M. Smith
  • DCS-178, Tech. Report, Univ. of Victoria
  • 1992
1 Excerpt

Similar Papers

Loading similar papers…