What I am trying to do is given a string, find the sets of identical substrings within the string (of a certain minimum length).
Examples: in "abracadabra", we have 2 occurrences of "abra" in "humpty dumpty", we have 2 occurrences of "umpty" in "How much wood would a woodchuck chuck if a woodchuck could chuck wood?", we have 2 occurrences of " a woodchuck ", 4 of "chuck ", 4 of " wood", 2 of "ould " I have searched the net and found some info on things like Longest Common Subsequence/SubString, suffix trees, and Lev. distance, but can anyone give me any specific pointers or any tips/ideas/shortcuts? Thanks. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
