Pages that link to "Item:Q405577"
From MaRDI portal
The following pages link to Fast and flexible packed string matching (Q405577):
Displayed 9 items.
- Efficient string matching based on a two-step simulation of the suffix automaton (Q2117677) (← links)
- The Range Automaton: an efficient approach to text-searching (Q2140462) (← links)
- The order-preserving pattern matching problem in practice (Q2295620) (← links)
- A weak approach to suffix automata simulation for exact and approximate string matching (Q2676468) (← links)
- Compact suffix automata representations for searching long patterns (Q2699978) (← links)
- A Very Fast String Matching Algorithm Based on Condensed Alphabets (Q2830059) (← links)
- Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition (Q4629542) (← links)
- (Q5111826) (← links)
- Parallel String Matching (Q5862565) (← links)