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:
“The best liar is he who makes the smallest amount of lying go the longest way.”
—Samuel Butler (1835–1902)
“Whenever there are in any country uncultivated lands and unemployed poor, it is clear that the laws of property have been so far extended as to violate natural right. The earth is given as a common stock for man to labor and live on.... The small landowners are the most precious part of a state.”
—Thomas Jefferson (1743–1826)
“From cradle to grave this problem of running order through chaos, direction through space, discipline through freedom, unity through multiplicity, has always been, and must always be, the task of education, as it is the moral of religion, philosophy, science, art, politics and economy; but a boy’s will is his life, and he dies when it is broken, as the colt dies in harness, taking a new nature in becoming tame.”
—Henry Brooks Adams (1838–1918)