会议专题

Comparison of two-dimensional string matching algorithms

String matching is a special kind of pattern recognition problem, which finds all occurrences of a given pattern string in a given text string. The technology of two-dimensional string matching is applied broadly in many information processing domains. A good two-dimensional string matching algorithm can effectively enhance the searching speed. In this paper, the KMP algorithm, Rabin-Karp algorithm and their combinatorial are presented and compared, by a number of tests at diverse data scales, to validate the efficiency of these three algorithms.

string matching KMP algorithm Rabin-Karp algorithm

Chengguo Chang Hui Wang

Department of Information Engineering, North China University of Water Resources and Electric Power Zhengzhou, China

国际会议

2012 International Conference on Computer Science and Electronic Engineering(2012 IEEE计算机科学与电子工程国际会议 ICCSEE 2012)

杭州

英文

608-611

2012-03-23(万方平台首次上网日期,不代表论文的发表时间)