Parameterized matching with mismatches

Alberto Apostolico, Péter L. Erdos, Moshe Lewenstein

Research output: Contribution to journalArticlepeer-review

39 Scopus citations


The problem of approximate parameterized string searching consists of finding, for a given text t = t1 t2 ... tn and pattern p = p1 p2 ... pm over respective alphabets Σt and Σp, the injection πi from Σp to Σt maximizing the number of matches between πi (p) and ti ti + 1 ... ti + m - 1(i = 1, 2, ..., n - m + 1) . We examine the special case where both strings are run-length encoded, and further restrict to the case where one of the alphabets is binary. For this case, we give a construction working in time O (n + (rp × rt) α (rt) log (rt)), where rp and rt denote the number of runs in the corresponding encodings for y and x, respectively, and α is the inverse of the Ackermann's function.

Original languageEnglish
Pages (from-to)135-140
Number of pages6
JournalJournal of Discrete Algorithms
Issue number1
StatePublished - Mar 2007


  • Algorithms
  • Parameterized matching
  • Pattern matching
  • Pattern matching with mismatches
  • String matching


Dive into the research topics of 'Parameterized matching with mismatches'. Together they form a unique fingerprint.

Cite this