Skip to search formSkip to main contentSkip to account menu

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 (opens in a new tab)

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… 
2016
2016
In this paper an algorithm for detecting anomalous behavior on computer systems is proposed. The work is based on information… 
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… 
Review
2008
Review
2008
The literature on identification in organizations is surprisingly diverse and large. This article reviews the literature in terms… 
Highly Cited
1999
Highly Cited
1999
The distinction between relatively independent versus interdependent self-construals has been strongly associated with several… 
Highly Cited
1996
Highly Cited
1996
We describe a set of image processing algorithms for extracting quantitative data from digitized video microscope images of… 
1989
1989
  • M. Régnier
  • International Symposium on Mathematical…
  • 1989
  • Corpus ID: 250858
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…