Literal shuffle of compressed words

IFIP International Federation for Information Processing

Volumn 273, Issue , 2008, Pages 87-100

  Bertoni, Alberto ^a   Choffrut, Christian ^b   Radicioni, Roberto ^a  

^a UNIVERSITY OF MILAN   (Italy)

^b UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN MATCHING; POLYNOMIAL APPROXIMATION;

COMPRESSION RATES; DESCRIPTIONAL COMPLEXITY; NP COMPLETE; PATTERN MATCHING PROBLEMS; POLYNOMIAL-TIME; SHUFFLE OF WORDS; STRAIGHT LINE PROGRAM; TIGHT BOUND;

COMPUTER SCIENCE;

EID: 48249130049     PISSN: 15715736     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-09680-3_6     Document Type: Conference Paper

References (17)

1. Béatrice Bérard. Literal shuffle. Theoret. Comput. Sci., 51(3):281-299, 1987.
2. Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, and Wojciech Rytter. On the complexity of pattern matching for highly compressed two-dimensional texts. In Combinatorial pattern matching (Aarhus, 1997), volume 1264 of Lecture Notes in Comput. Sci., pages 40-51. Springer, Berlin, 1997.
3. James W. Cooley and John W. Tukey. An algorithm for the machine calculation of complex Fourier series. Math. Comp., 19:297-301, 1965.
4. Michael R. Garey and David S. Johnson. Computers and intractability W. H. Freeman and Co., San Francisco, Calif., 1979. A guide to the theory of NP-completeness, A Series of Books in the Mathematical Sciences.
5. Leszek Ga̧sieniec, Marek Karpinski, Wojciech Plandowski, and Wojciech Rytter. Randomized efficient algorithms for compressed strings: The finger-print approach (extended abstract). In Combinatorial pattern matching (Laguna Beach, CA, 1996), volume 1075 of Lecture Notes in Comput. Sci., pages 39-49. Springer, Berlin, 1996.
6. Richard M. Karp. Reducibility among combinatorial problems. In Complexity of computer computations (Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heights, N.Y., 1972), pages 85-103. Plenum, New York, 1972.
7. Abraham Lempel and Jacob Ziv. On the complexity of finite sequences. IEEE Trans. Information Theory, IT-22(1):75-81, 1976.
8. Abraham Lempel and Jacob Ziv. A universal algorithm for sequential data compression. IEEE Trans. Information Theory, IT-23(3):337-343, 1977.
9. Yury Lifshits. Processing compressed texts: A tractability border. In Combinatorial Pattern Matching, volume 4580 of Lecture Notes in Comput. Sci., pages 228-240. Springer, Berlin, 2007.
10. Markus Lohrey. Word problems on compressed words. In Automata, languages and programming, volume 3142 of Lecture Notes in Comput. Sci., pages 906-918. Springer, Berlin, 2004.
11. Markus Lohrey. Word problems and membership problems on compressed words. SIAM J. Comput., 35(5):1210-1240 (electronic), 2006.
12. N. Markey and Ph. Schnoebelen. A PTIME-complete matching problem for SLP-compressed words. Inform. Process. Lett., 90(1):3-6, 2004.
13. Masamichi Miyazaki, Ayumi Shinohara, and Masayuki Takeda. An improved pattern matching algorithm for strings in terms of straight-line programs. J. Discrete Algorithms (Oxf.), 1(1):187-204, 2000.
14. C. D. Olds. Continued fractions. Random House, New York, 1963.
15. Wojciech Plandowski. Testing equivalence of morphisms on context-free languages. In Algorithms - ESA '94 (Utrecht), volume 855 of Lecture Notes in Comput. Sci., pages 460-470. Springer, Berlin, 1994.
16. Wojciech Plandowski and Wojciech Rytter. Complexity of language recognition problems for compressed words. In Jewels are forever, pages 262-272. Springer, Berlin, 1999.
17. Wojciech Rytter. Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theoret. Comput. Sci., 302(1-3):211-222, 2003.