Pattern Matching in DCA Coded Text

Authors:
Jan Lahoda;Bořivoj Melichar;Jan Žd'árek
Affiliations:
Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, Praha 2, Czech Republic 121 35 and Sun Microsystems Czech, Praha 4, Czech R ...;Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, Praha 2, Czech Republic 121 35;Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, Praha 2, Czech Republic 121 35
Venue:
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Year:
2008

Citing 4
Cited 0

Automata for matching patterns

Handbook of formal languages, vol. 2
Text Compression Using Antidictionaries

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Pattern Matching in Text Compressed by Using Antidictionaries

CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Improved Antidictionary Based Compression

SCCC '02 Proceedings of the XII International Conference of the Chilean Computer Science Society

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new algorithm searching all occurrences of a regular expression pattern in a text is presented. It uses only the text that has been compressed by the text compression using antidictionaries without its decompression. The proposed algorithm runs in ${\mathcal O}(2^m\cdot||{\rm AD}||^2+n_c+r)$ worst case time, where mis the length of the pattern, AD is the antidictionary, nCis the length of the coded text and ris the number of found matches.