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:
“Freud is all nonsense; the secret of neurosis is to be found in the family battle of wills to see who can refuse longest to help with the dishes. The sink is the great symbol of the bloodiness of family life.”
—Julian Mitchell (20th century)
“I have thought there was some advantage even in death, by which we “mingle with the herd of common men.””
—Henry David Thoreau (1817–1862)
“The problem is that we attempt to solve the simplest questions cleverly, thereby rendering them unusually complex. One should seek the simple solution.”
—Anton Pavlovich Chekhov (1860–1904)