Palindrome pattern matching

6 引用 (Scopus)

抄録

A palindrome is a string that reads the same forward and backward. For a string x, let Pals(x) be the set of all maximal palindromes of x, where each maximal palindrome in Pals(x) is encoded by a pair (c,r) of its center c and its radius r. Given a text t of length n and a pattern p of length m, the palindrome pattern matching problem is to compute all positions i of t such that Pals(p)=Pals(t[i:i+m-1]). We present linear-time algorithms to solve this problem.

元の言語 英語 162-170 9 Theoretical Computer Science 483 https://doi.org/10.1016/j.tcs.2012.01.047 出版済み - 4 29 2013

Fingerprint

Palindrome
Pattern matching
Pattern Matching
Strings
Matching Problem
Linear-time Algorithm

All Science Journal Classification (ASJC) codes

• Theoretical Computer Science
• Computer Science(all)

これを引用

：: Theoretical Computer Science, 巻 483, 29.04.2013, p. 162-170.

@article{3f5de82485e24968bd3aa4de5aa886cc,
title = "Palindrome pattern matching",
abstract = "A palindrome is a string that reads the same forward and backward. For a string x, let Pals(x) be the set of all maximal palindromes of x, where each maximal palindrome in Pals(x) is encoded by a pair (c,r) of its center c and its radius r. Given a text t of length n and a pattern p of length m, the palindrome pattern matching problem is to compute all positions i of t such that Pals(p)=Pals(t[i:i+m-1]). We present linear-time algorithms to solve this problem.",
author = "I. Tomohiro and Shunsuke Inenaga and Masayuki Takeda",
year = "2013",
month = "4",
day = "29",
doi = "10.1016/j.tcs.2012.01.047",
language = "English",
volume = "483",
pages = "162--170",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",

}

TY - JOUR

T1 - Palindrome pattern matching

AU - Tomohiro, I.

AU - Inenaga, Shunsuke

AU - Takeda, Masayuki

PY - 2013/4/29

Y1 - 2013/4/29

N2 - A palindrome is a string that reads the same forward and backward. For a string x, let Pals(x) be the set of all maximal palindromes of x, where each maximal palindrome in Pals(x) is encoded by a pair (c,r) of its center c and its radius r. Given a text t of length n and a pattern p of length m, the palindrome pattern matching problem is to compute all positions i of t such that Pals(p)=Pals(t[i:i+m-1]). We present linear-time algorithms to solve this problem.

AB - A palindrome is a string that reads the same forward and backward. For a string x, let Pals(x) be the set of all maximal palindromes of x, where each maximal palindrome in Pals(x) is encoded by a pair (c,r) of its center c and its radius r. Given a text t of length n and a pattern p of length m, the palindrome pattern matching problem is to compute all positions i of t such that Pals(p)=Pals(t[i:i+m-1]). We present linear-time algorithms to solve this problem.

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

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

U2 - 10.1016/j.tcs.2012.01.047

DO - 10.1016/j.tcs.2012.01.047

M3 - Article

VL - 483

SP - 162

EP - 170

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -