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:
“Success four flights Thursday morning all against twenty one mile wind started from Level with engine power alone speed through air thirty one miles longest 57 second inform Press home Christmas.”
—Orville Wright (1871–1948)
“There is all the poetry in the world in a name. It is a poem which the mass of men hear and read. What is poetry in the common sense, but a hearing of such jingling names? I want nothing better than a good word. The name of a thing may easily be more than the thing itself to me.”
—Henry David Thoreau (1817–1862)
“The family environment in which your children are growing up is different from that in which you grew up. The decisions our parents made and the strategies they used were developed in a different context from what we face today, even if the “content” of the problem is the same. It is a mistake to think that our own experience as children and adolescents will give us all we need to help our children. The rules of the game have changed.”
—Lawrence Kutner (20th century)