Frequent Words with Mismatches Problem: 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

10 April 2023

15 February 2023

  • curprev 11:2611:26, 15 February 2023Admin talk contribs 1,200 bytes +1,200 Created page with "{{DISPLAYTITLE:Frequent Words with Mismatches Problem (Frequent Words with Mismatches Problem)}} == Description == Given two strings, determine the most frequent substring with at most $k$ mismatches, where mismatches are not counted towards the length of the substring. == Parameters == <pre>n: length of string k: length of words d: number of allowed mismatches sigma: size of alphabet</pre> == Table of Algorithms == {| class="wikitable sortable" style="text-alig..."