Pages that link to "Item:Q3149893"
From MaRDI portal
The following pages link to Approximate String Matching: A Simpler Faster Algorithm (Q3149893):
Displaying 14 items.
- Longest common extensions in trees (Q294947) (← links)
- A practical semi-external memory method for approximate pattern matching (Q529654) (← links)
- Faster approximate string matching for short patterns (Q692899) (← links)
- String indexing for patterns with wildcards (Q2254487) (← links)
- Approximate pattern matching in LZ77-compressed texts (Q2343301) (← links)
- Towards optimal packed string matching (Q2437754) (← links)
- Time-space trade-offs for longest common extensions (Q2442815) (← links)
- Optimal spaced seeds for faster approximate string matching (Q2643727) (← links)
- Time-Space Trade-Offs for Longest Common Extensions (Q2904502) (← links)
- Longest Common Extensions in Trees (Q2942245) (← links)
- Longest Common Extensions in Sublinear Space (Q2942246) (← links)
- Random Access to Grammar-Compressed Strings and Trees (Q5255003) (← links)
- ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES (Q5484909) (← links)
- Elastic-degenerate string matching with 1 error (Q6163960) (← links)
