Is there research that applies to classical questions of stringology; maximal repetitions, pattern matching, longest repeated substring, .. but replaced the definition of string as a sequence of elements of an alphabet with a sequence of subsets of an alphabet?
My requirement is a softer definition for "x is substring of y" that works on the subset relation instead of equivalence between elements of the sequence.
To give examples ("," is the seperator between sets):
- "$a,a,a$" is a substring of "$abcd,axyz,artz$".
- In "$a,b,a,a,c,a$" "$a,,a$" is the most common substring of length 3 ("$a,,,a$" of length 4).
(I am kinda uncomfortable using/inventing the words setstring, subsetstring, uh setstringsubset Oo.. in the expectation that someone must have had that idea before me)