Pages that link to "Item:Q2914702"
From MaRDI portal
The following pages link to A Fast Suffix Automata Based Algorithm for Exact Online String Matching (Q2914702):
Displaying 12 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)
- Compact suffix automata representations for searching long patterns (Q2699978) (← links)
- A Very Fast String Matching Algorithm Based on Condensed Alphabets (Q2830059) (← links)
- The exact online string matching problem: a review of the most recent results (Q2875102) (← links)
- An artificial neural network based approach for online string matching/filtering of large databases (Q3563649) (← links)
- Bit-Parallel Approximate Matching of Circular Strings with <i>k</i> Mismatches (Q4577948) (← links)
- Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition (Q4629542) (← links)
- (Q5111826) (← links)
- Faster Online Elastic Degenerate String Matching (Q5140772) (← links)
- Most Recent Match Queries in On-Line Suffix Trees (Q5165611) (← links)