Compressed automata for dictionary matching

Tomohiro I; Takaaki Nishimoto; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda

doi:10.1007/978-3-642-39274-0_28

Compressed automata for dictionary matching

Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Mathematical Informatics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

A variant of the dictionary matching problem is addressed where the dictionary is given in an SLP-compressed form. An Aho-Corasick automata-based algorithm is presented which pre-processes the compressed dictionary D in O(n⁴log n) time using O(n² log N) space and recognizes all occurrences of the patterns in D in amortized O(h + m) running time per character, where n and N are, respectively, the compressed and uncompressed sizes of D, and h is the height of D, and m is the number of patterns in the dictionary.

Original language	English
Title of host publication	Implementation and Application of Automata - 18th International Conference, CIAA 2013, Proceedings
Publisher	Springer Verlag
Pages	319-330
Number of pages	12
ISBN (Print)	9783642392733
DOIs	https://doi.org/10.1007/978-3-642-39274-0_28
Publication status	Published - Jan 1 2013
Event	18th International Conference on Implementation and Application of Automata, CIAA 2013 - Halifax, NS, Canada Duration: Jul 16 2013 → Jul 19 2013

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	7982
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	18th International Conference on Implementation and Application of Automata, CIAA 2013
Country	Canada
City	Halifax, NS
Period	7/16/13 → 7/19/13

Fingerprint

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Cite this

I, T., Nishimoto, T., Inenaga, S., Bannai, H., & Takeda, M. (2013). Compressed automata for dictionary matching. In Implementation and Application of Automata - 18th International Conference, CIAA 2013, Proceedings (pp. 319-330). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7982). Springer Verlag. https://doi.org/10.1007/978-3-642-39274-0_28

Compressed automata for dictionary matching. / I, Tomohiro; Nishimoto, Takaaki; Inenaga, Shunsuke ; Bannai, Hideo ; Takeda, Masayuki.

Implementation and Application of Automata - 18th International Conference, CIAA 2013, Proceedings. Springer Verlag, 2013. p. 319-330 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7982).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

I, T, Nishimoto, T, Inenaga, S , Bannai, H & Takeda, M 2013, Compressed automata for dictionary matching. in Implementation and Application of Automata - 18th International Conference, CIAA 2013, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7982, Springer Verlag, pp. 319-330, 18th International Conference on Implementation and Application of Automata, CIAA 2013, Halifax, NS, Canada, 7/16/13. https://doi.org/10.1007/978-3-642-39274-0_28

I T, Nishimoto T, Inenaga S , Bannai H , Takeda M. Compressed automata for dictionary matching. In Implementation and Application of Automata - 18th International Conference, CIAA 2013, Proceedings. Springer Verlag. 2013. p. 319-330. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-39274-0_28

I, Tomohiro ; Nishimoto, Takaaki ; Inenaga, Shunsuke ; Bannai, Hideo ; Takeda, Masayuki. / Compressed automata for dictionary matching. Implementation and Application of Automata - 18th International Conference, CIAA 2013, Proceedings. Springer Verlag, 2013. pp. 319-330 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{68a878fd4c344f85a4198ea7a6b17810,

title = "Compressed automata for dictionary matching",

abstract = "A variant of the dictionary matching problem is addressed where the dictionary is given in an SLP-compressed form. An Aho-Corasick automata-based algorithm is presented which pre-processes the compressed dictionary D in O(n4log n) time using O(n2 log N) space and recognizes all occurrences of the patterns in D in amortized O(h + m) running time per character, where n and N are, respectively, the compressed and uncompressed sizes of D, and h is the height of D, and m is the number of patterns in the dictionary.",

author = "Tomohiro I and Takaaki Nishimoto and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda",

year = "2013",

month = "1",

day = "1",

doi = "10.1007/978-3-642-39274-0_28",

language = "English",

isbn = "9783642392733",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "319--330",

booktitle = "Implementation and Application of Automata - 18th International Conference, CIAA 2013, Proceedings",

address = "Germany",

}

TY - GEN

T1 - Compressed automata for dictionary matching

AU - I, Tomohiro

AU - Nishimoto, Takaaki

AU - Inenaga, Shunsuke

AU - Bannai, Hideo

AU - Takeda, Masayuki

PY - 2013/1/1

Y1 - 2013/1/1

N2 - A variant of the dictionary matching problem is addressed where the dictionary is given in an SLP-compressed form. An Aho-Corasick automata-based algorithm is presented which pre-processes the compressed dictionary D in O(n4log n) time using O(n2 log N) space and recognizes all occurrences of the patterns in D in amortized O(h + m) running time per character, where n and N are, respectively, the compressed and uncompressed sizes of D, and h is the height of D, and m is the number of patterns in the dictionary.

AB - A variant of the dictionary matching problem is addressed where the dictionary is given in an SLP-compressed form. An Aho-Corasick automata-based algorithm is presented which pre-processes the compressed dictionary D in O(n4log n) time using O(n2 log N) space and recognizes all occurrences of the patterns in D in amortized O(h + m) running time per character, where n and N are, respectively, the compressed and uncompressed sizes of D, and h is the height of D, and m is the number of patterns in the dictionary.

UR - http://www.scopus.com/inward/record.url?scp=84881250412&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84881250412&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-39274-0_28

DO - 10.1007/978-3-642-39274-0_28

M3 - Conference contribution

AN - SCOPUS:84881250412

SN - 9783642392733

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 319

EP - 330

BT - Implementation and Application of Automata - 18th International Conference, CIAA 2013, Proceedings

PB - Springer Verlag

ER -

Access to Document

10.1007/978-3-642-39274-0_28