短模式的快速压缩串匹配
Fast Packed String Matching for Short Patterns
摘要：
在文本中搜索模式的所有出现是计算机科学中的一个基本问题，在许多其他领域，如自然语言处理，信息检索和计算生物学的应用。在过去的二十年里，一个总的趋势已经出现，试图利用字RAM模型的力量，以加快经典的字符串匹配算法的性能。在这个模型中，算法对长度为w的字进行运算，对字符块进行分组，对字进行算术和逻辑运算需要一个时间单位。在本文中，我们使用专门的字长压缩字符串匹配指令，基于英特尔流SIMD扩展（SSE）技术，设计非常快速的字符串匹配算法的情况下，短模式。从我们的实验结果证明，尽管他们的二次最坏情况下的时间复杂度，新提出的算法成为明显的赢家，平均短模式，在文献中已知的最有效的算法相比。
英文摘要：
Searching for all occurrences of a pattern in a text is a fundamental problem in computer science with applications in many other fields, like natural language processing, information retrieval and computational biology. In the last two decades a general trend has appeared trying to exploit the power of the word RAM model to speed-up the performances of classical string matching algorithms. In this model an algorithm operates on words of length w, grouping blocks of characters, and arithmetic and logic operations on the words take one unit of time. In this paper we use specialized word-size packed string matching instructions, based on the Intel streaming SIMD extensions (SSE) technology, to design very fast string matching algorithms in the case of short patterns. From our experimental results it turns out that, despite their quadratic worst case time complexity, the new presented algorithms become the clear winners on the average for short patterns, when compared against the most effective algorithms known in literature.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
