Fast index for approximate string matching
From MaRDI portal
Publication:616983
DOI10.1016/J.JDA.2010.08.002zbMATH Open1207.68322OpenAlexW1971349783MaRDI QIDQ616983FDOQ616983
Recommendations
Cites Work
- scientific article; zbMATH DE number 1670652 (Why is no real title available?)
- scientific article; zbMATH DE number 2011852 (Why is no real title available?)
- A Linear Size Index for Approximate Pattern Matching
- A metric index for approximate string matching
- Algorithms and Computation
- Combinatorial Pattern Matching
- Combinatorial Pattern Matching
- Dictionary matching and indexing with errors and don't cares
- Languages with mismatches
- Text Indexing and Dictionary Matching with One Error
Cited In (16)
- Approximate String Matching Using a Bidirectional Index
- Simple, compact and robust approximate string dictionary
- Fast and simple computations using prefix tables under Hamming and edit distance
- Streaming dictionary matching with mismatches
- Fast string matching with k differences
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Fast approximate matching of words against a dictionary
- Cache-Oblivious Index for Approximate String Matching
- A metric index for approximate string matching
- Title not available (Why is no real title available?)
- String indexing for top-\(k\) close consecutive occurrences
- Fast string dictionary lookup with one error
- Orthogonal range searching for text indexing
- Hashing and indexing: succinct data structures and smoothed analysis
- A simple grammar-based index for finding approximately longest common substrings
This page was built for publication: Fast index for approximate string matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q616983)
