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.

28 April 2023

15 February 2023

  • curprev 11:1811:18, 15 February 2023‎ Admin talk contribs‎ 1,566 bytes +1,566‎ Created page with "{{DISPLAYTITLE:Longest Common Subsequence (Longest Common Subsequence)}} == 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). == Related Problems == Subproblem: Longest Common Substring with don't cares == Parameters == <pre>$n$: length of the longer input string $m$: length of the shorter input string $r$: length of the LCS $s..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Longest_Common_Subsequence"