Pages that link to "Item:Q1662494"
From MaRDI portal
The following pages link to Approximate string matching with compressed indexes (Q1662494):
Displaying 16 items.
- Approximate string matching using a bidirectional index (Q294959) (← links)
- FM-index of alignment: a compressed index for similar strings (Q294964) (← links)
- On compressing permutations and adaptive sorting (Q391981) (← links)
- Simple, compact and robust approximate string dictionary (Q405575) (← links)
- Efficient fully-compressed sequence representations (Q472482) (← links)
- Approximate matching of run-length compressed strings (Q1402213) (← links)
- Summarized bit batch-based triangle listing in massive graphs (Q2195476) (← links)
- Binary jumbled string matching for highly run-length compressible texts (Q2444848) (← links)
- Fast relative Lempel-Ziv self-index for similar sequences (Q2445867) (← links)
- Approximate search of short patterns with high error rates using the \(01^\ast 0\) lossless seeds (Q2628801) (← links)
- Lossless Seeds for Searching Short Patterns with High Error Rates (Q2946072) (← links)
- Hybrid indexes for repetitive datasets (Q2955636) (← links)
- Cache-Oblivious Index for Approximate String Matching (Q3506907) (← links)
- (Q4547735) (← links)
- (Q5088898) (← links)
- Approximate String Matching Using a Bidirectional Index (Q5165608) (← links)