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 induction is not a problem of demonstration but a problem of defining the difference between valid and invalid
predictions.”
—Nelson Goodman (1906)
“Mothers often are too easily intimidated by their children’s negative reactions...When the child cries or is unhappy, the mother reads this as meaning that she is a failure. This is why it is so important for a mother to know...that the process of growing up involves by definition things that her child is not going to like. Her job is not to create a bed of roses, but to help him learn how to pick his way through the thorns.”
—Elaine Heffner (20th century)