求任意两个字符串的最大匹配子串及其长度的算法设计

the Algorithm Design on Maximum String Matching of Two Random Strings and the String Length

串匹配问题是计算机科学中研究得最广泛的问题之一,它在文字编辑与处理、图象处理、文献检索、自然语言识别、生物学等领域都有很广泛的应用。随着互联网的日渐庞大,信息也是越来越多,如何在海量的信息中快速查找自己所要的信息是网络搜索研究的热点所在,在这其中,字符串匹配算法起着非常重要的作用,一个好的串匹配算法往往能显著地提高应用的效率。文章所研究的是如何设计求任意两个字符串的最大匹配子串及其长度的算法,这种串匹配算法可应用到自动阅卷系统、查询系统、检索系统等许多系统中。

The string matching, one of the hot topics in the computer science studies, has been widely applied in the cross-areas and cross-fields, such as word processing, image processing, database retrieval, natural language identification and the biological studies and so forth. With the ongoing development in the networks, its role is much more crucial to the information technology in terms of information retrieval. A well-designed algorithm program on string matching is the facilitator to the efficiency of the matching process, The light of the present paper is shed on the algorithm design in terms of getting the maximum string matching and the string length of the random strings, which can be applied into the automatic examination checking , system checking and database and catalogue retrieving and other related systems.