Longest common subsequence: Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Problem Description== The longest common subsequence (LCS) problem is the problem of finding the longest subsequence common to all sequences in a set of sequences (often just two sequences). == Bounds Chart == 1050px == Step Chart == 1050px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Classes !! widt...") |
(No difference)
|
Latest revision as of 11:58, 10 October 2022
Problem Description
The longest common subsequence (LCS) problem is the problem of finding the longest subsequence common to all sequences in a set of sequences (often just two sequences).
Bounds Chart
Step Chart
Improvement Table
Complexity Classes | Algorithm Paper Links | Lower Bounds Paper Links |
---|---|---|
Exp/Factorial | ||
Polynomial > 3 | ||
Cubic | ||
Quadratic | ||
nlogn | ||
Linear | ||
logn |