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 longest day must have its close—the gloomiest night will wear on to a morning. An eternal, inexorable lapse of moments is ever hurrying the day of the evil to an eternal night, and the night of the just to an eternal day.”
—Harriet Beecher Stowe (1811–1896)
“Governments which have a regard to the common interest are constituted in accordance with strict principles of justice, and are therefore true forms; but those which regard only the interest of the rulers are all defective and perverted forms, for they are despotic, whereas a state is a community of freemen.”
—Aristotle (384–322 B.C.)
“How much atonement is enough? The bombing must be allowed as at least part-payment: those of our young people who are concerned about the moral problem posed by the Allied air offensive should at least consider the moral problem that would have been posed if the German civilian population had not suffered at all.”
—Clive James (b. 1939)