作者: Yaniv Shapira
DOI:
关键词: Longest repeated substring problem 、 Mathematics 、 String searching algorithm 、 FM-index 、 Hash function 、 Rolling hash 、 Longest common substring problem 、 Algorithm 、 Approximate string matching 、 Substring
摘要: An apparatus for and method of simultaneously searching an input character stream the presence multiple strings. The strings to be searched are determined a priori, processed stored in substring tables during configuration phase. divided into plurality two three substrings tables. A hash each is calculated table whose output index table. During searching, content filter generates attempts find matching string declared found if all making up have been received correct consecutive order.