Article

A RUN-TIME EFFICIENT IMPLEMENTATION OF COMPRESSED PATTERN MATCHING AUTOMATA

International Journal of Foundations of Computer Science (Impact Factor: 0.3). 04/2012; 20(04). DOI: 10.1142/S0129054109006838
Source: dx.doi.org

ABSTRACT

We present a run-time efficient implementation of compressed pattern matching automata (CPMA) of Kida et al. (2003), where a text is given as a truncation-free collage system such that variable sequence is encoded by any prefix code. We first build CPMA directly from P and in time and space, and then convert it into the decoder-embedded CPMA (DECPMA), where |P| is the pattern length and is the number of variables defined in . The bound improves the bound achieved by a straightforward application of the method of Kida et al. We experimentally show that a combination of recursive-pairing compression and byte-oriented Huffman coding allows both a high compression ratio and a high speed CPM.

0 Followers
 · 
3 Reads