Generalized pattern matching and periodicity under substring consistent equivalence relations

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

Research output: Contribution to journalArticlepeer-review

9 Citations (Scopus)

Abstract

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<|x|. Examples of SCER are parameterized pattern matching and order-preserving pattern matching. We present a generalized and efficient algorithm for pattern matching with SCER ≈. Also, we show analogues of Fine and Wilf's periodicity lemma hold for SCER.

Original languageEnglish
Pages (from-to)225-233
Number of pages9
JournalTheoretical Computer Science
Volume656
DOIs
Publication statusPublished - Dec 20 2016

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

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

Cite this