Computing maximal palindromes and distinct palindromes in a trie

Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

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

Abstract

It is known that all maximal palindromes of a given string T of length n can be computed in O(n) time by Manacher's algorithm [J. ACM '75]. Also, all distinct palindromes in T can be computed in O(n) time [Groult et al., Inf. Process. Lett. 2010]. In this paper, we consider the problem of computing maximal palindromes and distinct palindromes of a given trie T (i.e. rooted edge-labeled tree). A trie is a natural generalization of a string which can be seen as a single path tree. We propose algorithms to compute all maximal palindromes and all distinct palindromes in T in O(N log h) time and O(N) space, where N is the number of edges in T and h is the height of T . To our knowledge these are the first sub-quadratic time solutions to these problems.

Original languageEnglish
Title of host publicationProceedings of the Prague Stringology Conference, PSC 2019
EditorsJan Holub, Jan Zdarek
PublisherPrague Stringology Club
Pages3-15
Number of pages13
ISBN (Electronic)9788001066188
Publication statusPublished - 2019
Event23rd Prague Stringology Conference, PSC 2019 - Prague, Czech Republic
Duration: Aug 26 2019Aug 28 2019

Publication series

NameProceedings of the Prague Stringology Conference, PSC 2019

Conference

Conference23rd Prague Stringology Conference, PSC 2019
CountryCzech Republic
CityPrague
Period8/26/198/28/19

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

Fingerprint Dive into the research topics of 'Computing maximal palindromes and distinct palindromes in a trie'. Together they form a unique fingerprint.

Cite this