Efficient computation of longest single-arm-gapped palindromes in a string

Shintaro Narisada, Diptarama Hendrian, Kazuyuki Narisawa, Shunsuke Inenaga, Ayumi Shinohara

Research output: Contribution to journalArticle

Abstract

In this paper, we introduce new types of approximate palindromes called single-arm-gapped palindromes (shortly SAGPs). A SAGP contains a gap in either its left or right arm, which is in the form of either wgucuRwR or wucuRgwR, where w and u are non-empty strings, wR and uR are respectively the reversed strings of w and u, g is a string called a gap, and c is either a single character or the empty string. Here we call wu and uRwR the arm of the SAGP, and |uv| the length of the arm. We classify SAGPs into two groups: those which have ucuR as a maximal palindrome (type-1), and the others (type-2). We propose several algorithms to compute type-1 SAGPs with longest arms occurring in a given string, based on suffix arrays. Then, we propose a linear-time algorithm to compute all type-1 SAGPs with longest arms, based on suffix trees. Also, we show how to compute type-2 SAGPs with longest arms in linear time. We also perform some preliminary experiments to show practical performances of the proposed methods.

Original languageEnglish
Pages (from-to)160-173
Number of pages14
JournalTheoretical Computer Science
Volume812
DOIs
Publication statusAccepted/In press - Jan 1 2019

Fingerprint

Palindrome
Strings
Suffix Array
Suffix Tree
Linear-time Algorithm
Experiments
Linear Time
Classify
Experiment

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Efficient computation of longest single-arm-gapped palindromes in a string. / Narisada, Shintaro; Hendrian, Diptarama; Narisawa, Kazuyuki; Inenaga, Shunsuke; Shinohara, Ayumi.

In: Theoretical Computer Science, Vol. 812, 06.04.2020, p. 160-173.

Research output: Contribution to journalArticle

Narisada, Shintaro ; Hendrian, Diptarama ; Narisawa, Kazuyuki ; Inenaga, Shunsuke ; Shinohara, Ayumi. / Efficient computation of longest single-arm-gapped palindromes in a string. In: Theoretical Computer Science. 2020 ; Vol. 812. pp. 160-173.
@article{ca58b89fb15149f4b3ed5b6c43949d8e,
title = "Efficient computation of longest single-arm-gapped palindromes in a string",
abstract = "In this paper, we introduce new types of approximate palindromes called single-arm-gapped palindromes (shortly SAGPs). A SAGP contains a gap in either its left or right arm, which is in the form of either wgucuRwR or wucuRgwR, where w and u are non-empty strings, wR and uR are respectively the reversed strings of w and u, g is a string called a gap, and c is either a single character or the empty string. Here we call wu and uRwR the arm of the SAGP, and |uv| the length of the arm. We classify SAGPs into two groups: those which have ucuR as a maximal palindrome (type-1), and the others (type-2). We propose several algorithms to compute type-1 SAGPs with longest arms occurring in a given string, based on suffix arrays. Then, we propose a linear-time algorithm to compute all type-1 SAGPs with longest arms, based on suffix trees. Also, we show how to compute type-2 SAGPs with longest arms in linear time. We also perform some preliminary experiments to show practical performances of the proposed methods.",
author = "Shintaro Narisada and Diptarama Hendrian and Kazuyuki Narisawa and Shunsuke Inenaga and Ayumi Shinohara",
year = "2019",
month = "1",
day = "1",
doi = "10.1016/j.tcs.2019.10.025",
language = "English",
volume = "812",
pages = "160--173",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",

}

TY - JOUR

T1 - Efficient computation of longest single-arm-gapped palindromes in a string

AU - Narisada, Shintaro

AU - Hendrian, Diptarama

AU - Narisawa, Kazuyuki

AU - Inenaga, Shunsuke

AU - Shinohara, Ayumi

PY - 2019/1/1

Y1 - 2019/1/1

N2 - In this paper, we introduce new types of approximate palindromes called single-arm-gapped palindromes (shortly SAGPs). A SAGP contains a gap in either its left or right arm, which is in the form of either wgucuRwR or wucuRgwR, where w and u are non-empty strings, wR and uR are respectively the reversed strings of w and u, g is a string called a gap, and c is either a single character or the empty string. Here we call wu and uRwR the arm of the SAGP, and |uv| the length of the arm. We classify SAGPs into two groups: those which have ucuR as a maximal palindrome (type-1), and the others (type-2). We propose several algorithms to compute type-1 SAGPs with longest arms occurring in a given string, based on suffix arrays. Then, we propose a linear-time algorithm to compute all type-1 SAGPs with longest arms, based on suffix trees. Also, we show how to compute type-2 SAGPs with longest arms in linear time. We also perform some preliminary experiments to show practical performances of the proposed methods.

AB - In this paper, we introduce new types of approximate palindromes called single-arm-gapped palindromes (shortly SAGPs). A SAGP contains a gap in either its left or right arm, which is in the form of either wgucuRwR or wucuRgwR, where w and u are non-empty strings, wR and uR are respectively the reversed strings of w and u, g is a string called a gap, and c is either a single character or the empty string. Here we call wu and uRwR the arm of the SAGP, and |uv| the length of the arm. We classify SAGPs into two groups: those which have ucuR as a maximal palindrome (type-1), and the others (type-2). We propose several algorithms to compute type-1 SAGPs with longest arms occurring in a given string, based on suffix arrays. Then, we propose a linear-time algorithm to compute all type-1 SAGPs with longest arms, based on suffix trees. Also, we show how to compute type-2 SAGPs with longest arms in linear time. We also perform some preliminary experiments to show practical performances of the proposed methods.

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

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

U2 - 10.1016/j.tcs.2019.10.025

DO - 10.1016/j.tcs.2019.10.025

M3 - Article

AN - SCOPUS:85074129888

VL - 812

SP - 160

EP - 173

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -