Efficient string matching with k mismatches

Gad M. Landau, Uzi Vishkin

Research output: Contribution to journalArticlepeer-review


Given a text of length n, a pattern of length m, and an integer k, we present an algorithm for finding all occurrences of the pattern in the text, each with at most k mismatches. The algorithm runs in O(k(m log m + n)) time.

Original languageEnglish
Pages (from-to)239-249
Number of pages11
JournalTheoretical Computer Science
Issue numberC
StatePublished - 1986
Externally publishedYes

Bibliographical note

Funding Information:
* Present affiliation: Department of Computer Science, School of Mathematical Sciences, Tel Aviv University, Tel Aviv, Israel. The research of this author was supported by NSF Grants NSF-DCR-8318874 and NSF-DCR-8413359, ONR Grant N00014-85-K-004a6n d by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy under Contract Number DE-AC02-76ER03077.

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


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

Cite this