使用ID启发式压缩文本中的模式匹配

Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225) Pub Date : 1998-03-30 DOI:10.1109/DCC.1998.672137

Piera Barcaccia, A. Cresti, S. Agostino

{"title":"使用ID启发式压缩文本中的模式匹配","authors":"Piera Barcaccia, A. Cresti, S. Agostino","doi":"10.1109/DCC.1998.672137","DOIUrl":null,"url":null,"abstract":"We show an O(m+t) space algorithm to find all the occurrences of a pattern in a text compressed with the ID heuristic that runs in time O(n(m+t)), where m is the pattern length, n is the size of the compressed text and 1 is the maximum target length.","PeriodicalId":191890,"journal":{"name":"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Pattern matching in text compressed with the ID heuristic\",\"authors\":\"Piera Barcaccia, A. Cresti, S. Agostino\",\"doi\":\"10.1109/DCC.1998.672137\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We show an O(m+t) space algorithm to find all the occurrences of a pattern in a text compressed with the ID heuristic that runs in time O(n(m+t)), where m is the pattern length, n is the size of the compressed text and 1 is the maximum target length.\",\"PeriodicalId\":191890,\"journal\":{\"name\":\"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)\",\"volume\":\"83 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-03-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCC.1998.672137\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.1998.672137","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 11

摘要

我们展示了一个O(m+t)空间算法，该算法使用运行时间为O(n(m+t))的ID启发式算法在压缩文本中查找模式的所有出现情况，其中m是模式长度，n是压缩文本的大小，1是最大目标长度。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Pattern matching in text compressed with the ID heuristic

We show an O(m+t) space algorithm to find all the occurrences of a pattern in a text compressed with the ID heuristic that runs in time O(n(m+t)), where m is the pattern length, n is the size of the compressed text and 1 is the maximum target length.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)

自引率

0.00%

发文量