A new sampled string matching algorithm filters matches using distances between pivot characters, claiming linear worst-case and optimal average complexity with 2.8% to 11% extra space.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Efficient Online String Matching Based on Characters Distance Text Sampling
A new sampled string matching algorithm filters matches using distances between pivot characters, claiming linear worst-case and optimal average complexity with 2.8% to 11% extra space.