Pages that link to "Item:Q4016906"
From MaRDI portal
The following pages link to On the Exact Complexity of String Matching: Upper Bounds (Q4016906):
Displaying 10 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)
- Light-based string matching (Q835975) (← links)
- A simple fast hybrid pattern-matching algorithm (Q925062) (← links)
- Saving comparisons in the Crochemore-Perrin string-matching algorithm (Q1365685) (← links)
- Improved pattern-scan-order algorithms for string matching (Q1784983) (← links)
- Fast string matching for DNA sequences (Q2297856) (← links)
- A New String Matching Algorithm (Q4449514) (← links)
- Sorting signed permutations by tandem duplication random loss and inverse tandem duplication random loss (Q6616297) (← links)
