A lower-variance randomized algorithm for approximate string matching
From MaRDI portal
Publication:2444913
DOI10.1016/j.ipl.2013.06.005zbMath1284.68646MaRDI QIDQ2444913
Elena Grigorescu, Mikhail J. Atallah, Yi Wu
Publication date: 11 April 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2013.06.005
Related Items
On approximate pattern matching with thresholds, An acceleration of FFT-based algorithms for the match-count problem
Cites Work
- Unnamed Item
- Unnamed Item
- Combinatorial pattern matching. 3rd annual symposium, Tucson, AZ, USA, April 29 -- May 1, 1992. Proceedings
- Fast algorithms for approximately counting mismatches
- Fast and practical approximate string matching
- Generalized String Matching
- FFT-based algorithms for the string matching with mismatches problem
- A randomized algorithm for approximate string matching