Longest Common Substring with don't cares: 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.

15 February 2023

  • curprev 11:1811:18, 15 February 2023‎ Admin talk contribs‎ 1,363 bytes +1,363‎ Created page with "{{DISPLAYTITLE:Longest Common Substring with don't cares (Longest Common Subsequence)}} == Description == Find the length of the longest common substring of two strings S and T, where S is a binary string and T is is a binary string and additional * characters that can match either 0 or 1. == Related Problems == Generalizations: Longest Common Subsequence == Parameters == <pre>$n$: length of the longer input string $m$: length of the shorter input string $r$:..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Longest_Common_Substring_with_don%27t_cares"