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:
“Involuntary mental hospitalization is like slavery. Refining the standards for commitment is like prettifying the slave plantations. The problem is not how to improve commitment, but how to abolish it.”
—Thomas Szasz (b. 1920)
“Perhaps the best definition of progress would be the continuing efforts of men and women to narrow the gap between the convenience of the powers that be and the unwritten charter.”
—Nadine Gordimer (b. 1923)