Longest common substring regarding the set of de Bruijn sequences
Listed in
This article is not in any list yet, why not save it to one of your lists.Abstract
An algorithm is presented in order to, given any alphabet of size k, compute the longest common substring (LCS) between a sequence S of length N and the whole set of de Bruijn sequences for that length, understood as the maximum value between all LCS of S respecting every sequence of the set.