In computer science, the longest common substring problem is to find the longest string (or strings) that is a substring (or are substrings) of two or more strings. It should not be confused with the longest common subsequence problem. (For an explanation of the difference between a substring and a subsequence, see Substring vs. subsequence).
Read more about Longest Common Substring Problem: Example, Problem Definition, Algorithms, Pseudocode
Famous quotes containing the words longest, common and/or problem:
“Daisies in water are the longest lasting
flower you can give to someone.
Fact.
Buy daisies.
Not roses.”
—Anne Sexton (1928–1974)
“Yours are no common feet.
The lawyer don’t know what it is he’s buying:
So many miles you might have walked you won’t walk.
You haven’t run your forty orchids down.”
—Robert Frost (1874–1963)
“Great speeches have always had great soundbites. The problem now is that the young technicians who put together speeches are paying attention only to the soundbite, not to the text as a whole, not realizing that all great soundbites happen by accident, which is to say, all great soundbites are yielded up inevitably, as part of the natural expression of the text. They are part of the tapestry, they aren’t a little flower somebody sewed on.”
—Peggy Noonan (b. 1950)