Pages that link to "Item:Q1311385"
From MaRDI portal
The following pages link to Efficient comparison based string matching (Q1311385):
Displaying 13 items.
- Tight bounds on the complexity of the Apostolico-Giancarlo algorithm (Q287179) (← links)
- Efficient string-matching allowing for non-overlapping inversions (Q390885) (← links)
- 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)
- Exact bounds on the complexity of sequential string matching algorithms (Q1326953) (← links)
- Saving comparisons in the Crochemore-Perrin string-matching algorithm (Q1365685) (← links)
- The wide window string matching algorithm (Q1770398) (← links)
- String matching under a general matching relation (Q1900318) (← links)
- Modulated string searching (Q2437743) (← links)
- On the Exact Complexity of String Matching: Lower Bounds (Q3985805) (← links)
- (Q4207596) (← links)
- Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition (Q4629542) (← links)