A hardness result and new algorithm for the longest common palindromic subsequence problem

Shunsuke Inenaga, Heikki Hyyrö

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

3 引用 (Scopus)

抄録

The 2-LCPS problem, first introduced by Chowdhury et al. (2014) [17], asks one to compute (the length of) a longest common palindromic subsequence between two given strings A and B. We show that the 2-LCPS problem is at least as hard as the well-studied longest common subsequence problem for four strings. Then, we present a new algorithm which solves the 2-LCPS problem in O(σM2+n) time, where n denotes the length of A and B, M denotes the number of matching positions between A and B, and σ denotes the number of distinct characters occurring in both A and B. Our new algorithm is faster than Chowdhury et al.'s sparse algorithm when σ=o(log2⁡nlog⁡log⁡n).

元の言語英語
ページ(範囲)11-15
ページ数5
ジャーナルInformation Processing Letters
129
DOI
出版物ステータス出版済み - 1 1 2018

Fingerprint

Longest Common Subsequence
Hardness
Denote
Strings
Distinct

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

これを引用

A hardness result and new algorithm for the longest common palindromic subsequence problem. / Inenaga, Shunsuke; Hyyrö, Heikki.

:: Information Processing Letters, 巻 129, 01.01.2018, p. 11-15.

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

@article{67748d3c8a5a41c383714724ac342eae,
title = "A hardness result and new algorithm for the longest common palindromic subsequence problem",
abstract = "The 2-LCPS problem, first introduced by Chowdhury et al. (2014) [17], asks one to compute (the length of) a longest common palindromic subsequence between two given strings A and B. We show that the 2-LCPS problem is at least as hard as the well-studied longest common subsequence problem for four strings. Then, we present a new algorithm which solves the 2-LCPS problem in O(σM2+n) time, where n denotes the length of A and B, M denotes the number of matching positions between A and B, and σ denotes the number of distinct characters occurring in both A and B. Our new algorithm is faster than Chowdhury et al.'s sparse algorithm when σ=o(log2⁡nlog⁡log⁡n).",
author = "Shunsuke Inenaga and Heikki Hyyr{\"o}",
year = "2018",
month = "1",
day = "1",
doi = "10.1016/j.ipl.2017.08.006",
language = "English",
volume = "129",
pages = "11--15",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",

}

TY - JOUR

T1 - A hardness result and new algorithm for the longest common palindromic subsequence problem

AU - Inenaga, Shunsuke

AU - Hyyrö, Heikki

PY - 2018/1/1

Y1 - 2018/1/1

N2 - The 2-LCPS problem, first introduced by Chowdhury et al. (2014) [17], asks one to compute (the length of) a longest common palindromic subsequence between two given strings A and B. We show that the 2-LCPS problem is at least as hard as the well-studied longest common subsequence problem for four strings. Then, we present a new algorithm which solves the 2-LCPS problem in O(σM2+n) time, where n denotes the length of A and B, M denotes the number of matching positions between A and B, and σ denotes the number of distinct characters occurring in both A and B. Our new algorithm is faster than Chowdhury et al.'s sparse algorithm when σ=o(log2⁡nlog⁡log⁡n).

AB - The 2-LCPS problem, first introduced by Chowdhury et al. (2014) [17], asks one to compute (the length of) a longest common palindromic subsequence between two given strings A and B. We show that the 2-LCPS problem is at least as hard as the well-studied longest common subsequence problem for four strings. Then, we present a new algorithm which solves the 2-LCPS problem in O(σM2+n) time, where n denotes the length of A and B, M denotes the number of matching positions between A and B, and σ denotes the number of distinct characters occurring in both A and B. Our new algorithm is faster than Chowdhury et al.'s sparse algorithm when σ=o(log2⁡nlog⁡log⁡n).

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

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

U2 - 10.1016/j.ipl.2017.08.006

DO - 10.1016/j.ipl.2017.08.006

M3 - Article

VL - 129

SP - 11

EP - 15

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

ER -