Glossary: Algorithms Beyond the Basics in Java

longest common subsequence

A classic 2D dynamic programming problem that finds the longest sequence of letters appearing in the same order in two strings. The letters need not be next to each other.