期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Fast algorithm on string cross pattern matching
1
作者 LiuGongshen LiJianhua LiShenghong 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2005年第1期179-186,共8页
Given a set U which is consisted of strings defined on alphabet Σ, string cross pattern matching is to find all the matches between every two strings in U. It is utilized in text processing like removing the duplicat... Given a set U which is consisted of strings defined on alphabet Σ, string cross pattern matching is to find all the matches between every two strings in U. It is utilized in text processing like removing the duplication of strings. This paper presents a fast string cross pattern matching algorithm based on extracting high frequency strings. Compared with existing algorithms including single-pattern algorithms and multi-pattern matching algorithms, this algorithm is featured by both low time complexity and low space complexity. Because Chinese alphabet is large and the average length of Chinese words is much short, this algorithm is more suitable to process the text written by Chinese, especially when the size of Σ is large and the number of strings is far more than the maximum length of strings of set U. 展开更多
关键词 pattern matching high frequency string string cross pattern matching.
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部