Pages that link to "Item:Q5961970"
From MaRDI portal
The following pages link to Compressed indexes for approximate string matching (Q5961970):
Displaying 25 items.
- FM-index of alignment: a compressed index for similar strings (Q294964) (← links)
- Less space: indexing for queries with wildcards (Q300263) (← links)
- Compressed data structures for strings. On searching and extracting strings from compressed textual data (Q383835) (← links)
- Simple, compact and robust approximate string dictionary (Q405575) (← links)
- Improved space-time tradeoffs for approximate full-text indexing with one edit error (Q494804) (← links)
- Cache-oblivious index for approximate string matching (Q551183) (← links)
- Fast index for approximate string matching (Q616983) (← links)
- A linear size index for approximate pattern matching (Q655440) (← links)
- Index structures for fast similarity search for binary vectors (Q681740) (← links)
- Approximate string matching using compressed suffix arrays (Q818136) (← links)
- Improved approximate string matching using compressed suffix data structures (Q930602) (← links)
- Approximate matching of run-length compressed strings (Q1402213) (← links)
- Approximate string matching with compressed indexes (Q1662494) (← links)
- Index structures for fast similarity search for symbol strings (Q2287426) (← links)
- Compressing dictionary matching index via sparsification technique (Q2354027) (← links)
- Fast String Dictionary Lookup with One Error (Q2942250) (← links)
- Cache-Oblivious Index for Approximate String Matching (Q3506907) (← links)
- Compressed Text Indexes with Fast Locate (Q3506924) (← links)
- (Q4547735) (← links)
- (Q5005170) (← links)
- Combinatorial Pattern Matching (Q5315351) (← links)
- Developments in Language Theory (Q5473674) (← links)
- Combinatorial Pattern Matching (Q5713556) (← links)
- An approximation algorithm for alphabet indexing problem (Q6487939) (← links)
- Pattern masking for dictionary matching: theory and practice (Q6547212) (← links)