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:
“Success four flights Thursday morning all against twenty one mile wind started from Level with engine power alone speed through air thirty one miles longest 57 second inform Press home Christmas.”
—Orville Wright (1871–1948)
“The common erotic project of destroying women makes it possible for men to unite into a brotherhood; this project is the only firm and trustworthy groundwork for cooperation among males and all male bonding is based on it.”
—Andrea Dworkin (b. 1946)
“Any solution to a problem changes the problem.”
—R.W. (Richard William)