Shift-and approach to pattern matching in LZW compressed text

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

Volumn 1645, Issue , 1999, Pages 1-13

  Kida, Takuya ^a   Takeda, Masayuki ^a   Shinohara, Ayumi ^a   Arikawa, Setsuo ^a  

^a KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

GENERALIZED PATTERN MATCHING; K-MISMATCHES; MULTIPLE-PATTERN MATCHING; PATTERN LENGTH; SHIFT-AND; TEXT LENGTH; WORD LENGTH;

PATTERN MATCHING;

EID: 84957655641     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48452-3_1     Document Type: Conference Paper

References (18)

1. [1] K. Abrahamson. Generalized string matching. SIAM J. Comput., 16(6):1039-1051, December 1987.
2. [2] A. Amir and G. Benson. Efficient two-dimensional compressed matching. In Proc. Data Compression Conference, page 279, 1992.
3. [3] A. Amir and G. Benson. Two-dimensional periodicity and its application. In Proc. 3rd Symposium on Discrete Algorithms, page 440, 1992.
4. [4] A. Amir, G. Benson, and M. Farach. Optimal two-dimensional compressed match-ing. In Proc. 21st International Colloquium on Automata, Languages and Pro-gramming, 1994.
5. [5] A. Amir, G. Benson, and M. Farach. Let sleeping files lie: Pattern matching in Z-compressed files. Journal of Computer and System Sciences, 52:299-307, 1996.
6. [6] A. Amir, G. M. Landau, and U. Vishkin. Efficient pattern matching with scaling. Journal of Algorithms, 13(1):2-32, 1992.
7. [7] R. Baeza-Yaltes and G. H. Gonnet. A new approach to text searching. Comm. ACM, 35(10):74-82, October 1992.
8. [8] T. Eilam-Tzoreff and U. Vishkin. Matching patterns in a string subject to mul-tilinear transformations. In Proc. International Workshop on Sequences, Combi-natorics, Compression, Security and Transmission, 1988.
9. [9] M. Farach and M. Thorup. String-matching in Lempel-Ziv compressed strings. In 27th ACM STOC, pages 703-713, 1995.
10. [10] Z. Galil and R. Giancarlo. Data structures and algorithms for approximate string matching. Journal of Complexity, 4:33-72, 1988.
11. [11] L. Gasieniec, M. Karpinski, W. Plandowski, and W. Rytter. Efficient algorithms for Lempel-Ziv encoding. In Proc. 4th Scandinavian Workshop on Algorithm The-ory, volume 1097 of Lecture Notes in Computer Science, pages 392-403. Springer-Verlag, 1996.
12. [12] M. Karpinski, W. Rytter, and A. Shinohara. An Efficient pattern-matching algo-rithm for strings with short descriptions. Nordic Journal of Computing, 4:172-186, 1997.
13. [13] T. Kida, M. Takeda, A. Shinohara, M. Miyazaki, and S. Arikawa. Multiple pattern matching in LZW compressed text. In J. A. Atorer and M. Cohn, editors, Proc. of Data Compression Conference '98, pages 103-112. IEEE Computer Society, March 1998.
14. [14] U. Manber. A text compression scheme that allows fast searching directly in the compressed _le. In Proc. 5th Annu. Symp. Combinatorial Pattern Matching, volume 807 of Lecture Notes in Computer Science, pages 113-124. Springer-Verlag, 1994.
15. [15] M. Miyazaki, A. Shinohara, and M. Takeda. An improved pattern matching al-gorithm for strings in terms of straight-line programs. In Proc. 8th Annu. Symp. Combinatorial Pattern Matching, volume 1264 of Lecture Notes in Computer Sci-ence, pages 1-11. Springer-Verlag, 1997.
16. [16] T. A. Welch. A technique for high performance data compression. IEEE Comput., 17:8-19, June 1984.
17. [17] S. Wu and U. Manber. Fast text searching allowing errors. Comm. ACM, 35(10):83-91, October 1992.
18. [18] J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Trans. Inform. Theory, IT-23(3):337-349, May 1977.