专利名称：Character string pattern matching for
compression and the like using minimal
cycles per character
发明人：Cheng, Joe-Ming,Cheng, Yancy
申请号：EP95302343.9
申请日：19950407
公开号：EP0677927A2
公开日：
19951018
专利内容由知识产权出版社提供
字段字符串去重复
专利附图：
摘要：The present invention provides a method and apparatus for ascertaining
maximal length pattern matches of K characters per cycle between character strings in a
reduced amount of time using a pipeline like concurrent dataflow model in which a recursive exhaustive greedy comparison matching between the strings in a consistent direction yields a parsing of the longest matches, the recursion being constrained by relations among K, the match length L, and a tracking variable J, said constraints governing further recursions ascertaining prefix extensions from one string to another and any intra-string pattern matches. Embodiments processing K equal to one, two, or three characters at a time are disclosed.
申请人：International Business Machines Corporation
地址：Old Orchard Road Armonk, N.Y. 10504 US
国籍：US
代理机构：Horner, David Richard
更多信息请下载全文后查看

版权声明：本站内容均来自互联网，仅供演示用，请勿用于商业和其他非法用途。如果侵犯了您的权益请与我们联系QQ:729038198，我们将在24小时内删除。