Login / Signup
On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts.
Piotr Berman
Marek Karpinski
Lawrence L. Larmore
Wojciech Plandowski
Wojciech Rytter
Published in:
J. Comput. Syst. Sci. (2002)
Keyphrases
</>
pattern matching
highly compressed
pattern matching algorithm
regular expressions
tree matching
three dimensional
string matching
natural language
boyer moore
computational complexity
matching process
matching strategy
image processing
keywords
single image
suffix tree