Pages that link to "Item:Q3507759"
From MaRDI portal
The following pages link to Multipattern string matching with <i>q</i> -grams (Q3507759):
Displaying 5 items.
- A compact representation of nondeterministic (suffix) automata for the bit-parallel approach (Q418159) (← links)
- Average complexity of backward \(q\)-gram string matching algorithms (Q436556) (← links)
- Fast parameterized matching with \(q\)-grams (Q1018090) (← links)
- On the string matching with \(k\) mismatches (Q1743717) (← links)
- A weak approach to suffix automata simulation for exact and approximate string matching (Q2676468) (← links)
