.png){kind=icon}
.png){kind=icon}
Return
Pattern Mining Under Simon's Congruence
.png){kind=icon}
PRE
AI
DOI：10.1007/978-3-032-01475-7_13.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Given two strings u and v and an integer k, we say.u and.v are Simon's congruent with respect to k if they have the same set of subsequences of length at most k We study the complete pattern mining problem for Simon's congruence, where the problem is to find the substrings of a given text.T that maximizes the number of congruent substrings of the text, for each possible value of.k. We design new data structures that capture the equivalence classes with respect to +/- k for substrings of the text. We then propose an O(|T|(2) log (2) |T|)-time algorithm for fixed-sized alphabets using the new data structures.
Keywords:
Simon's congruence
pattern mining
subsequences
equivalence classes
data structures
Journal
D
IF:
0
Papers:
19
Citations:
0