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:
“A bill... is the most extraordinary locomotive engine that the genius of man ever produced. It would keep on running during the longest lifetime, without ever once stopping of its own accord.”
—Charles Dickens (1812–1870)
“It is to be presumed, that a man of common sense, who does not desire to please, desires nothing at all; since he must know that he cannot obtain anything without it.”
—Philip Dormer Stanhope, 4th Earl Chesterfield (1694–1773)
“Like the effects of industrial pollution ... the AIDS crisis is evidence of a world in which nothing important is regional, local, limited; in which everything that can circulate does, and every problem is, or is destined to become, worldwide.”
—Susan Sontag (b. 1933)