Longest common subsequence: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    10 October 2022

    • curprev 10:5810:58, 10 October 2022‎ Admin talk contribs‎ 778 bytes +778‎ 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..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Longest_common_subsequence"