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)
“This is really the common mentality of prisoners: they read with great attention all the articles that deal with illnesses and send away for treatises and “be your own doctor” or “emergency treatments” and end up by discovering that they have at least 300 or 400 illnesses, whose symptoms they are experiencing.”
—Antonio Gramsci (1891–1937)
“To make a good salad is to be a brilliant diplomatist—the problem is entirely the same in both cases. To know exactly how much oil one must put with one’s vinegar.”
—Oscar Wilde (1854–1900)