|International Journal of Computer Applications
|Foundation of Computer Science (FCS), NY, USA
|Volume 74 - Number 19
|Year of Publication: 2013
|Authors: Syed Danish Ali, Zuber Farooqui
Syed Danish Ali, Zuber Farooqui . Approximate Multiple Pattern String Matching using Bit Parallelism: A Review. International Journal of Computer Applications. 74, 19 ( July 2013), 47-51. DOI=10.5120/13006-0312
String matching is to find all the occurrences of a given pattern in a large text both being sequence of characters drawn from finite alphabet set. Approximate String Matching involves the detection of correct patterns along with the detection of some wrong patterns inside the text. Bit Parallelism is a feature that can be used to detect patterns inside the text and is reported to result in more efficient approximate string matching. Bit parallelism enhances the processing speed of the approximate string matching algorithm as it takes the benefit of the internal bit operations taking place in parallel inside the system. The bit parallel method has also been compared with the traditional Aho Corasick Algorithms which consumes more time and memory. In general bit parallel are both memory and time efficient.