Pages that link to "Item:Q3575255"
From MaRDI portal
The following pages link to A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach (Q3575255):
Displaying 7 items.
- Fast and flexible packed string matching (Q405577) (← links)
- Efficient string matching based on a two-step simulation of the suffix automaton (Q2117677) (← links)
- Compact suffix automata representations for searching long patterns (Q2699978) (← links)
- A Fast Suffix Automata Based Algorithm for Exact Online String Matching (Q2914702) (← links)
- Run-Length Encoded Nondeterministic KMP and Suffix Automata (Q2947413) (← links)
- Bit-Parallel Approximate Matching of Circular Strings with <i>k</i> Mismatches (Q4577948) (← links)
- Parallel String Matching (Q5862565) (← links)