On the complexity of pattern matching for highly compressed two-dimensional texts

Journal of Computer and System Sciences

Volumn 65, Issue 2, 2002, Pages 332-350

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

^a The 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

ASYNCHRONOUS MACHINERY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; COMPUTER SIMULATION; CONTEXT FREE GRAMMARS; MATHEMATICAL MODELS; QUERY LANGUAGES;

2D GRAMMAR; COMMUNICATION OF LANGUAGES; HIERARCHICAL DESCRIPTION; TWO-DIMENSIONAL TEXTS;

PATTERN MATCHING;

EID: 23844456617     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1006/jcss.2002.1852     Document Type: Article

References (21)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, "The Design and Analysis of Computer Algorithms," Addison-Wesley, Reading, MA, 1974.
2. A. Amir, G. Benson, and M. Farach, Let sleeping files lie: Pattern-matching in Z-compressed files, J. Comput. System Sci. 52(2) (1996), 299-307.
3. A. Amir and G. Benson, Efficient two dimensional compressed matching, in "Proceedings of the 2nd IEEE Data Compression Conference," Snowbird, Utah, pp. 279-288, 1992.
4. A. Amir, G. Benson, and M. Farach, Optimal two-dimensional compressed matching, J. Algorithms 24(2) (1997), 354-379.
5. P. Berman, M. Karpinski, L. L. Larmore, W. Plandowski, and W. W. Rytter, On the complexity of pattern matching for highly compressed two-dimensional texts, in "Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching (CPM'97)," (A. Apostolico and J. Hein Eds.), Aarhus, Denmark, June 30-July 2, 1997, Lecture Notes in Computer Science, Vol. 1264, pp. 40-51, Springer-Verlag, Berlin, 1997.
6. M. Crochemore and W. Rytter, "Text Algorithm," Oxford University Press, New York, 1994.
7. M. Farach and M. Thorup, String matching in Lempel-Ziv compressed strings' in "Proceedings of the 27th Annual Symposium on the Theory of Computing," pp. 703-712, 1995.
8. M. R. Garey and D. S. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness," Freeman, New York, 1979.
9. L. Gasieniec, M. Karpinski, W. Plandowski, and W. Rytter, Efficient algorithms for Lempel-Ziv encoding, in "Proceedings of the 5th Scandinavian Workshop on Algorithm Theory," Springer-Verlag, Berlin, 1996.
10. M. Karpinski, W. Rytter, and A. Shinohara, Pattern-matching for strings with short description, Nordic J. Comput. 4(2) (1997), 172-186.
11. D. Knuth, "The Art of Computing, Vol. II: Seminumerical Algorithms," 2nd ed., Addison-Wesley, Reading, MA, 1981.
12. A. Lempel and J. Ziv, On the complexity of finite sequences, IEEE Trans. Inform. Theory 22 (1976), 75-81.
13. A. Lempel and J. Ziv, Compression of two-dimensional images sequences, in "Combinatorial Algorithms on Words," (A. Apostolico and Z. Gali Eds.), Springer-Verlag, Berlin, pp. 141-156, 1985.
14. O. H. Ibarra and S. Moran, Probabilistic algorithms for deciding equivalence of straight-line programs, J. ACM 30 (1983), 217-228.
15. R. Motwani and P. Raghavan, "Randomized Algorithms," Cambridge Univ. Press, Cambridge, 1995.
16. Ch. H. Papadimitriou, "Computational Complexity," Addison-Wesley, Reading, MA, 1994.
17. W. Plandowski, Testing equivalence of morphisms on context-free languages, in "Proceedings of the 2nd Annual European Symposium on Algorithms (ESA'94)," Lecture Notes in Computer Science, Vol. 855, pp. 460-470, Springer-Verlag, Berlin, 1994.
18. J. Schwartz, Fast probabilistic algorithms for verification of polynomial identities, J. ACM 27 (1980), 701-717.
19. J. Storer, "Data Compression: Methods and Theory," Computer Science Press, Rockville, MD, 1988.
20. R. E. Zippel, Probabilistic algorithms for sparse polynomials, in "Proceedings of the International Symposium on Symbolic and Algebraic Manipulation (EUROSAM'79)," Lecture Notes in Computer Science, Vol. 72, pp. 216-226, Springer-Verlag, Berlin, 1979.
21. J. Ziv and A. Lempel, A Universal algorithm for sequential data compression, IEEE Trans. Inform. Theory IT-23 (1977), 337-343.