Grammar compression, LZ-encodings, and string algorithms with implicit input

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

Volumn 3142, Issue , 2004, Pages 15-27

  Rytter, Wojciech ^a,b  

^a UNIVERSITY OF WARSAW   (Poland)

^b New Jersey Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL LINGUISTICS; ENCODING (SYMBOLS); PARALLEL PROCESSING SYSTEMS;

ALGORITHMIC PROBLEMS; COMPLEXITY ISSUES; CONSTRUCTIVE PROOF; IMPLICIT REPRESENTATION; LANGUAGE RECOGNITION; MINIMAL SOLUTIONS; STRING ALGORITHMS; WORD COMPRESSION;

DATA COMPRESSION;

EID: 35048858264     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27836-8_5     Document Type: Article

References (40)

1. A. Amir, G. Benson and M. Farach, Let sleeping files lie: pattern-matching in Z-compressed files, in SODA'94.
2. A. Amir, G. Benson, Efficient two dimensional compressed matching, Proc. of the 2nd IEEE Data Compression Conference 279-288 (1992).
3. A. Amir, G. Benson and M. Farach, Optimal two-dimensional compressed matching, in ICALP'94 pp.215-225.
4. Angluin D., Finding patterns common to a set of strings, J.C.S.S., 21(1), 46-62, 1980.
5. A. Apostolico, S. Leonardi, Some theory and practice of greedy off-line textual substitution, DCC 1998, pp. 119-128
6. Moses Charikar, Eric Lehman, Ding Liu, Rina Panigrahy, Manoj Prabhakaran, April Rasala, Amit Sahai and Abhi Shelat, Approximating The Smallest Grammar: Kolmogorov Complexity in Natural Models, STOC 2002
7. Choffrut, C., and Karhumäki, J., Combinatorics of words, in G.Rozenberg and A.Salomaa (eds), Handbook of Formal Languages, Springer, 1997.
8. M. Crochemore, W. Rytter, Jewels of stringology - Text algorithms, World Scientific 2003
9. Eyono Obono, S., Goralcik, P., and Maksimenko, M., Efficient solving of the word equations in one variable, in Proc. MFCS'94, LNCS 841, Springer Verlag, 336-341, 1994.
10. Farah, M., Thorup M., String matching in Lempel-Ziv compressed strings, STOC'95, 703-712, 1995.
11. Farach, M., Optimal suffix tree construction with large alphabets, FOCS 1997.
12. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York (1979).
13. L. Ga̧sieniec, M. Karpiński, W. Plandowski and W. Rytter, Efficient algorithms for compressed strings, in proceedings of the SWAT'96, LNCS 1097, 392-403, 1996.
14. L. Ga̧sieniec, M. Karpiński, W. Plandowski and W. Rytter, Randomized Efficient Algorithms for Compressed Strings: the finger-print approach, in proceedings of the CPM'96, LNCS 1075, 39-49, 1996.
15. L.Gasieniec, W. Rytter, Almost optimal fully compressed LZW-matching, in Data Compression Conference, IEEE Computer Society 1999
16. L.Gasieniec, A. Gibbons, W. Rytter, The parallel complexity of pattern-searching in highly compressed texts, in MFCS 1999
17. M. Hirao, A. Shinohara, M. Takeda, S. Arikawa, Faster fully compressed pattern matching algorithm for balanced straight-line programs", Proc. of 7th International Symposium on String Processing and Information Retrieval (SPIRE2000), pp. 132-138. IEEE Computer Society, September 2000
18. Karhumäki J., Mignosi F., Plandowski W., The expressibility of languages and relations by word equations, in ICALP'97, LNCS 1256, 98-109, 1997.
19. J. Karkkainen, P. Sanders, Simple linear work suffix array construction, ICALP 2003
20. M. Karpinski, W. Rytter and A. Shinohara, Pattern-matching for strings with short description, in Combinatorial Pattern Matching, 1995.
21. T. Kida, Y. Shibara, M. Takeda, A. Shinohara, S. Arikawa, A unifying framework for compressed pattern matching, SPIRE'99
22. D. Knuth, The Art of Computing, Vol. II: Seminumerical Algorithms. Second edition. Addison-Wesley (1981).
23. Koscielski, A., and Pacholski, L., Complexity of Makanin's algorithm, J. ACM 43(4), 670-684, 1996.
24. J. Kieffer, E. Yang, Grammar-based codes: a new class of universal lossless source codes, IEEE Trans. on Inf. Theory 46 (2000) pp. 737-754
25. J. K. Lanctot, Ming Li, En-hui Yang, Estimating DNA Sequence Entropy, SODA 2000
26. E. Lehman, A. Shelat, Approximation algorithms for grammar-based compression, SODA 2002
27. A. Lempel, J. Ziv, On the complexity of finite sequences, IEEE Trans, on Inf. Theory, 22, 75-81, 1976.
28. Markus Lohrey, Word problems on compressed words ICALP 2004
29. Makanin, G.S., The problem of solvability of equations in a free semigroup, Mat. Sb., Vol. 103,(145), 147-233, 1977.
30. English transl. in Math. U.S.S.R. Sb. Vol 32, 1977.
31. U. Manber, A text compression scheme that allows fast searching directly in the compressed file, ACM Transactions on Information Systems, 15(2), pp. 124-136, 1997
32. N. Markey, Ph. Schnoebelen, A P-Time complete matching problem for SLP-compressed words, IPL 2004
33. M. Miyazaki, A. Shinohara, M. Takeda, An improved pattern-matching algorithm for strings in terms of straight-line programs, Journal of Discrete Algorithms, Vol.1, pp. 187-204, 2000.
34. W. Plandowski, Satisfiability of word equations with constants is in P-Space, JACM 2004
35. nd Annual European Symposium on Algorithms (ESA'94), LNCS 855, Springer-Verlag (1994), pp. 460-470.
36. W. Plandowski, W. Rytter, Complexity of compressed recognition of formal languages, in "Jewels forever", Springer Verlag 1999 (ed. J. Karhumaki)
37. W.Plandowski, W.Rytter, Applying Lempel-Ziv encodings to the solution of word equations, ICALP 1998
38. W. Rytter, Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression. TCS 1-3(299): 763-774 (2003),
39. Preliminary version in Combinatorial Pattern Matching, June 2002,
40. W. Rytter, Compressed and fully compressed pattern-matching in one and two-dimensions, Proceedings of IEEE, November 2000, Volume 88, Number 11, pp. 1769-1778