• + 1 comment

    I think best solution uses dynamic programming and suffix trees http://en.wikipedia.org/wiki/Longest_common_substring_problem