Problem Definition
Given two strings, of length and of length, find the longest strings which are substrings of both and .
A generalisation is the k-common substring problem. Given the set of strings, where and Σ. Find for each 2 ≤ ≤, the longest strings which occur as substrings of at least strings.
Read more about this topic: Longest Common Substring Problem
Famous quotes containing the words problem and/or definition:
“Consciousness is what makes the mind-body problem really intractable.”
—Thomas Nagel (b. 1938)
“... we all know the wag’s definition of a philanthropist: a man whose charity increases directly as the square of the distance.”
—George Eliot [Mary Ann (or Marian)