Longest repeated substring problem
In computer science, the longest repeated substring problem is the problem of finding the longest substring of a string that occurs at least twice.
This problem can be solved in linear time and space [math]\displaystyle{ \Theta(n) }[/math] by building a suffix tree for the string (with a special end-of-string symbol like '$' appended), and finding the deepest internal node in the tree with more than one child. Depth is measured by the number of characters traversed from the root. The string spelled by the edges from the root to such a node is a longest repeated substring. The problem of finding the longest substring with at least [math]\displaystyle{ k }[/math] occurrences can be solved by first preprocessing the tree to count the number of leaf descendants for each internal node, and then finding the deepest node with at least [math]\displaystyle{ k }[/math] leaf descendants. To avoid overlapping repeats, you can check that the list of suffix lengths has no consecutive elements with less than prefix-length difference.
In the figure with the string "ATCGATCGA$", the longest substring that repeats at least twice is "ATCGA".
External links
- Allison, L. "Suffix Trees". http://www.allisons.org/ll/AlgDS/Tree/Suffix/.
- C implementation of Longest Repeated Substring using Suffix Tree
- Online Demo: Longest Repeated Substring
 |  |
