AC-automaton update algorithm for semi-dynamic dictionary matching

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (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.

Original languageEnglish
Title of host publicationString Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Proceedings
EditorsShunsuke Inenaga, Kunihiko Sadakane, Tetsuya Sakai
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783319460482
Publication statusPublished - 2016
Event23rd International Symposium on String Processing and Information Retrieval, SPIRE 2016 - Beppu, Japan
Duration: 2016 Oct 182016 Oct 20

Publication series

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


Conference23rd International Symposium on String Processing and Information Retrieval, SPIRE 2016


  • AC-automaton
  • DAWG
  • Semi-dynamic dictionary matching


Dive into the research topics of 'AC-automaton update algorithm for semi-dynamic dictionary matching'. Together they form a unique fingerprint.

Cite this