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:
“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)
“There is all the poetry in the world in a name. It is a poem which the mass of men hear and read. What is poetry in the common sense, but a hearing of such jingling names? I want nothing better than a good word. The name of a thing may easily be more than the thing itself to me.”
—Henry David Thoreau (1817–1862)
“Every child is an artist. The problem is how to remain an artist once he grows up.”
—Pablo Picasso (1881–1973)