Finding Distinct Subpalindromes Online
Abstract
We exhibit an online algorithm finding all distinct palindromes inside a given string in time (n||) over an ordered alphabet and in time (n||) over an unordered alphabet. Using a reduction from a dictionary-like data structure, we prove the optimality of this algorithm in the comparison-based computation model.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.