Skip to main content
Journal ArticleOPEN ACCESS

Improved string matching with k mismatches

  • Galil Z
  • Giancarlo R
ACM SIGACT News (1986) 17(4) 52-54
DOI: 10.1145/8307.8309
N/ACitations
Citations of this article
11Readers
Mendeley users who have this article in their library.

Abstract

Two improved algorithms for string matching with k mismatches are presented. One algorithm is based on fast integer multiplication algorithms whereas the other follows more closely classic string-matching techniques. © 1987.

Cite

CITATION STYLE

APA

Galil, Z., & Giancarlo, R. (1986). Improved string matching with k mismatches. ACM SIGACT News, 17(4), 52–54. https://doi.org/10.1145/8307.8309

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free