Description: 由于简单模式匹配算法在一次字符比较失败后，简单的把模式串位置向前移动一个字符位置，这样就丢掉了前面字符匹配中得到的信息，效率差。所以就需要一种无回溯的算法来提高效率，这里使用KMP（Knuth-Morris-Pratt）算法。模式串前面的连续片断部分称“前缀模式”，前缀模式在模式串后部重复出现的情况可以用来避免重复进行已经做过的检查，这是KMP算法中的一个重要概念。-as simple pattern-matching algorithm to compare a character failure, a simple model put forward position Series mobile location of a character, would be lost in front of characters matching the information inefficiently. There is a need for a non-backtracking algorithms to improve efficiency, the use of KMP here (Knuth-Morris-Pratt) algorithm. Model Series in front of a row clips part said "prefix model," prefix string pattern in the pattern of recurring back can be used to avoid duplication of inspection has been done, KMP algorithm is an important concept. Platform: |
Size: 3257 |
Author:卢孝飞 |
Hits:
Description: 由于简单模式匹配算法在一次字符比较失败后，简单的把模式串位置向前移动一个字符位置，这样就丢掉了前面字符匹配中得到的信息，效率差。所以就需要一种无回溯的算法来提高效率，这里使用KMP（Knuth-Morris-Pratt）算法。模式串前面的连续片断部分称“前缀模式”，前缀模式在模式串后部重复出现的情况可以用来避免重复进行已经做过的检查，这是KMP算法中的一个重要概念。-as simple pattern-matching algorithm to compare a character failure, a simple model put forward position Series mobile location of a character, would be lost in front of characters matching the information inefficiently. There is a need for a non-backtracking algorithms to improve efficiency, the use of KMP here (Knuth-Morris-Pratt) algorithm. Model Series in front of a row clips part said "prefix model," prefix string pattern in the pattern of recurring back can be used to avoid duplication of inspection has been done, KMP algorithm is an important concept. Platform: |
Size: 3072 |
Author:卢孝飞 |
Hits:
Description: pascal基本算法及优化(如数论问题\单纯背包问题等)-pascal the basic algorithm and optimization (for example on the issue of simple knapsack problem, etc.) Platform: |
Size: 7168 |
Author:诸宪军 |
Hits:
Description: 串的模式匹配的朴素算法是O(N^2)的, 可以
利用KMP(由D.E.Knuth, J.H.Morris, V.R.Pratt提出)算法改进至线性的算法. KMP算法与朴素算法的不同在于：处理"失配"情况. 不同于将指针完全回溯, KMP算法先根据已经部分匹配的信息, 将匹配的指针跳过不必匹配的位置.-Series of simple pattern matching algorithm is O (N ^ 2), and can make use of KMP (from DEKnuth, JHMorris, VRPratt made) algorithm to improve the algorithm to linear. KMP algorithm and simple algorithm is different: the " mismatch" situation. pointer completely different to back, KMP algorithm first part of the basis of information match, the pointer will skip the match do not have to match the position. Platform: |
Size: 1024 |
Author:左刘鸿翔 |
Hits:
Description: 介紹了knuth-morris-pratt方法與化簡了的boyer-morre方法，這兩個方法在尋找字串中是否有一個特定的字串時有相當傑出的表現-Introduced knuth-morris-pratt methods and simplification of the boyer-morre method, the two methods in the search string if the string has a specific time to time the performance of a very distinguished Platform: |
Size: 14336 |
Author:c2535103 |
Hits:
Description: KMP 算法是由Knuth，Morris和Pratt等人共同提出的，所以成为Knuth－Morris－Pratt算法，简称KMP算法。KMP算法是字符串模式匹配中的经典算法。和BF算法相比，KMP算法的不同点是匹配过程中，主串的位置指针不会回溯，这样的结果使得算法时间复杂度只为O（n＋m）。
采用VC++开发，实现KMP字符串匹配算法-KMP algorithm by Knuth, Morris and Pratt, who co-sponsored, so as Knuth-Morris-Pratt algorithm, called KMP algorithm. KMP algorithm is a classical string pattern matching algorithm. And the BF algorithm is compared, KMP algorithm is different from the matching process, the location of the main string pointer will not go back, this result makes the algorithm time complexity only O (n+ m). Using VC++ development, implementation KMP string matching algorithm Platform: |
Size: 610304 |
Author:宇烁 |
Hits:
Description: KMP 改进的字符串匹配算法,由D.E.Knuth与V.R.Pratt和J.H.Morris同时发现，因此人们称它为克努特——莫里斯——普拉特操作（简称KMP算法）。KMP算法的关键是根据给定的模式串W1,m,定义一个next函数。next函数包含了模式串本身局部匹配的信息。-Improved KMP string matching algorithm, by DEKnuth with VRPratt and JHMorris also found, so people call it Knuth- Morris- Pratt operations (referred to as the KMP algorithm). KMP algorithm, the key is given of a pattern W1, m, define a next function. next function mode of the string itself contains a partial matching. Platform: |
Size: 1024 |
Author:chaolan |
Hits:
Description: 模式匹配，kmp算法,kmp算法是一种改进的字符串匹配算法，由D.E.Knuth与V.R.Pratt和J.H.Morris同时发现，因此人们称它为克努特——莫里斯——普拉特操作（简称KMP算法）。KMP算法的关键是根据给定的模式串W1,m,定义一个next函数。next函数包含了模式串本身局部匹配的信息。-Pattern matching, kmp algorithm, kmp algorithm is an improved string matching algorithm, by DEKnuth with VRPratt and JHMorris also found, so people call it Knuth- Morris- Pratt operation (referred to KMP algorithm) . KMP algorithm, the key is according to a given pattern string W1, m, define a next function. next function contains localized pattern string matches the information itself. Platform: |
Size: 903168 |
Author:王二 |
Hits:
Description: 字符串匹配是计算机的基本任务之一。
举例来说，有一个字符串”BBC ABCDAB ABCDABCDABDE”，我想知道，里面是否包含另一个字符串”ABCDABD”？
许多算法可以完成这个任务，Knuth-Morris-Pratt算法（简称KMP）是最常用的之一。-String matching is one of the basic tasks of the computer.
For instance, there is a string "BBC ABCDAB ABCDABCDABDE", I want to know, which contains another string "ABCDABD"?
Many algorithms can complete this task, Knuth-Morris-Pratt algorithm (referred KMP) is the most common one. Platform: |
Size: 70656 |
Author:林华 |
Hits:
Search - knuth-morris-pratt