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.
No takes yet. Share an insight, caveat, or question.
Oscar Cabrera (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: