Longest Palindromic Substring in Sublinear Time - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

Longest Palindromic Substring in Sublinear Time

Résumé

We revisit the classic algorithmic problem of computing a longest palidromic substring. This problem is solvable by a celebrated O(n)-time algorithm [Manacher, J. ACM 1975], where n is the length of the input string. For small alphabets, O(n) is not necessarily optimal in the word RAM model of computation: a string of length n over alphabet [0, σ) can be stored in O(n log σ/ log n) space and read in O(n log σ/ log n) time. We devise a simple O(n log σ/ log n)-time algorithm for computing a longest palindromic substring. In particular, our algorithm works in sublinear time if σ = 2 o(log n). Our technique relies on periodicity and on the O(n log σ/ log n)-time constructible data structure of Kempa and Kociumaka [STOC 2019] that answers longest common extension queries in O(1) time.
Fichier principal
Vignette du fichier
LIPIcs-CPM-2022-20.pdf (821.14 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-03829971 , version 1 (26-10-2022)

Identifiants

Citer

Panagiotis Charalampopoulos, Solon P Pissis, Jakub Radoszewski. Longest Palindromic Substring in Sublinear Time. 33rd Annual Symposium on Combinatorial Pattern Matching (CPM), 2022, Prague, Czech Republic. ⟨10.4230/LIPIcs.CPM.2022.20⟩. ⟨hal-03829971⟩
61 Consultations
67 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More