The following pages link to (Q4661875):
Displaying 7 items.
- Average complexity of backward \(q\)-gram string matching algorithms (Q436556) (← links)
- Approximate string matching using compressed suffix arrays (Q818136) (← links)
- Approximate string matching with compressed indexes (Q1662494) (← links)
- Average-case linear-time similar substring searching by the \(q\)-gram distance (Q2440164) (← links)
- On-Line Approximate String Searching Algorithms: Survey and Experimental Results (Q4551538) (← links)
- Multiple approximate string matching (Q5096936) (← links)
- On using q-gram locations in approximate string matching (Q6102311) (← links)