[工学]程序设计与算法基础8.pptVIP

  1. 1、本文档共60页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  5. 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  6. 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  7. 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  8. 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
[工学]程序设计与算法基础8

程序设计与算法基础(8) 潘爱民 2006/11/13 Outline String matching Heap management For midterm exam String matching Problem: finding all occurrences of a pattern in a text A common task: Used in daily text-editing programs Used in various text-based filters, such as network traffic filters Other applications, such as to search for particular patterns in DNA sequences A formal definition String-matching problem Assume the text is an array T[1..n] of length n, and the pattern is an array P[1..m] of length m (n) Also assume the elements of P and T are characters drawn from a finite alphabet ?. (The character arrays P and T are often called strings) We say that P occurs with shift s in text T (or that pattern P occurs beginning at position s+1 in text T) if 0 ? s ? n - m and T[s+1..s+m]=P[1..m] If P occurs with shift s in T, then we call s a valid shift, otherwise, we call s an invalid shift The definition: the problem of finding all valid shifts with which a given pattern P occurs in a given text T The problem and some algorithms Some notations Notations ?*: the set of all finite-length strings formed using characters from the alphabet ? ?: the zero-length empty string, ???* |x|: the length of a string x xy: the concatenation of two strings x and y, its length is |x|+|y| w ?x, string w is a prefix of x, if x=wy for some y??* w ?x, string w is a suffix of x, if x=yw for some y??* ? and ? are transitive relations Pk: the k-character prefix P[1..k] of the string P[1..m], P0=? Some lemmas w ?x or w ?x = |w| ? |x| For any strings x and y and any character a, we have x ? y if and only if xa ? ya Overlapping-suffix lemma: Suppose that x, y, and z are strings such that x ? z or y ? z. If |x| ?|y|, then x ? y; if |x| ?|y|, then y ? x; if |x| = |y|, then x =y Navie string-matching algorithm The problem is finding all shifts s in the range 0 ? s ? n-m such that P ? Ts+m Find all valid shifts using a loop that checks the condition P[1..m] = T[s+1..s+m] for each of the n-m+1 possible values of s

文档评论(0)

jiupshaieuk12 + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

版权声明书
用户编号:6212135231000003

1亿VIP精品文档

相关文档