Arbitrary-length analogs to de Bruijn sequences
A Nellore, R Ward - arXiv preprint arXiv:2108.07759, 2021 - arxiv.org
Let $\widetilde {\alpha} $ be a length-$ L $ cyclic sequence of characters from a size-$ K $
alphabet $\mathcal {A} $ such that the number of occurrences of any length-$ m $ string on …
alphabet $\mathcal {A} $ such that the number of occurrences of any length-$ m $ string on …
Arbitrary-length analogs to de Bruijn sequences
A Nellore, R Ward - arXiv e-prints, 2021 - ui.adsabs.harvard.edu
Abstract Let $\widetilde {\alpha} $ be a length-$ L $ cyclic sequence of characters from a
size-$ K $ alphabet $\mathcal {A} $ such that the number of occurrences of any length-$ m …
size-$ K $ alphabet $\mathcal {A} $ such that the number of occurrences of any length-$ m …
[PDF][PDF] Arbitrary-Length Analogs to de Bruijn Sequences
A Nellore, R Ward - scholar.archive.org
Let α be a length-L cyclic sequence of characters from a size-K alphabet A such that for
every positive integer m≤ L, the number of occurrences of any length-m string on A as a …
every positive integer m≤ L, the number of occurrences of any length-m string on A as a …
[PDF][PDF] Arbitrary-Length Analogs to de Bruijn Sequences
A Nellore, R Ward - 33rd Annual Symposium on Combinatorial Pattern …, 2022 - cs.emis.de
Let α be a length-L cyclic sequence of characters from a size-K alphabet A such that for
every positive integer m≤ L, the number of occurrences of any length-m string on A as a …
every positive integer m≤ L, the number of occurrences of any length-m string on A as a …
[PDF][PDF] Arbitrary-Length Analogs to de Bruijn Sequences
A Nellore, R Ward - dagstuhl.sunsite.rwth-aachen.de
Let α be a length-L cyclic sequence of characters from a size-K alphabet A such that for
every positive integer m≤ L, the number of occurrences of any length-m string on A as a …
every positive integer m≤ L, the number of occurrences of any length-m string on A as a …
Arbitrary-Length Analogs to de Bruijn Sequences
A Nellore, R Ward - 33rd Annual Symposium on Combinatorial …, 2022 - drops.dagstuhl.de
Let α̃ be a length-L cyclic sequence of characters from a size-K alphabet 𝒜 such that for
every positive integer m≤ L, the number of occurrences of any length-m string on 𝒜 as a …
every positive integer m≤ L, the number of occurrences of any length-m string on 𝒜 as a …
[PDF][PDF] Arbitrary-Length Analogs to de Bruijn Sequences
A Nellore, R Ward - 33rd Annual Symposium on Combinatorial Pattern …, 2022 - d-nb.info
Let α be a length-L cyclic sequence of characters from a size-K alphabet A such that for
every positive integer m≤ L, the number of occurrences of any length-m string on A as a …
every positive integer m≤ L, the number of occurrences of any length-m string on A as a …
Arbitrary-Length Analogs to de Bruijn Sequences
A Nellore, R Ward - 33rd Annual Symposium on …, 2022 - ohsu.elsevierpure.com
Let αe be a length-L cyclic sequence of characters from a size-K alphabet A such that for
every positive integer m≤ L, the number of occurrences of any length-m string on A as a …
every positive integer m≤ L, the number of occurrences of any length-m string on A as a …
[PDF][PDF] Arbitrary-Length Analogs to de Bruijn Sequences
A Nellore, R Ward - cs.emis.de
Let α be a length-L cyclic sequence of characters from a size-K alphabet A such that for
every positive integer m≤ L, the number of occurrences of any length-m string on A as a …
every positive integer m≤ L, the number of occurrences of any length-m string on A as a …
Arbitrary-Length Analogs to de Bruijn Sequences
A Nellore, R Ward - 33rd Annual Symposium on Combinatorial …, 2022 - drops.dagstuhl.de
Let α̃ be a length-L cyclic sequence of characters from a size-K alphabet 𝒜 such that for
every positive integer m≤ L, the number of occurrences of any length-m string on 𝒜 as a …
every positive integer m≤ L, the number of occurrences of any length-m string on 𝒜 as a …