Longest Common Subsequence Problem
The longest common subsequence (LCS) problem is to find the longest subsequence common to all sequences in a set of sequences (often just two). Note that subsequence is different from a substring, see substring vs. subsequence. It is a classic computer science problem, the basis of file comparison programs such as diff, and has applications in bioinformatics.
Read more about Longest Common Subsequence Problem: Complexity, Solution For Two Sequences, Relation To Other Problems, Code Optimization
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)
“As to what we call the masses, and common men;Mthere are no common men. All men are at last of a size; and true art is only possible, on the conviction that every talent has its apotheosis somewhere. Fair play, and an open field, and freshest laurels to all who have won them!”
—Ralph Waldo Emerson (1803–1882)
“Hypocrisy is the essence of snobbery, but all snobbery is about the problem of belonging.”
—Alexander Theroux (b. 1940)