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)
“When a man says that he is Jesus or Napoleon, or that the Martians are after him, or claims something else that seems outrageous to common sense, he is labeled psychotic and locked up in a madhouse. Freedom of speech is only for normal people.”
—Thomas Szasz (b. 1920)
“In the nineteenth century the problem was that God is dead; in the twentieth century the problem is that man is dead.”
—Erich Fromm (1900–1980)