1. Navarro, G.: A guided tour to approximate string matching (PDF). ACM Comput. Surv. 33(1), 31–88 (2001). CiteSeerX 10.1.1.452.6317.
https://doi.org/10.1145/375360.375365
2. Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. J. ACM 21(1), 168–173 (1974).
https://doi.org/10.1145/321796.321811
(Author, F.: Article title. Journal 2(5), 99–110 (2016))
3. Backurs, A., Indyk, P.: Edit distance cannot be computed in strongly subquadratic time (unless SETH is false). In: Forty-Seventh Annual ACM on Symposium on Theory of Computing (STOC) (2015).
arXiv:1412.0348
. Bibcode:2014arXiv1412.0348B
4. Abrahamson, K.: Generalized string matching. SIAM J. Comput. 16(6), 1039–1051 (1987).
https://doi.org/10.1137/0216067
5. Alstrup, S., Brodal, G.S., Rauhe, T.: Pattern matching in dynamic texts. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 819–828, 09–11 Jan 2000, San Francisco, California, USA (2000)