Indexing text with approximate \(q\)-grams
From MaRDI portal
Publication:2569395
DOI10.1016/j.jda.2004.08.003zbMath1101.68508MaRDI QIDQ2569395
Jorma Tarhio, Erkki Sutinen, Gonzalo Navarro
Publication date: 27 October 2005
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2004.08.003
Related Items
A metric index for approximate string matching, Lossless filter for multiple repetitions with Hamming distance, Approximate string matching with compressed indexes, Index structures for fast similarity search for symbol strings
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The smallest automaton recognizing the subwords of a text
- Faster approximate string matching
- A sublinear algorithm for approximate keyword searching
- Transducers and repetitions
- Suffix Arrays: A New Method for On-Line String Searches
- A fast bit-vector algorithm for approximate string matching based on dynamic programming
- The theory and computation of evolutionary distances: Pattern recognition