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:
“The problem of the novelist who wishes to write about a man’s encounter with God is how he shall make the experience—which is both natural and supernatural—understandable, and credible, to his reader. In any age this would be a problem, but in our own, it is a well- nigh insurmountable one. Today’s audience is one in which religious feeling has become, if not atrophied, at least vaporous and sentimental.”
—Flannery O’Connor (1925–1964)
“The physicians say, they are not materialists; but they are:MSpirit is matter reduced to an extreme thinness: O so thin!—But the definition of spiritual should be, that which is its own evidence. What notions do they attach to love! what to religion! One would not willingly pronounce these words in their hearing, and give them the occasion to profane them.”
—Ralph Waldo Emerson (1803–1882)