AC-automaton update algorithm for semi-dynamic dictionary matching

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

Given a set of pattern strings called a dictionary and a text string, dictionary matching is the problem to find the occurrences of the patterns on the text. Dynamic dictionary matching is dictionary matching where patterns may dynamically be inserted into and deleted from the dictionary. The problem is called semi-dynamic dictionary matching when we only consider the insertion. An AC-automaton is a data structure which enables us to solve dictionary matching in O(d log σ) preprocessing time and O(n log σ) matching time, where d denotes the total length of the patterns in the dictionary, n denotes the length of the text, and σ denotes the alphabet size. In this paper we propose an efficient algorithm that dynamically updates an AC automaton for insertion of a new pattern by using a directed acyclic word graph.

本文言語English
ホスト出版物のタイトルString Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Proceedings
編集者Shunsuke Inenaga, Kunihiko Sadakane, Tetsuya Sakai
出版社Springer Verlag
ページ110-121
ページ数12
ISBN(印刷版)9783319460482
DOI
出版ステータスPublished - 2016
イベント23rd International Symposium on String Processing and Information Retrieval, SPIRE 2016 - Beppu, Japan
継続期間: 2016 10 182016 10 20

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
9954 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other23rd International Symposium on String Processing and Information Retrieval, SPIRE 2016
国/地域Japan
CityBeppu
Period16/10/1816/10/20

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「AC-automaton update algorithm for semi-dynamic dictionary matching」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル