クヌース-モリス-プラット法
1. Knuth–Morris–Pratt algorithmIn computer science, the Knuth–Morris–Pratt string searching algorithm (or KMP algorithm) searches for occurrences of a "word" within a main "text string" by employing the observation that when a mismatch occurs, the word itself embodies sufficient information to determine where the next match could begin, thus bypassing re-examination of previously matched characters. The algorithm was conceived in 1974 by Donald Knuth and Vaughan Pratt, and independently by James H. Morris.
Read “Knuth–Morris–Pratt algorithm” on English Wikipedia
Read “クヌース-モリス-プラット法” on Japanese Wikipedia
Read “Knuth–Morris–Pratt algorithm” on DBpedia
Read “Knuth–Morris–Pratt algorithm” on English Wikipedia
Read “クヌース-モリス-プラット法” on Japanese Wikipedia
Read “Knuth–Morris–Pratt algorithm” on DBpedia
Discussions
Log in to talk about this word.