Computing longest single-arm-gapped palindromes in a string

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

研究成果: 著書/レポートタイプへの貢献会議での発言

3 引用 (Scopus)

抄録

We introduce new types of approximate palindromes called single-arm-gapped palindromes (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 their reversed strings respectively, g is a gap, and c is either a single character or the empty string. 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 all type-1 SAGPs with longest arms occurring in a given string using suffix arrays, and them a linear-time algorithm based on suffix trees. We also show how to compute type-2 SAGPs with longest arms in linear time. We perform some preliminary experiments to evaluate practical performances of the proposed methods.

元の言語英語
ホスト出版物のタイトルSOFSEM 2017
ホスト出版物のサブタイトルTheory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings
編集者Christel Baier, Mark van den Brand, Johann Eder, Mike Hinchey, Tiziana Margaria, Bernhard Steffen
出版者Springer Verlag
ページ375-386
ページ数12
ISBN(印刷物)9783319519623
DOI
出版物ステータス出版済み - 1 1 2017
イベント43rd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2017 - Limerick, アイルランド
継続期間: 1 16 20171 20 2017

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
10139 LNCS
ISSN(印刷物)0302-9743
ISSN(電子版)1611-3349

その他

その他43rd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2017
アイルランド
Limerick
期間1/16/171/20/17

Fingerprint

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

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

これを引用

Narisada, S., Diptarama, Narisawa, K., Inenaga, S., & Shinohara, A. (2017). Computing longest single-arm-gapped palindromes in a string. : C. Baier, M. van den Brand, J. Eder, M. Hinchey, T. Margaria, & B. Steffen (版), SOFSEM 2017: Theory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings (pp. 375-386). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 10139 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-51963-0_29

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

SOFSEM 2017: Theory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. 版 / Christel Baier; Mark van den Brand; Johann Eder; Mike Hinchey; Tiziana Margaria; Bernhard Steffen. Springer Verlag, 2017. p. 375-386 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻 10139 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Narisada, S, Diptarama, Narisawa, K, Inenaga, S & Shinohara, A 2017, Computing longest single-arm-gapped palindromes in a string. : C Baier, M van den Brand, J Eder, M Hinchey, T Margaria & B Steffen (版), SOFSEM 2017: Theory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 巻. 10139 LNCS, Springer Verlag, pp. 375-386, 43rd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2017, Limerick, アイルランド, 1/16/17. https://doi.org/10.1007/978-3-319-51963-0_29
Narisada S, Diptarama, Narisawa K, Inenaga S, Shinohara A. Computing longest single-arm-gapped palindromes in a string. : Baier C, van den Brand M, Eder J, Hinchey M, Margaria T, Steffen B, 編集者, SOFSEM 2017: Theory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. Springer Verlag. 2017. p. 375-386. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-51963-0_29
Narisada, Shintaro ; Diptarama ; Narisawa, Kazuyuki ; Inenaga, Shunsuke ; Shinohara, Ayumi. / Computing longest single-arm-gapped palindromes in a string. SOFSEM 2017: Theory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. 編集者 / Christel Baier ; Mark van den Brand ; Johann Eder ; Mike Hinchey ; Tiziana Margaria ; Bernhard Steffen. Springer Verlag, 2017. pp. 375-386 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{3f258ac3f42b4f31927ca6b1097a9df9,
title = "Computing longest single-arm-gapped palindromes in a string",
abstract = "We introduce new types of approximate palindromes called single-arm-gapped palindromes (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 their reversed strings respectively, g is a gap, and c is either a single character or the empty string. 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 all type-1 SAGPs with longest arms occurring in a given string using suffix arrays, and them a linear-time algorithm based on suffix trees. We also show how to compute type-2 SAGPs with longest arms in linear time. We perform some preliminary experiments to evaluate practical performances of the proposed methods.",
author = "Shintaro Narisada and Diptarama and Kazuyuki Narisawa and Shunsuke Inenaga and Ayumi Shinohara",
year = "2017",
month = "1",
day = "1",
doi = "10.1007/978-3-319-51963-0_29",
language = "English",
isbn = "9783319519623",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "375--386",
editor = "Christel Baier and {van den Brand}, Mark and Johann Eder and Mike Hinchey and Tiziana Margaria and Bernhard Steffen",
booktitle = "SOFSEM 2017",
address = "Germany",

}

TY - GEN

T1 - Computing longest single-arm-gapped palindromes in a string

AU - Narisada, Shintaro

AU - Diptarama,

AU - Narisawa, Kazuyuki

AU - Inenaga, Shunsuke

AU - Shinohara, Ayumi

PY - 2017/1/1

Y1 - 2017/1/1

N2 - We introduce new types of approximate palindromes called single-arm-gapped palindromes (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 their reversed strings respectively, g is a gap, and c is either a single character or the empty string. 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 all type-1 SAGPs with longest arms occurring in a given string using suffix arrays, and them a linear-time algorithm based on suffix trees. We also show how to compute type-2 SAGPs with longest arms in linear time. We perform some preliminary experiments to evaluate practical performances of the proposed methods.

AB - We introduce new types of approximate palindromes called single-arm-gapped palindromes (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 their reversed strings respectively, g is a gap, and c is either a single character or the empty string. 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 all type-1 SAGPs with longest arms occurring in a given string using suffix arrays, and them a linear-time algorithm based on suffix trees. We also show how to compute type-2 SAGPs with longest arms in linear time. We perform some preliminary experiments to evaluate practical performances of the proposed methods.

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

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

U2 - 10.1007/978-3-319-51963-0_29

DO - 10.1007/978-3-319-51963-0_29

M3 - Conference contribution

SN - 9783319519623

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 375

EP - 386

BT - SOFSEM 2017

A2 - Baier, Christel

A2 - van den Brand, Mark

A2 - Eder, Johann

A2 - Hinchey, Mike

A2 - Margaria, Tiziana

A2 - Steffen, Bernhard

PB - Springer Verlag

ER -