suffix-tree
How do you find the longest common substring of n strings using Suffix Arrays?
how to find all the possible longest common subsequence from the same position
Related Links
How do you find the longest common substring of n strings using Suffix Arrays?
how to find all the possible longest common subsequence from the same position
String Indexing and Suffix Trees