DeepAI AI Chat
Log In Sign Up

Extending de Bruijn sequences to larger alphabets

by   Verónica Becher, et al.
Apple Inc
University of Buenos Aires

A circular de Bruijn sequence of order n in an alphabet of k symbols is a sequence in which each sequence of length n occurs exactly once. In this work we show that for each circular de Bruijn sequence v of order n in an alphabet of k symbols there is another circular de Bruijn sequence w also of order n in an alphabet with one more symbol, that is an alphabet of k + 1 symbols, such that v is a subsequence of w and in between any two successive occurrences of the new symbol in w there are at most n + 2k-2 consecutive symbols of v. We give an algorithm that receives as input such a sequence v and outputs a sequence w. We also give a much faster algorithm that receives as input such a sequence v and outputs a sequence w, but the new symbol may not be evenly spread out.


page 1

page 2

page 3

page 4


Learning to Decipher Hate Symbols

Existing computational models to understand hate speech typically frame ...

On Embedding De Bruijn Sequences by Increasing the Alphabet Size

The generalization of De Bruijn sequences to infinite sequences with res...

Method and apparatus for automatic text input insertion in digital devices with a restricted number of keys

A device which contains number of symbol input keys, where the number of...

Learning and analyzing vector encoding of symbolic representations

We present a formal language with expressions denoting general symbol st...

Identifying Hierarchical Structure in Sequences: A linear-time algorithm

SEQUITUR is an algorithm that infers a hierarchical structure from a seq...

An Information-Theoretical Analysis of the Minimum Cost to Erase Information

We normally hold a lot of confidential information in hard disk drives a...

A Euclidean Algorithm for Binary Cycles with Minimal Variance

The problem is considered of arranging symbols around a cycle, in such a...