The following pages link to (Q4228434):
Displaying 8 items.
- How the character comparison order shapes the shift function of on-line pattern matching algorithms (Q671355) (← links)
- On Simon's string searching algorithm (Q685473) (← links)
- Tight comparison bounds for the string prefix-matching problem (Q685487) (← links)
- A simple fast hybrid pattern-matching algorithm (Q925062) (← links)
- Saving comparisons in the Crochemore-Perrin string-matching algorithm (Q1365685) (← links)
- The exact online string matching problem: a review of the most recent results (Q2875102) (← links)
- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard (Q3637111) (← links)
- (Q5874401) (← links)