Generalized pattern matching and periodicity under substring consistent equivalence relations.

Yoshiaki Matsuoka, Takahiro Aoki,Shunsuke Inenaga,Hideo Bannai,Masayuki Takeda

Theoretical Computer Science（2016）

引用 16|浏览10

暂无评分

摘要

Let ź be a substring consistent equivalence relation (SCER) on strings such that for any two strings x , y , x ź y implies that (1) | x | = | y | and (2) x i . . j ź y i . . j for all 0 ź i ź j

查看译文

关键词

String matching algorithm,Generalized periodicity lemma,Order-preserving pattern matching,Parameterized pattern matching

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要