Description: 字符串的近似匹配，就是允许在匹配时有一定的误差，比如在字串“以前高手好久不见”中找“以前是高手”也能成功。-approximate string matching, the matching is to allow a degree of error, For example, in the string "before a master writer," to the "past masters" can be successful. Platform: |
Size: 4274 |
Author:caihaibin |
Hits:
Description: 字符串的近似匹配，就是允许在匹配时有一定的误差，比如在字串“以前高手好久不见”中找“以前是高手”也能成功。-approximate string matching, the matching is to allow a degree of error, For example, in the string "before a master writer," to the "past masters" can be successful. Platform: |
Size: 4096 |
Author:caihaibin |
Hits:
Description: 用动态规划算法思想求最小编辑距离，即近似字符串匹配问题-Thinking of using dynamic programming algorithm for the minimum edit distance, that is, approximate string matching problem Platform: |
Size: 1024 |
Author:Doreen |
Hits:
Description: 例如：
编译：mpicc app_match.c邻app_match
运行：可以使用命令mpirun - np的尺寸app_match mnk来运行该串匹配程序，其中大小是所使用的处理器个数，米表示文本串长度，氮为模式串长度，钾为允许误差长度。本实例中使用了尺寸为3个处理器，米= 7，n = 2时，k = 1时。
mpirun - np的3 app_match 7 2 1
运行结果：
在节点0的文字是
在节点0的模式是
共有2匹配在节点0
节点1上的文本为
在节点1的模式是
共有2匹配的节点1
节点2上的文字是天然抗氧化剂
在节点2的模式为
共有2匹配的节点2
说明：该运行实例中，令文本串长度为7，随机产生的文本串为asasbsb，分布在3个节点上 模式串长度为2，随机产生的模式串为为。最后，节点0,1和二上分别得到两个近似匹配位置。
-For example:
Compile: mpicc app_match.c o app_match
Run: You can use the command mpirun- np size app_match mnk to run the string matching procedure, which size is the number of processors used, the text string length in meters, the length of pattern of nitrogen and potassium to allow for error length. The examples used in the size of three processors, m = 7, n = 2 时, k = 1 时.
mpirun- np of 3 app_match 7 2 1
Run Results:
Node 0 in the text is
Node 0 in the model is
Total 2 match at the node 0
Node 1 on the text
Node 1 is in the mode
A total of 2 matching node 1
Node 2, the text is a natural antioxidant
Node 2 in the model
A total of 2 matching node 2
Description: The running instance, so that the text string of length 7, randomly generated text string to asasbsb, located in three nodes mode string length is 2, the model randomly generated string to the. Finally, the nodes 0,1 and 2, respectively, are two approximate matching position.
Platform: |
Size: 5120 |
Author:aaa |
Hits:
Description: 该运行实例中，令文本串长度为7，随机产生的文本串为asasbsb，分布在3个节点上；模式串长度为2，随机产生的模式串为as。最后，节点0、1和2上分别得到两个近似匹配位置-The running instance, so that the text string length is seven, randomly generated text string asasbsb distributed in the three nodes the pattern string of length 2, the randomly generated pattern string as. Finally, the nodes 0,1 and 2, respectively, the two approximate matching position Platform: |
Size: 3072 |
Author:张勇 |
Hits:
Description: SimString is an implementation of a simple and efficient algorithm
for approximate string matching. Please refer to the web site for
more information about this software.
This program is distributed under the modified BSD license.
Portions of this software are based on CDB++.
Platform: |
Size: 233472 |
Author:AMIMIMEK |
Hits:
Description: 中科大的教材文档，关于字符串匹配算法的详细描述和具体代码，主要介绍改进的KMP串匹配算法，采用散列技术的随机串匹配算法，基于过滤算法的近似串匹配算法，以及它们的MPI编程实现，结尾是C语言代码，都在同一份文件中。-USTC materials documentation on string matching algorithm detailed description and the specific code, introduces improved KMP string matching algorithm, using hashing random string matching algorithm, based on filtering algorithms approximate string matching algorithms and their MPI programming implementation, ending with C language code, all in the same document. Platform: |
Size: 48128 |
Author:soulighter |
Hits:
Search - approximate string matching