An Approach to Parallel String Matching Allowing Errors

This paper presents an approach to parallel string matching allowing errors. By using searching state vector and char-pattern matching vector, this approach transforms comparisons for string matching into simple integer bit operations and, by searching string from the two ends to the middle, it implements efficiently the parallel approximate string searching on multiprocessors. The parallel implementation algorithm and tile analysis of the algorithm are also provided.