Generalized Dictionary Matching under Substring Consistent Equivalence Relations

09/17/2019
by   Diptarama Hendrian, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/27/2022

Parallel algorithm for pattern matching problems under substring consistent equivalence relations

Given a text and a pattern over an alphabet, the pattern matching proble...
research
09/07/2018

Streaming dictionary matching with mismatches

In the k-mismatch problem we are given a pattern of length m and a text ...
research
06/29/2020

Pattern Masking for Dictionary Matching

In the Pattern Masking for Dictionary Matching (PMDM) problem, we are gi...
research
01/13/2023

Computing matching statistics on Wheeler DFAs

Matching statistics were introduced to solve the approximate string matc...
research
02/17/2020

Computing Covers under Substring Consistent Equivalence Relations

Covers are a kind of quasiperiodicity in strings. A string C is a cover ...
research
02/17/2020

DAWGs for parameterized matching: online construction and related indexing structures

Two strings x and y over Σ∪Π of equal length are said to parameterized m...
research
08/05/2019

Heuristic Algorithm for Generalized Function Matching

The problem of generalized function matching can be defined as follows: ...

Please sign up or login with your details

Forgot password? Click here to reset