| 最长公共子串的快速搜索算法 |
| |
| 引用本文： | 左恩栋,胡庆.最长公共子串的快速搜索算法[J].南京理工大学学报(自然科学版),1988(1). |
| |
| 作者姓名： | 左恩栋 胡庆 |
| |
| 作者单位： | 华东工学院603教研室
(左恩栋)，华东工学院603教研室(胡庆) |
| |
| 摘 要： | 本文提出了两个字符串之间最长公共子串这一概念,并在对它进行理论分析的基础上,给出了两种求取最长公共子串的快速算法。
|
| 关 键 词： | 算法 搜索 最长公共子吕匹配 复杂性 算法 分析 |
The Quick Algorithms of Searching the Longest Common Substring |
| |
| Zuo Endong,Hu Qing.The Quick Algorithms of Searching the Longest Common Substring[J].Journal of Nanjing University of Science and Technology(Nature Science),1988(1). |
| |
| Authors: | Zuo Endong Hu Qing |
| |
| Institution: | Zuo Endong;Hu Qing |
| |
| Abstract: | In this paper we introduced the Concept of thelongest common Substring of two Character strings, and presented twoquick algorithms of searching the Lengest common Substring on thebasis of the theoretical anlysis of this cencept. |
| |
| Keywords: | Algorithm Searching Longest common substring Matching Complexity Algorithm Analysis |
| 本文献已被 CNKI 等数据库收录！ |
