This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
public:de_bruijn [2022/01/28 17:13] haggerty |
public:de_bruijn [2022/01/28 17:57] (current) haggerty |
||
|---|---|---|---|
| Line 24: | Line 24: | ||
| which is clearly vast for even modest values of //k// and //n//. Note that any one of these unique sequences may further be used to create //k!// derivative sequences by permuting the assignment of labels in the alphabet. | which is clearly vast for even modest values of //k// and //n//. Note that any one of these unique sequences may further be used to create //k!// derivative sequences by permuting the assignment of labels in the alphabet. | ||
| - | Cyclic sequences of this kind are a subject of study in discrete mathematics and have been discovered independently many times. Nicolaas Govert de Bruijn (pronounced roughly “duh-BROUN”), | + | Cyclic sequences of this kind are a subject of study in discrete mathematics and have been discovered independently many times. Nicolaas Govert de Bruijn (pronounced roughly “duh-BROUN”), |
| =====Generation of de Bruijn sequences===== | =====Generation of de Bruijn sequences===== | ||
| {{ : | {{ : | ||
| Line 42: | Line 42: | ||
| We have produced a command line (c code) executable which may be used to produce path guided de Bruijn sequences. | We have produced a command line (c code) executable which may be used to produce path guided de Bruijn sequences. | ||
| - | <WRAP info round box 200px center>**Link to Software**\\ \\ [[: | + | **Link to Software**\\ \\ [[: |
| Line 57: | Line 57: | ||
| ====Type 1, Index 1 sequence==== | ====Type 1, Index 1 sequence==== | ||
| - | [[t1i1_sequences|Type 1 Index 1 sequences]], | + | [[t1i1_sequences|Type 1 Index 1 sequences]], |