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（万方平台首次上网日期，不代表论文的发表时间）