On the complexity of pattern matching for highly compressed Two-Dimensional texts

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1264, Issue , 1997, Pages 40-51

  Berman, Piotr ^a   Karpinski, Marek ^b   Larmore, Lawrence L ^c   Plandowski, Wojclech ^d   Rytter, Wojciech ^d,e  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF BONN   (Germany)

^c University of Nevada Las Vegas   (United States)

^d UNIVERSITY OF WARSAW   (Poland)

^e UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE GRAMMARS; FORMAL LANGUAGES; POLYNOMIAL APPROXIMATION;

COMPRESSED PATTERN MATCHING; CONTEXT-FREE GRAPH GRAMMARS; HIERARCHICAL DESCRIPTION; HIERARCHICAL GRAPHS; PATTERN-MATCHING ALGORITHM; POLYNOMIAL TIME DETERMINISTIC ALGORITHM; STRAIGHT LINE PROGRAM; TWO-DIMENSIONAL TEXTS;

PATTERN MATCHING;

EID: 84948995379     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63220-4_48     Document Type: Conference Paper

References (18)

1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The design and analysis of computer algorithms, Addison-Wesleyj Reading, Mass., 1974.
2. A. Amir, G. Benson and M. Farach, Let sleeping files lie: pattern-matching in Z-compressed files, in SODA '94.
3. A. Amir, G. Benson, Efficient two dimensional compressed matching, Proc. of the 2nd IEEE Data Compression Conference 279-288 (1992).
4. A. Amir, G. Benson and M. Farach, Optimal two-dimensional compressed matching, in ICALP'94 pp.215-225.
5. M. Crochemore and W. Rytter, Text Algorithms, Oxford University Press, New York (1994).
6. M. Farach and M. Thorup, String matching in Lempel-Ziv compressed strings, in STOC'95, pp. 703-712.
7. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman (1979).
8. L. Ggsieniec, M. Karpifiski, W. Plandowski and W. Rytter, Efficient Algorithms for Compressed Strings. in proceedings of the SWAT'96 (1996).
9. M. Karpinski, W. Rytter and A. Shinohara, Pattern-matching for strings with short description, in Combinatorial Pattern Matching, 1995.
10. D. Knuth, The Art of Computing, Vol. 11: Seminumerical Algorithms. Second edition. Addison-Wesley, 1981.
11. A. Lempel and J. Ziv, On the complexity of finite sequences, IEEE Trans. on Inf. Theory 22, 75-81 (1976).
12. A. Lempel and J. Ziv, Compression of two-dimensional images sequences, Combinatorial algorithms on words (ed. A. Apostolico, Z.Galil) Springer Verlag (1985) 141-156.
13. R. Motwani, P. Raghavan, Randomized algorithms, Cambridge University Press 1995.
14. Papadimitriou, Ch. H., Computational complexity, Addison Wesley, Reading, Massachusetts, 1994.
15. W. Plandowski, Testing equivalence of morphisms on context-free languages, ESA'94, Lecture Notes in Computer Science 855, Springer-Verlag, 460-470 (1994).
16. J. Storer, Data compression: methods and theory, Computer Science Press, Rockville, Maryland, 1988.
17. R.E. Zippel, Probabilistic algorithms for sparse polynomials, in EUROSAM 79, Lecture Notes in Comp. Science 72, 216-226 (1979).
18. J. Ziv and A. Lempel, A universal algorithm for sequential data compression, IEEE Trans. on Inf. Theory vo. IT-23(3), 337-343, 1977.