Pages that link to "Item:Q3718165"
From MaRDI portal
The following pages link to The Boyer–Moore–Galil String Searching Strategies Revisited (Q3718165):
Displaying 22 items.
- Tight bounds on the complexity of the Apostolico-Giancarlo algorithm (Q287179) (← links)
- How the character comparison order shapes the shift function of on-line pattern matching algorithms (Q671355) (← links)
- On the size of Boyer-Moore automata (Q732040) (← links)
- Light-based string matching (Q835975) (← links)
- A unifying look at the Apostolico--Giancarlo string-matching algorithm (Q876692) (← links)
- String matching with weighted errors (Q909451) (← links)
- Periodicity and repetitions in parameterized strings (Q947077) (← links)
- Structural properties of the string statistics problem (Q1076522) (← links)
- Parallel construction of a suffix tree with applications (Q1104104) (← links)
- A variation on the Boyer-Moore algorithm (Q1190458) (← links)
- Speeding up two string-matching algorithms (Q1336956) (← links)
- On Boyer-Moore automata (Q1336957) (← links)
- Saving comparisons in the Crochemore-Perrin string-matching algorithm (Q1365685) (← links)
- A faster quick search algorithm (Q1736618) (← links)
- On the string matching with \(k\) mismatches (Q1743717) (← links)
- On algorithms that effectively distinguish gradient-like dynamics on surfaces (Q2283194) (← links)
- On-line string matching algorithms: survey and experimental results (Q2720122) (← links)
- ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS (Q2909200) (← links)
- (Q3143774) (← links)
- Periodicity and Repetitions in Parameterized Strings (Q3439251) (← links)
- A New String Matching Algorithm (Q4449514) (← links)
- Speeding up two string-matching algorithms (Q5096813) (← links)
