Window subsequence problems for compressed texts

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

Volumn 3967 LNCS, Issue , 2006, Pages 127-136

  Cégielski, Patrick ^a   Guessarian, Irène ^b   Lifshits, Yury ^c   Matiyasevich, Yuri ^c  

^a UNIVERSITÉ PARIS EST CRÉTEIL   (France)

^b UNIVERSITÉ PARIS DIDEROT   (France)

^c STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA COMPRESSION; NUMBER THEORY; PATTERN MATCHING; PROBLEM SOLVING; TEXT PROCESSING;

LERNPEL-ZIV- COMPRESSION; NATURAL NUMBERS; STRINGS; WINDOW SUBSEQUENCES;

COMPUTER SCIENCE;

EID: 33745941963     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11753728_15     Document Type: Conference Paper

References (18)

1. [ABF95] A. Amir, G. Benson, M. Farach, Let sleeping files lie: pattern matching in Z-compressed files, J. Comput. Syst. Sci., Vol. 52 (2) (1996), pp. 299-307.
2. [BKLPR02] P. Berman, M. Karpinski, L. Larmore, W. Plandowski, W. Rytter, On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts, Journal of Computer and Systems Science, Vol. 65 (2), (2002), pp. 332-350.
3. [C88] M. Crochemore, String-matching with constraints, Proc. MFCS'88, LNCS 324, Springer-Verlag, Berlin (1988), pp. 44-58.
4. [GKPR96] L. Gasieniec, M. Karpinski, W. Plandowski and W. Rytter. Efficient Algorithms for Lempel-Ziv Encoding (Extended Abstract), Proceedings of the 5th Scandinavian Workshop on Algorithm Theory (SWAT 1996), LNCS 1097, Springer-Verlag, Berlin (1996), pp. 392-403.
5. [GM02] B. Genest, A. Muscholl, Pattern Matching and Membership for Hierarchical Message Sequence Charts, In Proceedings of the 5th Latin American Symposium on Theoretical Informatics (LATIN 2002), LNCS 2286, Springer-Verlag, Berlin (2002), pp. 326-340.
6. [LZ77] G. Ziv, A. Lempel, A universal algorithm for sequential data compresssion, IEEE Transactions on Information Theory, Vol. 23 (3), (1977), pp. 337-343.
7. [LZ78] G. Ziv, A. Lempel, Compresssion of individual sequences via variable-rate coding, IEEE Transactions on Information Theory, Vol. 24, (1978), pp. 530-536.
8. [L05] Yu. Lifshits, On the computational complexity of embedding of compressed texts, St.Petersburg State University Diploma thesis, (2005); http://logic.pdmi.ras.ru/~yura/en/diplomen.pdf.
9. [LL05] Yu. Lifshits, M. Lohrey, Querying and Embedding Compressed Texts, to appear (2005).
10. [Loh04] M. Lohrey, Word problems on compressed word, ICALP 2004, Springer-Verlag, LNCS 3142, Berlin (2004), pp. 906-918.
11. [M02] H. Mannila, Local and Global Methods in Data Mining: Basic Techniques and open Problems, Proc. ICALP 2002, LNCS 2380, Springer-Verlag, Berlin (2002), pp. 57-68.
12. [MS04] N. Markey, P. Schnoebelen, A PTIME-complete matching problem for SLP-compressed words, Information Processing Letters, Vol. 90 (1), (2004), pp. 3-6.
13. [Ma71] Yu. Matiyasevich, Real-time recognition of the inclusion relation, Zapiski Nauchnykh Leningradskovo Otdeleniya Mat. Inst. Steklova Akad. Nauk SSSR, Vol. 20, (1971), pp. 104-114.
14. Translated into English, Journal of Soviet Mathematics, Vol. 1, (1973), pp. 64-70; http://logic.pdmi.ras.ru/~yunat/Journal.
15. [R99] W. Rytter, Algorithms on compressed strings and arrays, Proc. SOFSEM'99, LNCS 1725, Springer-Verlag, Berlin (1999), pp. 48-65.
16. [R03] W. Rytter, Application of Lempel-Ziv factorization to the approximation of grammar-based compression, TCS 1-3(299) (2003), pp. 763-774.
17. [S71] A. Slissenko, String-matching in real time, LNCS 64, Springer-Verlag, Berlin (1978), pp. 493-496.
18. [W84] T. Welch, A technique for high performance data compresssion, Computer, (June 1984), pp. 8-19.