Algorithms for all maximal palindromes with wildcards and k-mismatches, including linear-space methods and time-memory tradeoffs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
On Time-Memory Tradeoffs for Maximal Palindromes with Wildcards and $k$-Mismatches
Algorithms for all maximal palindromes with wildcards and k-mismatches, including linear-space methods and time-memory tradeoffs.