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)
“Mankind’s common instinct for reality ... has always held the world to be essentially a theatre for heroism. In heroism, we feel, life’s supreme mystery is hidden. We tolerate no one who has no capacity whatever for it in any direction. On the other hand, no matter what a man’s frailties otherwise may be, if he be willing to risk death, and still more if he suffer it heroically, in the service he has chosen, the fact consecrates him forever.”
—William James (1842–1910)
“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)