TY - GEN
T1 - A run-time efficient implementation of compressed pattern matching automata
AU - Matsumoto, Tetsuya
AU - Hagio, Kazuhito
AU - Takeda, Masayuki
PY - 2008
Y1 - 2008
N2 - We present a run-time efficient implementation of automata for compressed pattern matching (CPM), where a text is given as a truncation-free collage system such that variable sequence is encoded by any prefix code. 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.
AB - We present a run-time efficient implementation of automata for compressed pattern matching (CPM), where a text is given as a truncation-free collage system such that variable sequence is encoded by any prefix code. 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.
UR - http://www.scopus.com/inward/record.url?scp=50249174004&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=50249174004&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-70844-5_21
DO - 10.1007/978-3-540-70844-5_21
M3 - Conference contribution
AN - SCOPUS:50249174004
SN - 354070843X
SN - 9783540708438
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 201
EP - 211
BT - Implementation and Application of Automata - 13th International Conference, CIAA 2008, Proceedings
T2 - 13th International Conference on Implementation and Application of Automata, CIAA 2008
Y2 - 21 July 2008 through 24 July 2008
ER -