Abstract
Recent proliferation of digitized data and the expected unprecedented growth in the volume of stored and transmitted data motivated the definition of the compressed matching paradigm. This is the problem of efficiently finding a pattern P in a compressed text T without the need to decompress.
We present the first optimal two-dimensional compressed matching algorithm. The compression under consideration is the two dimensional run-length compression, used by FAX transmission.
We achieve optimal time by proving new properties of two-dimensional periodicity. This enables performing duels in which no witness is required. At the heart of the dueling idea lies the concept that two overlapping occurrences of a pattern in a text can use the content of a predetermined text position or witness in the overlap to eliminate one of them. Finding witnesses is a costly operation in a compressed text, thus the importance of witness-free dueling.
Partially supported by NSF grant IRI-90-13055.
Partially supported by NSF grant DMS-90-05833.
Supported by DIMACS under NSF contract STC-88-09648.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Amir and G. Benson. Efficient two-dimensional compressed matching. Proc. of the IEEE Data Compression Conference, pages 279–288, Mar 1992.
A. Amir and G. Benson. Two-dimensional periodicity and its application. Proc. of the Third Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 440–452, Jan 1992.
A. Amir, G. Benson, and M. Farach. Alphabet independent two-dimensional matching. Proc. of the 24th Ann. ACM Symp. on Theory of Computing, pages 59–68, 1992. Also to appear in Siam Journal of Computing.
A. Amir, G. Benson, and M. Farach. The truth, the whole truth, and nothing but the truth: Alphabet independent two dimensional witness table construction. Georgia Tech TR GIT-CC-92/52, 1992.
A. Amir, G. Benson, and M. Farach. Let sleeping files lie: Pattern matching in z-compressed files. Proc. of the Fifth Ann. ACM-SIAM Symp. on Discrete Algorithms, page to appear, 1993.
A. Amir, G. Benson, and M. Farach. Optimal parallel two-dimensional pattern matching. Proc. of the Fifth Ann. ACM Symp. on Parallel Algorithms and Architectures, 1993.
D. Breslauer and Z. Galil. An optimal o(log log n) time parallel string matching algorithm. SIAM J. Comput., 19:1051–1058, 1990.
M. Brown and R. Tarjan. Design and analysis of a data structure for representing sorted lists. SIAM J. Comput., 9(3):594–614, August 1980.
T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. MIT Press, 1990. Problem 9.3-3, page 180.
M. Crochemore, Z. Galil, L. Gasieniec, S. Muthukrishnan, K. Park, H. Ramesh, and W. Rytter. Constant time optimal parallel algorithm for 2d-pattern matching. Manuscript, 1993.
Z. Galil and K. Park. Truly alphabet independent two-dimensional pattern matching. Proc. of the 33rd IEEE Annual Symp. on Foundation of Computer Science, pages 247–256, 1992.
D. E. Knuth, J. H. Morris, and V. R. Pratt. Fast pattern matching in strings. SIAM J. Comp., 6:323–350, 1977.
M. Régnier and L. Rostami. A unifying look at d-dimensional periodicities and space coverings. Proc. 4th Symp. on Combinatorial Pattern Matching, 1993.
U. Vishkin. Optimal parallel pattern matching in strings. Proc. 12th ICALP, pages 91–113, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Amir, A., Benson, G., Farach, M. (1994). Optimal two-dimensional compressed matching. In: Abiteboul, S., Shamir, E. (eds) Automata, Languages and Programming. ICALP 1994. Lecture Notes in Computer Science, vol 820. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58201-0_70
Download citation
DOI: https://doi.org/10.1007/3-540-58201-0_70
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58201-4
Online ISBN: 978-3-540-48566-7
eBook Packages: Springer Book Archive