My question is similar to How to efficiently find identical substrings of a specified length in a collection of strings
Let's assume that I have t strings, each one is at length n
and I need to find a substring at length k that has at most one index that is not identical and it needs to be the same index in every string, for example, consider the following 4 strings:
ACTAGGGGT
TAGGAAACC
CCCGGTTGG
GTGGGACTG
The output, in this case, should be: T*GG and S = (3,1,6,2)
where S is the starting index of the substring in each string Si.
