Around Maximum-Length K-Unique Sequence

A k-unique sequence is a sequence that for each k-mer either contains the k-mer or its reverse complement. The problem is to find a maximum-length k-unique sequence. In the talk, I will describe our solution and missing points in the proof, that will hopefully be solved by the audience. If time permits, I will present additional open problems in the field of sequence design.