longest common substring problem

Suffix trees also provided one of the first linear-time solutions for the longest common substring problem.

Finding the longest string which is equal to a substring of two or more strings is known as the longest common substring problem.