Querying and embedding compressed texts

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

Volumn 4162 LNCS, Issue , 2006, Pages 681-692

  Lifshits, Yury ^a   Lohrey, Markus ^b  

^a STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

^b UNIVERSITY OF STUTTGART   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; EMBEDDED SYSTEMS; PROBLEM SOLVING; QUERY LANGUAGES;

EMBEDDING PROBLEM; QUERYING PROBLEM; TEXT COMPRESSION;

TEXT PROCESSING;

EID: 33750068300     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11821069_59     Document Type: Conference Paper

References (24)

1. A. Amir, G. Benson, and M. Farach. Let sleeping files lie: Pattern matching in Z-compressed files. J. Comput. Syst. Sci, 52(2):299-307, 1996.
2. M. Beaudry, P. McKenzie, P. Péladeau, and D. Thérien. Finite monoids: From word to circuit evaluation. SIAM J. Comput., 26(1):138-152, 1997.
3. P. Berman, M. Karpinski, L. L. Larmore, W. Plandowski, and W. Rytter. On the complexity of pattern matching for highly compressed two-dimensional texts. J. Comput. Syst. Sci., 65(2):332-350, 2002.
4. M. Charikar, E. Lehman, A. Lehman, D. Liu, R. Panigrahy, M. Prabhakaran, A. Sahai, and A. Shelat. The smallest grammar problem. IEEE Trans. Inf. Theory, 51(7):2554-2576, 2005.
5. R. G. Downey and M. R. Fellows. Parametrized Complexity. Springer, 1999.
6. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, 1979.
7. L. Gasieniec, A. Gibbons, and W. Rytter. Efficiency of fast parallel pattern searching in highly compressed texts. In Proc. MFCS'99, LNCS 1672, pages 48-58. Springer, 1999.
8. L. Gasieniec, M. Karpinski, W. Plandowski, and W. Rytter. Efficient algorithms for Lempel-Ziv encoding (extended abstract). In Proc. SWAT 1996, LNCS 1097, pages 392-403. Springer, 1996.
9. R. Greenlaw, H. J. Hoover, and W. L. Ruzzo. Limits to Parallel Computation: P-Completeness Theory. Oxford Univ. Press, 1995.
10. D. Gushfield. Algorithms on Strings, Trees, and Sequences. Cambridge Univ. Press, 1999.
11. H. J. Karloff and W. L. Ruzzo. The iterated mod problem. Inf. Comput., 80(3):193-204, 1989.
12. M. Lohrey. Word problems and membership problems on compressed words. SIAM J. Comput., 35(5):1210-1240, 2006.
13. N. Markey and P. Schnoebelen. A PTIME-complete matching problem for SLP-compressed words. Inf. Process. Lett., 90(1):3-6, 2004.
14. M. Miyazaki, A. Shinohara, and M. Takeda. An improved pattern matching algorithm for strings in terms of straight-line programs. In Proc. CPM 97, LNCS 1264, pages 1-11. Springer, 1997.
15. G. Navarro. Regular expression searching on compressed text. J. Discrete Algorithms, 1(5-6):423-443, 2003.
16. C. H. Papadimitriou. Computational Complexity. Addison Wesley, 1994.
17. W. Plandowski. Testing equivalence of morphisms on context-free languages. In Proc. ESA'94, LNCS 855, pages 460-470. Springer, 1994.
18. W. Plandowski and W. Rytter. Complexity of language recognition problems for compressed words. In Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa, pages 262-272. Springer, 1999.
19. W. Rytter. Algorithms on compressed strings and arrays. In Proc. SOFSEM'99, LNCS 1725, pages 48-65. Springer, 1999.
20. W. Rytter. Compressed and fully compressed pattern matching in one and two dimensions. Proceedings of the IEEE, 88(11):1769-1778, 2000.
21. W. Rytter. Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theor. Comput. Sci., 302(1-3):211-222, 2003.
22. W. Rytter. Grammar compression, LZ-encodings, and string algorithms with implicit input. In Proc. ICALP 2004, LNCS 3142, pages 15-27. Springer, 2004.
23. K. W. Wagner. More complicated questions about maxima and minima, and some closures of NP. Theor. Comput. Sci., 51:53-80, 1987.
24. J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory, 23(3):337-343, 1977.