Research on a faster algorithm for pattern matching

Authors:
Han Kesong;Wang Yongcheng;Chen Guilin
Affiliations:
Shanghai Jiaotong University, Department of Computer Science, Shanghai, P.R. China;Shanghai Jiaotong University, Department of Computer Science, Shanghai, P.R. China;Shanghai Jiaotong University, Department of Computer Science, Shanghai, P.R. China
Venue:
IRAL '00 Proceedings of the fifth international workshop on on Information retrieval with Asian languages
Year:
2000

Citing 13
Cited 1

The Boyer Moore Galil string searching strategies revisited

SIAM Journal on Computing
A very fast substring search algorithm

Communications of the ACM
A new approach to text searching

Communications of the ACM
A variation on the Boyer-Moore algorithm

Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
A string pattern-matching algorithm

Journal of Systems and Software
Fastest pattern matching in strings

Journal of Algorithms
Tight Bounds on the Complexity of the Boyer--Moore String Matching Algorithm

SIAM Journal on Computing
Experimental results on string matching algorithms

Software—Practice & Experience
Tight bounds on the complexity of the Apostolico-Giancarlo algorithm

Information Processing Letters
On the comparison complexity of the string prefix-matching problem

Journal of Algorithms
A fast string searching algorithm

Communications of the ACM
Efficient string matching: an aid to bibliographic search

Communications of the ACM
An Efficient Algorithm for Matching Multiple Patterns

IEEE Transactions on Knowledge and Data Engineering

Improving Boyer-Moore-Horspool using machine-words for comparison

Proceedings of the 48th Annual Southeast Regional Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Based on deep analysis of Boyer-Moore algorithm and Quick Search algorithm, we propose a faster algorithm for single pattern matching by utilizing the continuous skip over the text, this idea enables its high performance because of the large shift on the text, its best time complexity is O(n/(m+1)), which is an inspiring research result. We also discuss the average time complexity of this suggested algorithm, which demonstrates and proves its high efficiency. Our experimental result shows that the algorithm is superior to other algorithms for pattern matching, such as Boyer-Moore algorithm, Quick Search algorithm, Shift Or algorithm, Reverse Factor algorithm, Reverse Colussi algorithm, Improved Apostolico-Giancarlo algorithm and so on. Especially, when the pattern is smaller, our algorithm is more efficient than other algorithms, which is very practical in natural language text retrieval.