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:
“I have seen a thousand graves opened, and always perceived that whatever was gone, the teeth and hair remained of those who had died with them. Is not this odd? They go the very first things in youth & yet last the longest in the dust.”
—George Gordon Noel Byron (1788–1824)
“Man that is born of woman hath but a short time to live, and is full of misery. He cometh up, and is cut down, like a flower; he fleeth as it were a shadow, and never continueth in one stay.”
—“Burial of the Dead,” first anthem, Book of Common Prayer (1662)
“The thinking person has the strange characteristic to like to create a fantasy in the place of the unsolved problem, a fantasy that stays with the person even when the problem has been solved and truth made its appearance.”
—Johann Wolfgang Von Goethe (1749–1832)