Finding the longest substring which occurs twice in a given string
This blog post has moved to https://matthewvaneerde.wordpress.com/2012/09/28/finding-the-longest-substring-which-occurs-twice-in-a-given-string/
Comments
Anonymous
September 28, 2012
It appears that an O(n) algorithm exists using a suffix tree instead of a suffix array: en.wikipedia.org/.../Longest_repeated_substring_problemAnonymous
September 28, 2012
A better link to the O(n) solution: www.allisons.org/.../Suffix