Location:
Search - 多关键字字符串匹配算法
Search list
Description: 多关键字字符串匹配算法 AC算法 WM算法
Platform: |
Size: 4132 |
Author: tjltail |
Hits:
Description: 在计算机科学里，Boyer-Moore字符串搜索算法是一种非常高效的字符串搜索算法。它由Bob Boyer和J Strother Moore设计于1977年。此算法仅对搜索目标字符串（关键字）进行预处理，而非被搜索的字符串。虽然Boyer-Moore算法的执行时间同样线性依赖于被搜索字符串的大小，但是通常仅为其它算法的一小部分：它不需要对被搜索的字符串中的字符进行逐一比较，而会跳过其中某些部分。通常搜索关键字越长，算法速度越快。它的效率来自于这样的事实：对于每一次失败的匹配尝试，算法都能够使用这些信息来排除尽可能多的无法匹配的位置。(In computer science, Boyer-Moore string search algorithm is a very efficient string searching algorithm. It consists of Bob Boyer and J Strother Moore design in 1977. This algorithm only to search the target string (keywords) pretreatment, instead of a string to be searched. Although the execution time of Boyer-Moore algorithm also depends linearly on the size of the string being searched, but usually only a small part of other algorithms: it does not need to be searched in the character string for each comparison and will skip some. Usually the search key is longer, the faster algorithm. Its efficiency comes from the fact that the algorithm can use as much information as possible to exclude as many non matching positions as possible for each failed matching attempt.)
Platform: |
Size: 1024 |
Author: Never give up
|
Hits: