Algorithms for all maximal palindromes with wildcards and k-mismatches, including linear-space methods and time-memory tradeoffs.
Verifying candidate matches in sparse and wildcard matching
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
The authors give an Õ(n + √(wt))-time algorithm for Subset Sum.
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.
-
An Improved Pseudopolynomial Time Algorithm for Subset Sum
The authors give an Õ(n + √(wt))-time algorithm for Subset Sum.