DocumentCode :
3395690
Title :
An improved algorithm of multiple pattern matching
Author :
Yunan Liu ; Yongwei Wang ; Li Bian ; Wenchong Xie
Author_Institution :
Henan Key Lab. of Inf. Security, Zhengzhou Inf. Sci. & Technol. Inst., Zhengzhou, China
fYear :
2011
fDate :
19-22 Aug. 2011
Firstpage :
1653
Lastpage :
1656
Abstract :
Combined with the advantages of the BM algorithm, an improved, faster algorithm of multiple pattern matching is put forward based on the AQR algorithm. The proposed algorithm skips as many characters as possible by making full use of position information of the last failed matching to achieve a higher performance. The experiments and analysis show that the proposed algorithm has a better performance than the AQR algorithm, especially when characters occur repeatedly in the target text but its occurrence probability in pattern strings is small.
Keywords :
string matching; AQR algorithm; BM algorithm; pattern matching; pattern strings; Algorithm design and analysis; Approximation algorithms; Automatic repeat request; Complexity theory; Computers; Pattern matching; Probability; ARQ algorithm; BM algorithm; multiple pattern matching; time complexity;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Mechatronic Science, Electric Engineering and Computer (MEC), 2011 International Conference on
Conference_Location :
Jilin
Print_ISBN :
978-1-61284-719-1
Type :
conf
DOI :
10.1109/MEC.2011.6025796
Filename :
6025796
Link To Document :
بازگشت