Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 5 of 5 for “"Universal Cycle"”.
-
Novel universal cycle constructions for a variety of combinatorial objects
… as a substring. This sequence is an example of a universal cycle. A universal cycle for an arbitrary set S is a cyclic sequence of length |S| whose substrings of length n encode |S| distinct instances in S. When S is the set of k-ary strings of length n, these sequences are commonly studied under …
-
Constructing de Bruijn sequences by concatenating cycles of feedback shift registers
A universal cycle for a set $\mathbf{S}$ of strings is a circular sequence of length $|\mathbf{S}|$ that contains every element of $\mathbf{S}$ as a substring exactly once. In this thesis we introduce sufficient conditions for when an ordering of universal cycles for disjoint sets can be …
-
Shift gray codes
… n−1) are also found for multiset permutations. A universal cycle that omits the last (redundant) symbol from each permutation is obtained by recording the first symbol of each permutation in this Gray code. As a special case, these shorthand universal cycles provide a new fixed-density analogue to …
-
Universal Cycles for Some Combinatorial Objects
A de Bruijn cycle commonly referred to as a universal cycle (u-cycle), is a complete and compact listing of a collection of combinatorial objects. In this paper, we show the power of de Bruijn's original theorem, namely that the cycles bearing his name exist for n-letter words on a k-letter …
-
Efficient Construction of Complement-Free and Reverse-Complement-Free Sequences
Complement-free and reverse-complement-free sequences are cyclic sequences in which the appearance of a length-n substring forbids its complement, or respectively its reverse complement. These constraints arise in DNA computing, where reverse-complementary substrings cause strands to fold into …