Matching of compressed patterns with character-variables

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 15, Issue , 2012, Pages 272-287

  Schmidt Schaub, Manfred ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

Grammar based compression; Matching; Partial words

Indexed keywords

COMPRESSED PATTERN MATCHING; GRAMMAR-BASED COMPRESSION; LINEAR PATTERNS; MATCHING; PARTIAL WORDS; POLYNOMIAL-TIME ALGORITHMS; RELATED ALGORITHMS; STRAIGHT LINE PROGRAM;

DATA COMPRESSION; PATTERN MATCHING;

POLYNOMIAL APPROXIMATION;

EID: 84872946483     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.RTA.2012.272     Document Type: Conference Paper

References (27)

1. D. Benanav, D. Kapur, and P. Narendran. Complexity of matching problems. J. Symb. Comput., 3(1/2):203-216, 1987.
2. 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.
3. J. Berstel and L. Boasson. Partial words and a theorem of Fine and Wilf. Theor. Comput. Sci., 218(1):135-141, 1999.
4. Ph. Bille, R. Fagerberg, and I. Li Gørtz. Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts. ACM Transactions on Algorithms, 6(1), 2009.
5. F. Blanchet-Sadri. Periodicity on partial words. Comput. Math. Appl., 47:71-82, 2004.
6. F. Blanchet-Sadri. Algorithmic combinatorics on partial words. Chapman & Hall/CRC, 2008.
7. F. Blanchet-Sadri, D. Dakota Blair, and R. V. Lewis. Equations on partial words. In MFCS, LNCS 4162, pages 167-178. Springer, 2006.
8. F. Blanchet-Sadri and R. A. Hegstrom. Partial words and a theorem of Fine and Wilf revisited. Theor. Comput. Sci., 270(1-2):401-419, 2002.
9. G. Busatto, M. Lohrey, and S. Maneth. Efficient memory representation of XML documents. In Proceedings of DBPL 2005, LNCS 3774, pages 199-216, 2005.
10. N. J. Fine and H. S. Wilf. Uniqueness theorem for periodic functions. Proc. Am. Math. Soc., 16:109-114, 1965.
11. A. Gascón, G. Godoy, and M. Schmidt-Schauß. Unification and matching on compressed terms. ACM Trans. Comput. Log., 12(4):261-2637, 2011.
12. A. Jez. Faster fully compressed pattern matching by recompression. CoRR, abs/1111.3244, 2011.
13. M. Karpinski, W. Rytter, and A. Shinohara. Pattern-matching for strings with short description. In CPM '95, LNCS 937, pages 205-214. Springer-Verlag, 1995.
14. M. Karpinski, W. Rytter, and A. Shinohara. An efficient pattern-matching algorithm for strings with short descriptions. Nord. J. Comput., 4(2):172-186, 1997.
15. J. Levy, M. Schmidt-Schaub, and M. Villaret. Monadic second-order unification is NPcomplete. In RTA-15, LNCS 3091, pages 55-69. Springer, 2004.
16. J. Levy, M. Schmidt-Schauß, and M. Villaret. The complexity of monadic second-order unification. SIAM J. of Computing, 38(3):1113-1140, 2008.
17. Y. Lifshits. Processing compressed texts: A tractability border. In CPM 2007, pages 228-240, 2007.
18. M. Lohrey. Word problems and membership problems on compressed words. SIAM Journal on Computing, 35(5):1210-1240, 2006.
19. M. Lohrey. Compressed membership problems for regular expressions and hierarchical automata. Int. J. Found. Comput. Sci., 21(5):817-841, 2010.
20. N. Markey and Ph. Schnoebelen. A PTIME-complete matching problem for SLPcompressed words. Inf. Process. Lett., 90(1):3-6, 2004.
21. G. Navarro. Regular expression searching on compressed text. J. Discrete Algorithms, 1(5-6):423-443, 2003.
22. W. Plandowski. Testing equivalence of morphisms in context-free languages. In ESA 94, volume 855 of Lecture Notes in Computer Science, pages 460-470, 1994.
23. W. Plandowski and W. Rytter. Complexity of language recognition problems for compressed words. In Jewels are Forever, pages 262-272. Springer, 1999.
24. M. Schmidt-Schauß. Pattern matching of compressed terms and contexts and polynomial rewriting. Frank report 43, Institut für Informatik. Goethe-Univ. Frankfurt am Main, 2011.
25. T. Yamamoto, H. Bannai, S. Inenaga, and M. Takeda. Faster subsequence and don't-care pattern matching on compressed texts. In 22nd CPM, LNCS 6661, pages 309-322. Springer, 2011.
26. J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, 23(3):337-343, 1977.
27. J. Ziv and A. Lempel. Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory, 24(5):530-536, 1978.