On the complexity of pattern matching for highly compressed two-dimensional texts
Authors:
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 40-51
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Efficient algorithms for Lempel-Ziv encoding1996
- Randomized Algorithms1995
- String matching in Lempel-Ziv compressed strings1995
- Pattern-matching for strings with short descriptionsLecture Notes in Computer Science, 1995
- Optimal two-dimensional compressed matchingLecture Notes in Computer Science, 1994
- Testing equivalence of morphisms on context-free languages1994
- Compression of Two-Dimensional Images1985
- Probabilistic algorithms for sparse polynomials1979
- A universal algorithm for sequential data compressionIEEE Transactions on Information Theory, 1977
- On the Complexity of Finite SequencesIEEE Transactions on Information Theory, 1976