A new indexing method for approximate string matching
From MaRDI portal
Recommendations
Cited in
(26)- A new method for approximate indexing and dictionary lookup with one error
- Database indexing for large DNA and protein sequence collections
- String indexing for top-\(k\) close consecutive occurrences
- Efficient generation of super condensed neighborhoods
- Indexing text with approximate \(q\)-grams
- Indexing text with approximate \(q\)-grams
- Approximate string matching using a bidirectional index
- A metric index for approximate string matching
- Approximate word sequence matching on an inverted file index
- Cache-Oblivious Index for Approximate String Matching
- A new filtration method and a hybrid strategy for approximate string matching
- Indexing structures for approximate string matching
- Reversing the Error-Correction Scheme for a Fault-Tolerant Indexing
- Boosting the Quality of Approximate String Matching by Synonyms
- Sufficient conditions for efficient indexing under different matchings
- Approximate String Matching Using a Bidirectional Index
- A Linear Size Index for Approximate Pattern Matching
- String Processing and Information Retrieval
- Indexing methods for approximate dictionary searching, comparative analysis
- An efficient algorithm for generating super condensed neighborhoods
- Compressed indexes for approximate string matching
- Fast index for approximate string matching
- An approximation algorithm for alphabet indexing problem
- Approximate string matching using compressed suffix arrays
- A metric index for approximate string matching
- Improved approximate string matching using compressed suffix data structures
This page was built for publication: A new indexing method for approximate string matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3024807)
