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)
“Nature seems to have taken a particular Care to disseminate her Blessings among the different Regions of the World, with an Eye to this mutual Intercourse and Traffick among Mankind, that the Natives of the several Parts of the Globe might have a kind of Dependance [sic] upon one another, and be united together by their common Interest.”
—Joseph Addison (1672–1719)
“What had really caused the women’s movement was the additional years of human life. At the turn of the century women’s life expectancy was forty-six; now it was nearly eighty. Our groping sense that we couldn’t live all those years in terms of motherhood alone was “the problem that had no name.” Realizing that it was not some freakish personal fault but our common problem as women had enabled us to take the first steps to change our lives.”
—Betty Friedan (20th century)