Compressed Indexes for Approximate String Matching
From MaRDI portal
Recommendations
Cited in
(19)- Approximate matching of run-length compressed strings
- Approximate string matching with compressed indexes
- Compressing dictionary matching index via sparsification technique
- FM-index of alignment: a compressed index for similar strings
- scientific article; zbMATH DE number 2185640 (Why is no real title available?)
- Cache-Oblivious Index for Approximate String Matching
- Compressed Text Indexes with Fast Locate
- Compressed data structures for strings. On searching and extracting strings from compressed textual data
- Simple, compact and robust approximate string dictionary
- scientific article; zbMATH DE number 1786446 (Why is no real title available?)
- Combinatorial Pattern Matching
- Developments in Language Theory
- Cache-oblivious index for approximate string matching
- Algorithms and Computation
- Compressed indexes for approximate string matching
- Fast index for approximate string matching
- A linear size index for approximate pattern matching
- Approximate string matching using compressed suffix arrays
- Improved approximate string matching using compressed suffix data structures
This page was built for publication: Compressed Indexes for Approximate String Matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5449529)