Fast index for approximate string matching
From MaRDI portal
Publication:616983
DOI10.1016/J.JDA.2010.08.002zbMATH Open1207.68322OpenAlexW1971349783MaRDI QIDQ616983FDOQ616983
Authors: Dekel Tsur 
Publication date: 20 January 2011
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2010.08.002
Recommendations
Cites Work
- Dictionary matching and indexing with errors and don't cares
- Text Indexing and Dictionary Matching with One Error
- Title not available (Why is that?)
- Algorithms and Computation
- A metric index for approximate string matching
- Languages with mismatches
- Title not available (Why is that?)
- Combinatorial Pattern Matching
- A Linear Size Index for Approximate Pattern Matching
- Combinatorial Pattern Matching
Cited In (14)
- Approximate String Matching Using a Bidirectional Index
- Simple, compact and robust approximate string dictionary
- Streaming dictionary matching with mismatches
- Fast string matching with k differences
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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 that?)
- String indexing for top-\(k\) close consecutive occurrences
- String indexing for patterns with wildcards
- Fast String Dictionary Lookup with One Error
- Orthogonal Range Searching for Text Indexing
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)
