How about concentating all your strings into a single long string and then constructing a suffix tree? The strings will be seperated using a special character that does not belong to any of them (let's say that they will be null seperated). Using this suffix tree to find the longest common sub-word should not be difficult.
--~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
