Provided by: Cornell University
Topic: Big Data
Date Added: Feb 2012
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 the authors 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.