TY - JOUR
T1 - A fully compressed pattern matching algorithm for simple collage systems
AU - Inenaga, Shunsuke
AU - Shinohara, Ayumi
AU - Takeda, Masayuki
N1 - Funding Information:
*Main part of this research was done when the author was visiting the Department of Computer Science, the University of Helsinki, Finland. tSupported by JSPS Research Fellowships for Young Scientists *Main part of this research was done when the author was working for the Department of Informatics, Kyushu University, Japan, and PRESTO, Japan Science and Technology Agency (JST).
PY - 2005/12
Y1 - 2005/12
N2 - We study the fully compressed pattern matching problem (FCPM problem): Given T and P which are descriptions of text T and pattern P respectively, find the occurrences of P in T without decompressing T or P. This problem is rather challenging since patterns are also given in a compressed form. In this paper we present an FCPM algorithm for simple collage systems. Collage systems are a general framework representing various kinds of dictionary-based compressions in a uniform way, and simple collage systems are a subclass that includes LZW and LZ78 compressions. Collage systems are of the form (〈D, S〉, where D is a dictionary and S is a sequence of variables from D. Our FCPM algorithm performs in O(∥D∥ 2 + mn log|S|) time, where n = |T| = ∥D∥ + |S| and m = |P|. This is faster than the previous best result of O(m 2n 2) time.
AB - We study the fully compressed pattern matching problem (FCPM problem): Given T and P which are descriptions of text T and pattern P respectively, find the occurrences of P in T without decompressing T or P. This problem is rather challenging since patterns are also given in a compressed form. In this paper we present an FCPM algorithm for simple collage systems. Collage systems are a general framework representing various kinds of dictionary-based compressions in a uniform way, and simple collage systems are a subclass that includes LZW and LZ78 compressions. Collage systems are of the form (〈D, S〉, where D is a dictionary and S is a sequence of variables from D. Our FCPM algorithm performs in O(∥D∥ 2 + mn log|S|) time, where n = |T| = ∥D∥ + |S| and m = |P|. This is faster than the previous best result of O(m 2n 2) time.
UR - http://www.scopus.com/inward/record.url?scp=33746228626&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33746228626&partnerID=8YFLogxK
U2 - 10.1142/S0129054105003728
DO - 10.1142/S0129054105003728
M3 - Article
AN - SCOPUS:33746228626
VL - 16
SP - 1155
EP - 1166
JO - International Journal of Foundations of Computer Science
JF - International Journal of Foundations of Computer Science
SN - 0129-0541
IS - 6
ER -