Sciweavers

SPIRE
2000
Springer

Fully Compressed Pattern Matching Algorithm for Balanced Straight-Line Programs

14 years 3 months ago
Fully Compressed Pattern Matching Algorithm for Balanced Straight-Line Programs
We consider a fully compressed pattern matching problem, where both text T and pattern P are given by its succinct representation, in terms of straight-line programs and its variant. The length of the text T and pattern P may grow exponentially with respect to its description size n and m, respectively. The best known algorithm for the problem runs in O(n2 m2 ) time using O(nm) space. In this paper, we introduce a variant of straight-line programs, called balanced straight-line programs so that we establish a faster fully compressed pattern matching algorithm. Although the compression ratio of balanced straight-line programs may be worse than the original straight-line programs, they can still express exponentially long strings. Our algorithm runs in O(nm) time using O(nm) space.
Masahiro Hirao, Ayumi Shinohara, Masayuki Takeda,
Added 25 Aug 2010
Updated 25 Aug 2010
Type Conference
Year 2000
Where SPIRE
Authors Masahiro Hirao, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
Comments (0)