A filtering algorithm for k-mismatch with don't cares

Raphaël Clifford, Ely Porat

Research output: Contribution to journalArticlepeer-review

5 Scopus citations


We present a filtering based algorithm for the k-mismatch pattern matching problem with don't cares. Given a text t of length n and a pattern p of length m with don't care symbols in either p or t (but not both), and a bound k, our algorithm finds all the places that the pattern matches the text with at most k mismatches. The algorithm is deterministic and runs in Θ(nm1/3k1/3log2/3m) time.

Original languageEnglish
Pages (from-to)1021-1025
Number of pages5
JournalInformation Processing Letters
Issue number22
StatePublished - 31 Oct 2010


  • Algorithms
  • Combinatorial problems
  • Design of algorithms
  • Don't cares
  • Fast Fourier transforms
  • Filtering
  • Pattern matching
  • String algorithms


Dive into the research topics of 'A filtering algorithm for k-mismatch with don't cares'. Together they form a unique fingerprint.

Cite this