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

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'A run-time efficient implementation of compressed pattern matching automata'. Together they form a unique fingerprint.

  • 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