On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts
Authors:
- Piotr BermanPBPiotr Berman
- Marek KarpinskiMKMarek Karpinski
- Lawrence L. LarmoreLLLawrence L. Larmore
- Wojciech PlandowskiWPWojciech Plandowski
- Wojciech RytterWRWojciech Rytter
- 30 September 2002
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 65 (2) , 332-350
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Efficient two-dimensional compressed matching2003
- Optimal Two-Dimensional Compressed MatchingJournal of Algorithms, 1997
- On the complexity of pattern matching for highly compressed two-dimensional texts1997
- Let Sleeping Files Lie: Pattern Matching in Z-Compressed FilesJournal of Computer and System Sciences, 1996
- Efficient algorithms for Lempel-Ziv encoding1996
- String matching in Lempel-Ziv compressed strings1995
- Pattern-matching for strings with short descriptionsLecture Notes in Computer Science, 1995
- Testing equivalence of morphisms on context-free languages1994
- Probabilistic Algorithms for Deciding Equivalence of Straight-Line ProgramsJournal of the ACM, 1983
- On the Complexity of Finite SequencesIEEE Transactions on Information Theory, 1976