Sciweavers

Share
DLT
2004

An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars

9 years 1 months ago
An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars
There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced. Given an input string, a grammar-based text compression algorithm constructs a context-free grammar that only generates the string. An interesting and challenging problem is pattern matching on context-free grammars P of size m and T of size n, which are the descriptions of pattern string P of length M and text string T of length N, respectively. The goal is to solve the problem in time proportional only to m and n, not to M nor N. Kieffer et al. introduced a very practical grammar-based compression method called multilevel pattern matching code (MPM code). In this paper, we propose an efficient pattern matching algorithm which, given two MPM grammars P and T , performs in O(mn2 ) time with O(mn) space. Our algorithm outperforms the previous best one by Miyazaki et al. which requires O(m2 n2 ) time and O(mn...
Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2004
Where DLT
Authors Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
Comments (0)
books