A (3(1+ε)n + o(n))-bit representation of maximal palindromes with O(1) query time, O(n) construction, and an O(n)-bit application for longest palindromes in arbitrary factors.
Searching for gapped palindromes.Theor
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Almost succinct representation of maximal palindromes
A (3(1+ε)n + o(n))-bit representation of maximal palindromes with O(1) query time, O(n) construction, and an O(n)-bit application for longest palindromes in arbitrary factors.