The following pages link to (Q4028869):
Displaying 10 items.
- Fast searching in packed strings (Q533408) (← links)
- An algorithm for string matching with a sequence of don't cares (Q750152) (← links)
- Average running time of the Boyer-Moore-Horspool algorithm (Q1190450) (← links)
- Fast two-dimensional pattern matching (Q1209318) (← links)
- A new regular grammar pattern matching algorithm. (Q1874408) (← links)
- Multiple filtration and approximate pattern matching (Q1902470) (← links)
- Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time (Q2380069) (← links)
- Bit-Parallel Approximate Matching of Circular Strings with <i>k</i> Mismatches (Q4577948) (← links)
- Boyer-Moore approach to approximate string matching (Q5056116) (← links)
- (Q5111826) (← links)