Diverse palindromic factorization is NP-complete

Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piątkowski, Simon J. Puglisi, Shiho Sugimoto

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

We prove that it is NP-complete to decide whether a given string can be factored into palindromes that are each unique in the factorization.

Original languageEnglish
Title of host publicationDevelopments in Language Theory - 19th International Conference, DLT 2015, Proceedings
EditorsIgor Potapov
PublisherSpringer Verlag
Pages85-96
Number of pages12
ISBN (Print)9783319214993
DOIs
Publication statusPublished - Jan 1 2015
Event19th International Conference on Developments in Language Theory, DLT 2015 - Liverpool, United Kingdom
Duration: Jul 27 2015Jul 30 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9168
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other19th International Conference on Developments in Language Theory, DLT 2015
CountryUnited Kingdom
CityLiverpool
Period7/27/157/30/15

Fingerprint

Palindrome
Factorization
NP-complete problem
Strings

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Bannai, H., Gagie, T., Inenaga, S., Kärkkäinen, J., Kempa, D., Piątkowski, M., ... Sugimoto, S. (2015). Diverse palindromic factorization is NP-complete. In I. Potapov (Ed.), Developments in Language Theory - 19th International Conference, DLT 2015, Proceedings (pp. 85-96). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9168). Springer Verlag. https://doi.org/10.1007/978-3-319-21500-6_6

Diverse palindromic factorization is NP-complete. / Bannai, Hideo; Gagie, Travis; Inenaga, Shunsuke; Kärkkäinen, Juha; Kempa, Dominik; Piątkowski, Marcin; Puglisi, Simon J.; Sugimoto, Shiho.

Developments in Language Theory - 19th International Conference, DLT 2015, Proceedings. ed. / Igor Potapov. Springer Verlag, 2015. p. 85-96 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9168).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bannai, H, Gagie, T, Inenaga, S, Kärkkäinen, J, Kempa, D, Piątkowski, M, Puglisi, SJ & Sugimoto, S 2015, Diverse palindromic factorization is NP-complete. in I Potapov (ed.), Developments in Language Theory - 19th International Conference, DLT 2015, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9168, Springer Verlag, pp. 85-96, 19th International Conference on Developments in Language Theory, DLT 2015, Liverpool, United Kingdom, 7/27/15. https://doi.org/10.1007/978-3-319-21500-6_6
Bannai H, Gagie T, Inenaga S, Kärkkäinen J, Kempa D, Piątkowski M et al. Diverse palindromic factorization is NP-complete. In Potapov I, editor, Developments in Language Theory - 19th International Conference, DLT 2015, Proceedings. Springer Verlag. 2015. p. 85-96. (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-21500-6_6
Bannai, Hideo ; Gagie, Travis ; Inenaga, Shunsuke ; Kärkkäinen, Juha ; Kempa, Dominik ; Piątkowski, Marcin ; Puglisi, Simon J. ; Sugimoto, Shiho. / Diverse palindromic factorization is NP-complete. Developments in Language Theory - 19th International Conference, DLT 2015, Proceedings. editor / Igor Potapov. Springer Verlag, 2015. pp. 85-96 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{4f6e0b1a13784c5a86cc225af467f61c,
title = "Diverse palindromic factorization is NP-complete",
abstract = "We prove that it is NP-complete to decide whether a given string can be factored into palindromes that are each unique in the factorization.",
author = "Hideo Bannai and Travis Gagie and Shunsuke Inenaga and Juha K{\"a}rkk{\"a}inen and Dominik Kempa and Marcin Piątkowski and Puglisi, {Simon J.} and Shiho Sugimoto",
year = "2015",
month = "1",
day = "1",
doi = "10.1007/978-3-319-21500-6_6",
language = "English",
isbn = "9783319214993",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "85--96",
editor = "Igor Potapov",
booktitle = "Developments in Language Theory - 19th International Conference, DLT 2015, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Diverse palindromic factorization is NP-complete

AU - Bannai, Hideo

AU - Gagie, Travis

AU - Inenaga, Shunsuke

AU - Kärkkäinen, Juha

AU - Kempa, Dominik

AU - Piątkowski, Marcin

AU - Puglisi, Simon J.

AU - Sugimoto, Shiho

PY - 2015/1/1

Y1 - 2015/1/1

N2 - We prove that it is NP-complete to decide whether a given string can be factored into palindromes that are each unique in the factorization.

AB - We prove that it is NP-complete to decide whether a given string can be factored into palindromes that are each unique in the factorization.

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

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

U2 - 10.1007/978-3-319-21500-6_6

DO - 10.1007/978-3-319-21500-6_6

M3 - Conference contribution

AN - SCOPUS:84947093056

SN - 9783319214993

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

SP - 85

EP - 96

BT - Developments in Language Theory - 19th International Conference, DLT 2015, Proceedings

A2 - Potapov, Igor

PB - Springer Verlag

ER -