TY - GEN
T1 - AC-automaton update algorithm for semi-dynamic dictionary matching
AU - Diptarama,
AU - Yoshinaka, Ryo
AU - Shinohara, Ayumi
N1 - Funding Information:
This work is supported by Tohoku University Division for Interdisciplinary Advance Research and Education, JSPS KAKENHI Grant Numbers JP15H05706, JP24106010, and ImPACT Program of Council for Science, Technology and Innovation (Cabinet Office, Government of Japan).
Publisher Copyright:
© Springer International Publishing AG 2016.
PY - 2016
Y1 - 2016
N2 - 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.
AB - 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.
KW - AC-automaton
KW - DAWG
KW - Semi-dynamic dictionary matching
UR - http://www.scopus.com/inward/record.url?scp=84989909074&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84989909074&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-46049-9_11
DO - 10.1007/978-3-319-46049-9_11
M3 - Conference contribution
AN - SCOPUS:84989909074
SN - 9783319460482
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 110
EP - 121
BT - String Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Proceedings
A2 - Inenaga, Shunsuke
A2 - Sadakane, Kunihiko
A2 - Sakai, Tetsuya
PB - Springer Verlag
T2 - 23rd International Symposium on String Processing and Information Retrieval, SPIRE 2016
Y2 - 18 October 2016 through 20 October 2016
ER -