Generalized pattern matching and periodicity under substring consistent equivalence relations

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

研究成果: ジャーナルへの寄稿記事

4 引用 (Scopus)

抄録

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.

元の言語英語
ページ(範囲)225-233
ページ数9
ジャーナルTheoretical Computer Science
656
DOI
出版物ステータス出版済み - 12 20 2016

Fingerprint

Pattern matching
Pattern Matching
Equivalence relation
Periodicity
Strings
Lemma
Efficient Algorithms
Analogue
Imply

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

これを引用

Generalized pattern matching and periodicity under substring consistent equivalence relations. / Matsuoka, Yoshiaki; Aoki, Takahiro; Inenaga, Shunsuke; Bannai, Hideo; Takeda, Masayuki.

:: Theoretical Computer Science, 巻 656, 20.12.2016, p. 225-233.

研究成果: ジャーナルへの寄稿記事

@article{143fb6b2aecb41d1b8c8de17cac3c2bf,
title = "Generalized pattern matching and periodicity under substring consistent equivalence relations",
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.",
author = "Yoshiaki Matsuoka and Takahiro Aoki and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda",
year = "2016",
month = "12",
day = "20",
doi = "10.1016/j.tcs.2016.02.017",
language = "English",
volume = "656",
pages = "225--233",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",

}

TY - JOUR

T1 - Generalized pattern matching and periodicity under substring consistent equivalence relations

AU - Matsuoka, Yoshiaki

AU - Aoki, Takahiro

AU - Inenaga, Shunsuke

AU - Bannai, Hideo

AU - Takeda, Masayuki

PY - 2016/12/20

Y1 - 2016/12/20

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84964354369&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84964354369&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2016.02.017

DO - 10.1016/j.tcs.2016.02.017

M3 - Article

AN - SCOPUS:84964354369

VL - 656

SP - 225

EP - 233

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -