Longest Common Substring Problem

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 world is but a perennial movement. All things in it are in constant motion—the earth, the rocks of the Caucasus, the pyramids of Egypt—both with the common motion and with their own.
    Michel de Montaigne (1533–1592)

    I tell you, sir, the only safeguard of order and discipline in the modern world is a standardized worker with interchangeable parts. That would solve the entire problem of management.
    Jean Giraudoux (1882–1944)