(redirected from Knuth-Morris-Pratt)
KMPKnowledge Management Platform
KMPK-Multimedia Player (Microsoft)
KMPKill Me Please
KMPKilusang Magbubukid ng Pilipinas (political group in the Philippines)
KMPKnuth-Morris-Pratt (string matching algorithm)
KMPKeep Me Posted
KMPKernel Module Package (computing)
KMPKey Management Personnel
KMPKey Management Protocol
KMPKroger Market Place (Gallatin, TN)
KMPKey Management Plan
KMPKey Measurement Point
KMPKhulna Metropolitan Police (Bangladesh)
KMPKey Milestone Plans
KMPKorean Massage Parlor
References in periodicals archive ?
In 2005, hybrid algorithm have been proposed by considering the advantage of best case or average case time of Sunday algorithm; Hybrid of Sunday algorithm and Knuth-Morris-Pratt algorithm and known as FJS algorithm [19].
4 Hybrid pattern-matching algorithm based on Boyer-Moore and Knuth-Morris-Pratt algorithm
In 2012, again the fast multithreaded implementation of hybrid string matching algorithm hybrid of Boyer-Moore and Knuth-Morris-Pratt has been proposed.
For string matching, empirical results show that the new algorithm compares favorably with the Knuth-Morris-Pratt (KMP) algorithm [24] for any pattern length and the Boyer-Moore (BM) algorithm [12] for short patterns (up to length 6).
Our algorithm is based on finite automata theory, as in the Knuth-Morris-Pratt algorithm [24], and also exploits the finiteness of the alphabet, as in the Boyer-Moore algorithm [12].
The algorithms implemented are Boyer-Moore, as suggested by Horspool [19] (BMH), which according to Baeza-Yates [3], is the fastest practical version of this algorithm; Knuth-Morris-Pratt, as suggested by their authors [24], and our new algorithm (SO) using the KMP idea (first scan for the first character of the pattern.
Two of the most notable algorithms, published over a decade ago, are the Knuth-Morris-Pratt (KMP) [3] and the Boyer-Moore (BM) [1] algorithms.
Additional Key Words and Phrases: Boyer-Moore, Knuth-Morris-Pratt, pattern, search, substring