Longest palindromic substring in sublinear time

DOI10.4230/LIPICS.CPM.2022.20MaRDI QIDQ6496849zbMATH OpenFDO

Authors Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski

Publication date 6 May 2024

Full work available at URL https://doi.org/10.4230/LIPICS.CPM.2022.20

zbMATH Keywords

longest common extensionlongest palindromic substringstring algorithms

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cited in

(5)

• Combinatorics of palindromes
• Double-ended palindromic trees in linear time
• Computing string covers in sublinear time
• Longest common extensions with wildcards: trade-off and applications
• Counting distinct square substrings in sublinear time

This page was built for publication: Longest palindromic substring in sublinear time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496849)