Inplace run-length 2d compressed search

Theoretical Computer Science

Volumn 290, Issue 3, 2003, Pages 1361-1383

  Amir, Amihood ^a,b   Landau, Gad M ^c,d   Sokol, Dina ^a  

^a BAR ILAN UNIVERSITY   (Israel)

^b School of Chemistry and Biochemistry   (United States)

^c UNIVERSITY OF HAIFA   (Israel)

^d Polytechnic University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN MATCHING;

COMBINATORIAL PATTERN MATCHING; COMPRESSED MATCHING; COMPRESSED PATTERN MATCHING; INPUT SIZE; LECTURE NOTES; RUN LENGTH; TRANSMISSION OF DATA;

DIGITAL STORAGE;

EID: 85009181002     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00041-5     Document Type: Article

References (15)

1. [1] A. Amir, G. Benson, Efficient two dimensional compressed matching, Proc. Data Compression Conference, Snow Bird, Utah, 1992, pp. 279–288.
2. [2] A. Amir, G. Benson, Two-dimensional periodicity and its application, Proc. 3rd Symp. Discrete Algorithms, Orlando, FL, 1992, pp. 440–452.
3. [3] Amir, A., Benson, G., Two-dimensional periodicity and its application. SIAM J. Comput. 27:1 (1998), 90–106.
4. [4] Amir, A., Benson, G., Farach, M., An alphabet independent approach to two dimensional pattern matching. SIAM J. Comput. 23:2 (1994), 313–323.
5. [5] Amir, A., Benson, G., Farach, M., Optimal two-dimensional compressed matching. J. Algorithms 24:2 (1997), 354–379.
6. [6] A. Amir, G. Landau, D. Sokol, Inplace run-length 2nd compressed search, in: Proc. 11th ACM-SIAM Symp. on Discrete Algorithms (SODA), 2000, pp. 817–818.
7. [7] Berman, P., Karpinski, M., Larmore, L., Plandowski, W., Rytter, W., On the complexity of pattern matching for highly compressed two dimensional texts. Proc. 8th Annu. Symp. Combinatorial Pattern Matching (CPM 97), Lecture Notes in Computer Science, Vol. 1264, 1997, Springer, Berlin, 40–51.
8. [8] M. Farach, M. Thorup, String matching in lempel-ziv compressed strings, Proc. 27th Annu. ACM Symp. Theory Comput., 1995, pp. 703–712.
9. [9] Galil, Z., Park, K., Alphabet-independent two-dimensional witness computation. SIAM J. Comput. 25:5 (1996), 907–935.
10. [10] Gasieniec, L.M.Karpinski, Plandowski, W., Rytter, W., Randomized efficient algorithms for compressed strings: the finger-print approach. Proc. 7th Annu. Symp. Combinatorial Pattern Matching (CPM 96), Lecture Notes in Computer Science, Vol. 1075, 1996, Springer, Berlin, 39–49.
11. [11] Hennessy, J.L., Patterson, D.A., Computer Architeture: a Quantitative Approach, 2nd Edition, 1996, Morgan Kaufmann, Los Altos, CA.
12. [12] Knuth, D.E., Morris, J.H., Pratt, V.R., Fast pattern matching in strings. SIAM J. Comput. 6 (1977), 323–350.
13. [13] Main, M.G., Lorentz, R.J., An O(nlog n) algorithm for finding all repetitions in a string. J. Algorithms, 1984, 422–432.
14. [14] U. Vishkin, Optimal parallel pattern matching in strings, Proc. 12th ICALP, 1985, pp. 91–113.
15. [15] J. Ziv, 1995, Personal communication.