Solving Classical String Problems on Compressed Texts

Dagstuhl Seminar Proceedings

Volumn 6201, Issue , 2006, Pages

  Lifshits, Yury ^a  

^a STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN MATCHING;

COMPRESSED PATTERN MATCHING; PATTERN MATCHING PROBLEMS; PATTERN-MATCHING; POLYNOMIAL ALGORITHM; STRAIGHT LINE PROGRAM;

HAMMING DISTANCE;

EID: 85174903004     PISSN: 18624405     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. A. Amir, A. Apostolico, G. M. Landau, and G. Satta, "Efficient text fingerprinting via parikh mapping," J. Discrete Algorithms, vol. 1, no. 5-6, pp. 409-421, 2003.
2. A. Amir, G. Benson, and M. Farach, "Let sleeping files lie: Pattern matching in Z-compressed files," in SODA: ACM-SIAM Symposium on Discrete Algorithms, 1994.
3. A. Apostolico, M. Farach, and C. S. Iliopoulos, "Optimal superprimitivity testing for strings," Inf. Process. Lett., vol. 39, no. 1, pp. 17-20, 1991.
4. P. Berman, M. Karpinski, L. L. Larmore, W. Plandowski, and W. Rytter, "On the complexity of pattern matching for highly compressed two-dimensional texts," Journal of Computer and Systems Science, vol. 65, no. 2, pp. 332-350, 2002.
5. P. Cegielski, I. Guessarian, Y. Lifshits, and Y. Matiyasevich, "Window subsequence problems for compressed texts," in Proceedings of 1st International Symposium "Computer Science in Russia", ser. LNCS. Springer-Verlag, accepted, 2006.
6. M. Farach and M. Thorup, "String matching in lempel-ziv compressed strings," in STOC '95: Proceedings of the twenty-seventh annual ACM symposium on Theory of computing. ACM Press, 1995, pp. 703-712.
7. M. Garey and D. Johnson, Computers and Intractability: a Guide to the Theory of NP-completeness. Freeman, 1979.
8. L. Gasieniec, M. Karpinski, W. Plandowski, and W. Rytter, "Efficient algorithms for Lempel-Ziv encoding (extended abstract)," in Proceedings of the 5th Scandinavian Workshop on Algorithm Theory (SWAT 1996), ser. LNCS, no. 1097. Springer-Verlag, 1996, pp. 392-403.
9. B. Genest and A. Muscholl, "Pattern matching and membership for hierarchical message sequence charts," in Proc. of LATIN'02, ser. LNCS, no. 2286. Springer-Verlag, 2002, pp. 326-340.
10. D. Gusfield, Algorithms on Strings, Trees, and Sequences. Cambridge University Press, 1997.
11. M. Hirao, A. Shinohara, M. Takeda, and S. Arikawa, "Fully compressed pattern matching algorithm for balanced straight-line programs," in Proc. of 7th International Symposium on String Processing and Information Retrieval (SPIRE2000). IEEE Computer Society, 2000, pp. 132-138.
12. J. Karkkainen, G. Navarro, and E. Ukkonen, "Approximate string matching over Ziv-Lempel compressed text," in Proceedings of the 11st Annual Symposium on Combinatorial Pattern Matching (CPM), ser. LNCS, no. 1848. Springer-Verlag, 2000, pp. 195-209.
13. T. Kida, T. Matsumoto, Y. Shibata, M. Takeda, A. Shinohara, and S. Arikawa, "Collage system: a unifying framework for compressed pattern matching," Theoretical Computer Science, vol. 298, no. 1, pp. 253-272, 2003.
14. Y. Lifshits and M. Lohrey, "Quering and embedding compressed texts," to be submitted, Tech. Rep., 2006.
15. M. Lohrey, "Word problems on compressed word," in Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004), ser. LNCS, no. 3142. Springer-Verlag, 2004, pp. 906-918.
16. M. Miyazaki, A. Shinohara, and M. Takeda, "An improved pattern matching algorithm for strings in terms of straight line programs," in CPM '97: Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching, ser. LNCS, no. 1264. Springer-Verlag, 1997, pp. 1-11.
17. S. Muthukrishnan, "Detecting false matches in string matching algorithms," in Proceedings of Combinatorial Pattern Matching, 4th Annual Symposium, CPM'93, ser. LNCS, no. 684. Springer-Verlag, 1993, pp. 164-178.
18. G. Navarro, "Regular expression searching on compressed text," J. of Discrete Algorithms, vol. 1, no. 5-6, pp. 423-443, 2003.
19. G. Navarro and M. Raffinot, "A general practical approach to pattern matching over Ziv-Lempel compressed text," in Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching (CPM'99), ser. LNCS, no. 1645. Springer-Verlag, 1999, pp. 14-36.
20. W. Plandowski, "Satisfiability of word equations with constants is in PSPACE," J. ACM, vol. 51, no. 3, pp. 483-496, 2004.
21. W. Rytter, "Compressed and fully compressed pattern matching," Proceedings of IEEE, vol. 88, no. 11, pp. 1769-1778, 2000.
22. W. Rytter, "Application of Lempel-Ziv factorization to the approximation of grammar-based compression," Theoretical Computer Science, vol. 302, no. 1-3, pp. 211-222, 2003.
23. W. Rytter, "Grammar compression, LZ-encodings, and string algorithms with implicit input," in Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004), ser. LNCS, no. 3142. Springer-Verlag, 2004, pp. 15-27.
24. J. Ziv and A. Lempel, "A universal algorithm for sequential data compression," IEEE Transactions on Information Theory, vol. 23, no. 3, pp. 337-343, 1977.