My Problem is to find the most common substrings of a given string, which are the longest at the same time (not part of a longer substring) in an efficiently way (-> long strings)
Any ideas?
My Problem is to find the most common substrings of a given string, which are the longest at the same time (not part of a longer substring) in an efficiently way (-> long strings)
Any ideas?
Are you looking for Longest Common Substring
or Longest Common Subsequence
? In any case, Geek Viewpoint's Longest Common Subsequence should help you get the answer