Pattern Matching in DCA Coded Text

  • Jan Lahoda
  • Bořivoj Melichar
  • Jan Žd’árek
Conference paper

DOI: 10.1007/978-3-540-70844-5_16

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5148)
Cite this paper as:
Lahoda J., Melichar B., Žd’árek J. (2008) Pattern Matching in DCA Coded Text. In: Ibarra O.H., Ravikumar B. (eds) Implementation and Applications of Automata. CIAA 2008. Lecture Notes in Computer Science, vol 5148. Springer, Berlin, Heidelberg

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 m is the length of the pattern, AD is the antidictionary, nC is the length of the coded text and r is the number of found matches.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Jan Lahoda
    • 1
    • 2
  • Bořivoj Melichar
    • 1
  • Jan Žd’árek
    • 1
  1. 1.Department of Computer Science and Engineering, Faculty of Electrical EngineeringCzech Technical University in PraguePraha 2Czech Republic
  2. 2.Sun Microsystems CzechPraha 4Czech Republic

Personalised recommendations