Pages that link to "Item:Q4629542"
From MaRDI portal
The following pages link to Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition (Q4629542):
Displaying 5 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)
- A weak approach to suffix automata simulation for exact and approximate string matching (Q2676468) (← links)
- Improved characters distance sampling for online and offline text searching (Q2682926) (← links)
- Compact suffix automata representations for searching long patterns (Q2699978) (← links)
