Efficient string matching with k mismatches

Gad M. Landau; Uzi Vishkin

doi:10.1016/0304-3975(86)90178-7

Efficient string matching with k mismatches

Gad M. Landau
, Uzi Vishkin

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	English
Pages (from-to)	239-249
Number of pages	11
Journal	Theoretical Computer Science
Volume	43
Issue number	C
DOIs	https://doi.org/10.1016/0304-3975(86)90178-7
State	Published - 1986
Externally published	Yes

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

Access to Document

10.1016/0304-3975(86)90178-7

Cite this

@article{92e8cf13f0a34c35a010a7cd9d968637,

title = "Efficient string matching with k mismatches",

abstract = "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.",

author = "Landau, \{Gad M.\} and Uzi Vishkin",

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.",

year = "1986",

doi = "10.1016/0304-3975(86)90178-7",

language = "English",

volume = "43",

pages = "239--249",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

number = "C",

}

TY - JOUR

T1 - Efficient string matching with k mismatches

AU - Landau, Gad M.

AU - Vishkin, Uzi

N1 - 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.

PY - 1986

Y1 - 1986

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/38249042384

U2 - 10.1016/0304-3975(86)90178-7

DO - 10.1016/0304-3975(86)90178-7

M3 - Article

AN - SCOPUS:38249042384

SN - 0304-3975

VL - 43

SP - 239

EP - 249

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - C

ER -

Efficient string matching with k mismatches

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this