Title :
Pattern matching in text compressed with the ID heuristic
Author :
Barcaccia, Piera ; Cresti, Antonella ; De Agostino, Sergio
Author_Institution :
Dipt. di Sci. dell´´Inf., Rome Univ., Italy
fDate :
30 Mar-1 Apr 1998
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
Keywords :
computational complexity; data compression; pattern matching; word processing; ID heuristic; compressed text size; identity compression; maximum target length; pattern length; pattern matching; space algorithm; text compression; Pattern matching;
Conference_Titel :
Data Compression Conference, 1998. DCC '98. Proceedings
Conference_Location :
Snowbird, UT
Print_ISBN :
0-8186-8406-2
DOI :
10.1109/DCC.1998.672137
