• 回答数

    4

  • 浏览数

    148

NightWish431
首页 > 职称论文 > kmp算法毕业论文

4个回答 默认排序
  • 默认排序
  • 按时间排序

招财KItty.

已采纳

living In a developing world,people has to deal with exponentially growing information ,it has became a hot-topic since the continuously quicken living pace has been asking for the accurate and fast information resource positioning 。Our approach was designed based on the actual demand including the functionalities of text accounting,positioning and searching。this Graduation project was emphasising on the comparation between the general string searching algorithm and the KMP algorithm ,so to find the more efficient way of such functionalities。This article firstly introduced the background of the issue ,and then moved on to the comparation of the two approaches to finally find which was better,then we analysis the system designing methods ,immediately,we make the detailed analysis and design on the components’module and we described the the running process by combining the source code during the implementation phase ;At last we draw the test conclusion by testing the whole system。

350 评论

后果你在哪儿

你好,我还是个学翻译的学生,希望我的献丑能帮到你。 Along with the development of the society,the information amount in our daily life is becoming more and more,and the living pace faster and faster. How to find the resource we want in the information sea instantly and accurately has already been a hot subject. This system is devised according to the practical demand, it includes functions of the counting,locating and indexing the script. The graduation design focuse on the method of Character String Searching.,which is in regular use,and the method of KMP, so as to select the KMP method,which is more efficient,to realize the function of finding,counting and locating the character string. This aricle fistly introduces the background of the issue,and then compares the KMP method adopted by this system with the ordinary method of Character String Searching,thus presenting the advantages of the former method. It also analyses the desiging approach of the system,analyses and designs some certain parts in detail. In the process of designing and realizing, after combining the operation process of the source-code despriction system and testing the whole system,it sums the testing conclusion.

318 评论

苏州许一

With the development of society, ever the amount of people's lives, increasingly fast pace of life, in an ocean of information on how to find the resources you need quickly and accurately, have become a hot system according to the actual needs of the design, including count, location, text information retrieval function. Graduation design focuses on the more popular string search algorithm with the KMP algorithm and choice of KMP algorithm more efficient realization of find, count and position of the string first describes has problem of background, then on this system used of KMP algorithm and General of string find algorithm for has comparison, to came advantages, and on system of design method for analysis, followed by on part module for has more of analysis and design, in design and implementation process in the, combination source code description system of run process; last on entire system for test came test conclusions.

147 评论

辉帅LED照明

KMP算法是可以被进一步优化的。我们以一个例子来说明。譬如我们给的P字符串是“abcdaabcab”,经过KMP算法,应当得到“特征向量”如下表所示: 下标i 0 1 2 3 4 5 6 7 8 9 p(i) a b c d a a b c a b next[i] -1 0 0 0 0 1 1 2 3 1 但是,如果此时发现p(i) == p(k),那么应当将相应的next[i]的值更改为next[k]的值。经过优化后可以得到下面的表格: 下标i 0 1 2 3 4 5 6 7 8 9 p(i) a b c d a a b c a b next[i] -1 0 0 0 0 1 1 2 3 1 优化的next[i] -1 0 0 0 -1 1 0 0 3 0 (1)next[0]= -1 意义:任何串的第一个字符的模式值规定为-1。(2)next[j]= -1 意义:模式串T中下标为j的字符,如果与首字符相同,且j的前面的1—k个字符与开头的1—k个字符不等(或者相等但T[k]==T[j])(1≤kLength(t)thenindex:=i-Length(t);end;End;BEGINClrScr;{清屏,可不要}Write('s=');Readln(str_s);Write('t=');Readln(str_t);int_i:=index(str_s,str_t);ifint_i<>0thenbeginWriteln('Found''',str_t,'''in''',str_s,'''at',int_i,'.');endelseWriteln('Cannotfind''',str_t,'''in',str_s,'''.');函数用于模式匹配,t是模式串,s是原串。返回模式串的位置,找不到则返回0

220 评论

相关问答

  • 贪心算法毕业论文

    优化的分布式梯度提升算法,end-to-end 不需要特征抽取。输入原始数据,就能输出目标结果。 整篇论文技术实现分两个部分显而易见,xgboost是非线性

    大哈哈a呦呦 2人参与回答 2023-12-09
  • 计算机毕业设计算法毕业论文

    去看(计算机科学与应用)这样的论文~~~

    沐沐沐牧 3人参与回答 2023-12-06
  • 计算机专业算法分析毕业论文

    毕业论文一般都会先选题的,根据导师提供的可选题目选一个感兴趣的课题,然后就是根据所选的题目在百度学术或中国知网等一些学术网站上查阅一些近期的相关论文,通过对大量

    一粒砂的梦想 3人参与回答 2023-12-08
  • 本科毕业论文算法

    纯干货本科毕业论文,还在烦恼查重太高吗?学姐教你如何快速降重

    卷毛先生老杨 5人参与回答 2023-12-07
  • 毕业论文字数算法

    本科毕业论文正文要求至少8000字,只计算正文部分,不包含摘要、前言、致谢。 论文正文要求:专科毕业论文正文字数一般应在5000字以上,本科文学学士毕业论文通常

    新雨初晴水星 5人参与回答 2023-12-12