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:
“The best liar is he who makes the smallest amount of lying go the longest way.”
—Samuel Butler (1835–1902)
“We are the creatures of imagination, passion, and self- will, more than of reason or even of self-interest.... Even in the common transactions and daily intercourse of life, we are governed by whim, caprice, prejudice, or accident. The falling of a teacup puts us out of temper for the day; and a quarrel that commenced about the pattern of a gown may end only with our lives.”
—William Hazlitt (1778–1830)
“The problem of the twentieth century is the problem of the color-line—the relation of the darker to the lighter races of men in Asia and Africa, in America and the islands of the sea. It was a phase of this problem that caused the Civil War.”
—W.E.B. (William Edward Burghardt)