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 [Formula: see text] such that variable sequence [Formula: see text] is encoded by any prefix code. We first build CPMA directly from P and [Formula: see text] in [Formula: see text] time and space, and then convert it into the decoder-embedded CPMA (DECPMA), where |P| is the pattern length and [Formula: see text] is the number of variables defined in [Formula: see text]. The bound [Formula: see text] improves the bound [Formula: see text] 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Foundations of Computer Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
