The following pages link to Average-optimal string matching (Q1044048):
Displaying 11 items.
- Average complexity of backward \(q\)-gram string matching algorithms (Q436556) (← links)
- BLIM: A new bit-parallel pattern matching algorithm overcoming computer word size limitation (Q626897) (← links)
- A faster quick search algorithm (Q1736618) (← links)
- Run-Length Encoded Nondeterministic KMP and Suffix Automata (Q2947413) (← links)
- Fast circular dictionary-matching algorithm (Q2971059) (← links)
- Searching and Indexing Circular Patterns (Q3305518) (← links)
- (Q3581624) (← links)
- Simple Optimal String Matching Algorithm (Q4500860) (← links)
- Quasi-Linear-Time Algorithm for Longest Common Circular Factor (Q5088916) (← links)
- Multi-pattern matching algorithm with wildcards based on bit-parallelism (Q5371909) (← links)
- Average-optimal single and multiple approximate string matching (Q5463450) (← links)