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)

Related topics

Related topics

12 relations
AlgorithmBoyer–Moore–Horspool algorithmComputational complexity theoryComputer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Python based parallel application of Knuth-Morris-Pratt algorithm
Parallel computations in multicore architectures are in big interest these days. Nearly all newly manufactured computers have… 
2013
2013
Reconstructing the Knuth-Morris-Pratt algorithm
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 Using Knuth-Morris-Pratt Algorithm
Fingerprint detection technology is used very often and the general public in the identification of a person’s identity, even… 
Highly Cited
2010
Highly Cited
2010
Antiferromagnetic ordering in the absence of a structural distortion in Ba(Fe$_{1-x}$Mn$_{x})_{2}$As$_{2}$
Neutron and x-ray diffraction studies of Ba (Fe1-x Mn x)2 As2 for low doping concentrations (xâ?¤0.176) reveal that at a critical… 
2010
2010
A possibilistic approach to risk aversion
In this paper a possibilistic model of risk aversion based on the lower and upper possibilistic expected values of a fuzzy number… 
2007
2007
The Transition Experience of Australian Students to University: The Importance of Social Support
The Australian Community Psychologist Volume 19 No 2 December 2007 It is often remarked that the only constant in today’s world… 
2007
2007
Efficient validation and construction of Knuth – Morris – Pratt arrays
Knuth-Morris-Pratt (KMP) arrays are known as the ”failure function” of the Knuth-Morris-Pratt string matching algorithm. We… 
2003
2003
The Complexity of the Extendibility Problem for Finite Posets
For a finite poset P let EXT(P) denote the following decision problem. Given a finite poset Q and a partial map f from Q to P… 
1993
1993
Database and display algorithms for interactive visualization of architectural models
This thesis describes a system for interactive walkthroughs of large, fully furnished architectural models. Realistic-looking… 
Highly Cited
1982
Highly Cited
1982
Monte Carlo computer simulation study of the hydrophobic effect. Potential of mean force for [(CH4)2]aq at 25 and 50 °C
A series of liquid-state computer simulations has been performed on the system [(CH4)2]aq at 25 °C as a function of the… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)