Generalized dictionary matching under substring consistent equivalence relations

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)


Given a set of patterns called a dictionary and a text, the dictionary matching problem is a task to find all occurrence positions of all patterns in the text. The dictionary matching problem can be solved efficiently by using the Aho-Corasick algorithm. Recently, Matsuoka et al. [TCS, 2016] proposed a generalization of pattern matching problem under substring consistent equivalence relations and presented a generalization of the Knuth-Morris-Pratt algorithm to solve this problem. An equivalence relation ≈ is a substring consistent equivalence relation (SCER) if for two strings X, Y, X ≈ Y implies |X| = |Y| and X[i: j] ≈ Y [i: j] for all 1 ≤ i ≤ j ≤ |X|. In this paper, we propose a generalization of the dictionary matching problem and present a generalization of the Aho-Corasick algorithm for the dictionary matching under SCER. We present an algorithm that constructs SCER automata and an algorithm that performs dictionary matching under SCER by using the automata. Moreover, we show the time and space complexity of our algorithms with respect to the size of input strings.

Original languageEnglish
Title of host publicationWALCOM
Subtitle of host publicationAlgorithms and Computation - 14th International Conference, WALCOM 2020, Proceedings
EditorsM. Sohel Rahman, Kunihiko Sadakane, Wing-Kin Sung
Number of pages13
ISBN (Print)9783030398804
Publication statusPublished - 2020
Event14th International Conference and Workshops on Algorithms and Computation, WALCOM 2020 - Singapore, Singapore
Duration: 2020 Mar 312020 Apr 2

Publication series

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


Conference14th International Conference and Workshops on Algorithms and Computation, WALCOM 2020


  • Aho-Corasick algorithm
  • Dictionary matching
  • Substring consistent equivalence relation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Generalized dictionary matching under substring consistent equivalence relations'. Together they form a unique fingerprint.

Cite this