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:

    For the longest time, marriage has had a guilty conscience about itself. Should we believe it?—Yes, we should believe it.
    Friedrich Nietzsche (1844–1900)

    Do you come to a philosopher as to a cunning man, to learn something by magic or witchcraft, beyond what can be known by common prudence and discretion?
    David Hume (1711–1776)

    Give a scientist a problem and he will probably provide a solution; historians and sociologists, by contrast, can offer only opinions. Ask a dozen chemists the composition of an organic compound such as methane, and within a short time all twelve will have come up with the same solution of CH4. Ask, however, a dozen economists or sociologists to provide policies to reduce unemployment or the level of crime and twelve widely differing opinions are likely to be offered.
    Derek Gjertsen, British scientist, author. Science and Philosophy: Past and Present, ch. 3, Penguin (1989)