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:
“Daisies in water are the longest lasting
flower you can give to someone.
Fact.
Buy daisies.
Not roses.”
—Anne Sexton (1928–1974)
“My facts shall be falsehoods to the common sense. I would so state facts that they shall be significant, shall be myths or mythologic. Facts which the mind perceived, thoughts which the body thought—with these I deal.”
—Henry David Thoreau (1817–1862)
“Every child is an artist. The problem is how to remain an artist once he grows up.”
—Pablo Picasso (1881–1973)