Skip to search formSkip to main contentSkip to account menu
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… 
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… 
2013
2013
In my view, the Knuth-Morris-Pratt string searching algorithm is one of those “magic” algorithms that do something wonderful but… 
2011
2011
Fingerprint detection technology is used very often and the general public in the identification of a person’s identity, even… 
  • figure 4.4
Review
2008
Review
2008
The literature on identification in organizations is surprisingly diverse and large. This article reviews the literature in terms… 
  • figure 1
  • figure 2
  • figure 3
2006
2006
In the present work we perform compressed pattern matching in binary Huffman encoded texts [Huffman, D. (1952). A method for the… 
2004
2004
This paper presents a compressed pattern matching in Huffman encoded texts. A modified Knuth-Morris-Pratt (KMP) algorithm is used… 
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Review
2003
Review
2003
The purpose of this qualitative case study was to explore the asynchronous communication perspectives and experiences of… 
Highly Cited
1996
Highly Cited
1996
We describe a set of image processing algorithms for extracting quantitative data from digitized video microscope images of… 
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
1989
1989
This paper deals with an average analysis of the Knuth-Morris-Pratt algorithm. Searching all occurrences of a given pattern p in… 
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… 
  • figure 2
  • figure 5