Fast algorithms to generate restricted classes of strings under rotation
A necklace is a representative of an equivalence class of k-ary strings under rotation. Efficient algorithms for generating (i.e., listing) necklaces have been known for some time. Many applications, however, require a restricted class of necklaces for which no efficient generation algorithm previou...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English en |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://dspace.library.uvic.ca//handle/1828/9017 |