Pages that link to "Item:Q846013"
From MaRDI portal
The following pages link to Fast exact string matching algorithms (Q846013):
Displaying 17 items.
- Fast and flexible packed string matching (Q405577) (← links)
- Average complexity of backward \(q\)-gram string matching algorithms (Q436556) (← links)
- String matching with lookahead (Q496556) (← links)
- Faster string matching based on hashing and bit-parallelism (Q522976) (← links)
- An aggressive algorithm for multiple string matching (Q987821) (← links)
- Improving practical exact string matching (Q990135) (← links)
- The Range Automaton: an efficient approach to text-searching (Q2140462) (← links)
- Fast string matching for DNA sequences (Q2297856) (← links)
- A weak approach to suffix automata simulation for exact and approximate string matching (Q2676468) (← links)
- A Very Fast String Matching Algorithm Based on Condensed Alphabets (Q2830059) (← links)
- ADAPTING BOYER-MOORE-LIKE ALGORITHMS FOR SEARCHING HUFFMAN ENCODED TEXTS (Q2909199) (← links)
- A Fast Suffix Automata Based Algorithm for Exact Online String Matching (Q2914702) (← links)
- EFFICIENT VARIANTS OF THE BACKWARD-ORACLE-MATCHING ALGORITHM (Q3655531) (← links)
- Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition (Q4629542) (← links)
- Boosting Pattern Matching Performance via k-bit Filtering (Q4932641) (← links)
- A Bit-Parallel Exact String Matching Algorithm for Small Alphabet (Q5321726) (← links)
- Parallel String Matching (Q5862565) (← links)
