Efficient Parallel Pattern Matching Using Partition Method
S. Viswanadha Raju, S.R. Mantena, A. Babu, G.V.S. Raju · 2006
In this paper we consider the problem of exact string matching algorithm based on a two-dimensional array. This has applications such as string databases, cellular automata and computational biology. The main use of this method is to reduce the time spent on comparisons in string matching by finding common characters in pattern string which achieves a constant time O(1) for pattern string in a text string . This reduces many calls across backend interface