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:
“I have seen a thousand graves opened, and always perceived that whatever was gone, the teeth and hair remained of those who had died with them. Is not this odd? They go the very first things in youth & yet last the longest in the dust.”
—George Gordon Noel Byron (1788–1824)
“The same principles which at first view lead to skepticism, pursued to a certain point, bring men back to common sense.”
—George Berkeley (1685–1753)
“You are a problem and rune,
you are mystery;
writ on a stone.”
—Hilda Doolittle (1886–1961)