Optimal two-dimensional compressed matching

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

Volumn 820 LNCS, Issue , 1994, Pages 215-226

  Amir, Amihood ^a   Benson, Gary ^b   Farach, Martin ^c  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^c Rutgers University and DIMACS ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPRESSED MATCHING; DIGITIZED DATA; OPTIMAL TIME; RUN LENGTH;

AUTOMATA THEORY;

EID: 84993268719     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58201-0_70     Document Type: Conference Paper

References (14)

1. A. Amir and G. Benson. Efficient two-dimensional compressed matching. Proc of the IEEE Data Compression Conference, pages 279-288, Mar 1992.
2. 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.
3. 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.
4. 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.
5. 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.
6. 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.
7. D. Breslauer and Z. Galil. An optimal o(log log n) time parallel string matching algorithm. SIAM J. Comput., 19:1051-1058, 1990.
8. 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.
9. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. MIT Press, 1990. Problem 9.3-3, page 180.
10. 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.
11. 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.
12. D. E. Knuth, J. H. Morris, and V. R. Pratt. Fast pattern matching in strings. SIAM J. Comp., 6:323-350, 1977.
13. M. Régnier and L. Rostami. A unifying look at d-dimensional periodicities and space coverings. Proc 4th Symp on Combinatorial Pattern Matching, 1993.
14. U. Vishkin. Optimal parallel pattern matching in strings. Proc 12th ICALP, pages 91-113, 1985.