Word Size Removal (WSR) method for Bit Parallel String Matching

Bit Parallel String Matching algorithms are the most efficient and latest class of String Matching Algorithms. These algorithms use the intrinsic property of computer known as Bit Parallelism for performing bit operations in parallel with-in single computer word. BNDM, TNDM, BNDMq are the popular si...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2015 IEEE International Advance Computing Conference (IACC) s. 309 - 314
Hlavní autori: Soni, Kapil Kumar, Sharma, Vivek
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.06.2015
Predmet:
Algorithm design and analysis
Approximation algorithms
Automata
Bit Parallelism
BNDM
BNDMq
Computers
Conferences
Indexes
Pattern matching
Shift-OR
Shift-OR with Q-grams
TNDM
WSR Method
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Bit Parallel String Matching algorithms are the most efficient and latest class of String Matching Algorithms. These algorithms use the intrinsic property of computer known as Bit Parallelism for performing bit operations in parallel with-in single computer word. BNDM, TNDM, BNDMq are the popular single pattern bit parallel string matching algorithms whereas Shift-OR and Shift-OR with Q-grams algorithms are popular in multiple pattern string matching. All these algorithms are restricted by the limitation of pattern size. These all algorithms are not working on patterns whose sizes are longer than computer word. In this paper, we proposed the generic method named WSR (Word Size Removal) for bit parallel string matching. With the inclusion of WSR these bit parallel string matching algorithms can work on longer than computer word size patterns. This paper presented WSR method and all modified algorithms.
DOI:10.1109/IADCC.2015.7154720