A run-time efficient implementation of compressed pattern matching automata

Tetsuya Matsumoto, Kazuhito Hagio, Masayuki Takeda

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationImplementation and Application of Automata - 13th International Conference, CIAA 2008, Proceedings
Pages201-211
Number of pages11
DOIs
Publication statusPublished - Sep 1 2008
Event13th International Conference on Implementation and Application of Automata, CIAA 2008 - San Francisco, CA, United States
Duration: Jul 21 2008Jul 24 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5148 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other13th International Conference on Implementation and Application of Automata, CIAA 2008
CountryUnited States
CitySan Francisco, CA
Period7/21/087/24/08

Fingerprint

Pattern matching
Pattern Matching
Efficient Implementation
Automata
Compression
Huffman Coding
Prefix
Pairing
Truncation
High Speed
Text

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Matsumoto, T., Hagio, K., & Takeda, M. (2008). A run-time efficient implementation of compressed pattern matching automata. In Implementation and Application of Automata - 13th International Conference, CIAA 2008, Proceedings (pp. 201-211). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5148 LNCS). https://doi.org/10.1007/978-3-540-70844-5_21

A run-time efficient implementation of compressed pattern matching automata. / Matsumoto, Tetsuya; Hagio, Kazuhito; Takeda, Masayuki.

Implementation and Application of Automata - 13th International Conference, CIAA 2008, Proceedings. 2008. p. 201-211 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5148 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Matsumoto, T, Hagio, K & Takeda, M 2008, A run-time efficient implementation of compressed pattern matching automata. in Implementation and Application of Automata - 13th International Conference, CIAA 2008, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5148 LNCS, pp. 201-211, 13th International Conference on Implementation and Application of Automata, CIAA 2008, San Francisco, CA, United States, 7/21/08. https://doi.org/10.1007/978-3-540-70844-5_21
Matsumoto T, Hagio K, Takeda M. A run-time efficient implementation of compressed pattern matching automata. In Implementation and Application of Automata - 13th International Conference, CIAA 2008, Proceedings. 2008. p. 201-211. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-70844-5_21
Matsumoto, Tetsuya ; Hagio, Kazuhito ; Takeda, Masayuki. / A run-time efficient implementation of compressed pattern matching automata. Implementation and Application of Automata - 13th International Conference, CIAA 2008, Proceedings. 2008. pp. 201-211 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{5180f2244ad640d6b709e4ce45ece4fe,
title = "A run-time efficient implementation of compressed pattern matching automata",
abstract = "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.",
author = "Tetsuya Matsumoto and Kazuhito Hagio and Masayuki Takeda",
year = "2008",
month = "9",
day = "1",
doi = "10.1007/978-3-540-70844-5_21",
language = "English",
isbn = "354070843X",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "201--211",
booktitle = "Implementation and Application of Automata - 13th International Conference, CIAA 2008, Proceedings",

}

TY - GEN

T1 - A run-time efficient implementation of compressed pattern matching automata

AU - Matsumoto, Tetsuya

AU - Hagio, Kazuhito

AU - Takeda, Masayuki

PY - 2008/9/1

Y1 - 2008/9/1

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

ER -