Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Knuth–Morris–Pratt algorithm

Known as: Knuth-Morris-Pratt string matching algorithm, Knuth-Pratt-Morris, Knuth–Morris–Pratt 
In computer science, the Knuth–Morris–Pratt string searching algorithm (or KMP algorithm) searches for occurrences of a "word" W within a main "text… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
In this research modeled a search process of the Knuth-Morris-Pratt algorithm in the form of easy-to-understand visualization… Expand
Is this relevant?
2013
2013
In my view, the Knuth-Morris-Pratt string searching algorithm is one of those “magic” algorithms that do something wonderful but… Expand
Is this relevant?
2011
2011
Fingerprint detection technology is used very often and the general public in the identification of a person’s identity, even… Expand
  • figure 4.4
Is this relevant?
2008
2008
 
Is this relevant?
2006
2006
In the present work we perform compressed pattern matching in binary Huffman encoded texts [Huffman, D. (1952). A method for the… Expand
Is this relevant?
2005
2005
In this and the next two sections we will talk about strings, which are really just arrays. The elements of the array come from a… Expand
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
1999
Highly Cited
1999
The distinction between relatively independent versus interdependent self-construals has been strongly associated with several… Expand
  • figure 2
  • figure 1
  • figure 3
Is this relevant?
Highly Cited
1996
Highly Cited
1996
We describe a set of image processing algorithms for extracting quantitative data from digitized video microscope images of… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
1989
1989
This paper deals with an average analysis of the Knuth-Morris-Pratt algorithm. Searching all occurrences of a given pattern p in… Expand
Is this relevant?
Highly Cited
1976
Highly Cited
1976
A new algorithm is presented for constructing auxiliary digital search trees to aid in exact-match substring searching. This… Expand
  • figure 2
  • figure 5
Is this relevant?