Bit-parallel approach to approximate string matching in compressed texts

Proceedings - 7th International Symposium on String Processing and Information Retrieval, SPIRE 2000

Volumn , Issue , 2000, Pages 221-228

  Matsumoto, T ^a   Kida, T ^a   Takeda, M ^a   Shinohara, A ^a   Arikawa, S ^a  

^a KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION RETRIEVAL; SCHEDULING ALGORITHMS;

APPROXIMATE STRING MATCHING; BIT PARALLELISM; COMPRESSION METHODS; DICTIONARY-BASED COMPRESSIONS; FORMAL SYSTEMS; PATTERN LENGTH; SINGLE- MACHINES; TIME AND SPACE COMPLEXITY;

ALGORITHMS;

EID: 84964461893     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SPIRE.2000.878198     Document Type: Conference Paper

References (15)

1. A. Amir and G. Benson. Efficient two-dimensional compressed matching. In Proc. Data Compression Conference, page 279, 1992.
2. R. Baeza-Yates and G. Navarro. Faster approximate string matching. Algorithmica, 23:127-158, 1999.
3. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
4. J. Kärkkäinen, G. Navarro, and E. Ukkonen. Approximate string matching over Ziv-Lempel compressed text. In Proc. 11th Ann. Symp. on Combinatorial Pattern Matching, pages 195-209. Springer-Verlag, 2000.
5. T. Kida, Y. Shibata, M. Takeda, A. Shinohara, and S. Arikawa. A unifying framework for compressed pattern matching. In Proc. 6th International Symp. on String Processing and Information Retrieval, pages 89-96. IEEE Computer Society, 1999.
6. N. J. Larsson and A. Moffat. Offline dictionary-based compression. In Proc. Data Compression Conference '99, pages 296-305. IEEE Computer Society, 1999.
7. G. Navarro. A guided tour to approximate string matching. Technical Report TR/DCC-99-5, Dept. of Computer Science, Univ. of Chile, 1999.
8. G. Navarro and M. Raffinot. A general practical approach to pattern matching over Ziv-Lempel compressed text. In Proc. 10th Ann. Symp. on Combinatorial Pattern Matching, pages 14-36. Springer-Verlag, 1999.
9. C. G. Nevill-Manning, I. H. Witten, and D. L. Maulsby. Compression by induction of hierarchical grammars. In DCC94, pages 244-253. IEEE Press, 1994.
10. P. Sellers. The theory and computation of evolutionary distances: pattern recognition. J. of Algorithms, 1:359-373, 1980.
11. E. Ukkonen. Finding approximate patterns in strings. J. Algorithms, 6, 1985.
12. T. A. Welch. A technique for high performance data compression. IEEE Comput., 17:8-19, June 1984.
13. S. Wu and U. Manber. Fast text searching allowing errors. Comm. ACM, 35(10):83-91, October 1992.
14. J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Trans. on Inform. Theory, IT-23(3):337-349, May 1977.
15. J. Ziv and A. Lempel. Compression of individual sequences via variable-rate coding. IEEE Trans. on Inform. Theory, 24(5):530-536, Sep 1978.