1. Smit U. Metody i algoritmy vychislenii na strokakh. M., 2006.
2. Gonzalo Navarro // ACM Computing Surveys. 2001. Vol. 33, № 1. P. 31-88.
3. Graham A. Stephen. String Seaching Algorithms, 1994.
4. Gasfild D. Stroki, derev'ya i posledovatel'nosti v algoritmakh. SPb, 2003.
5. Hamming R.W. // The Bell System Technical Journal. 1950. Vol. XXIX, № 2. P.147-160.
6. Federal Standard 1037C, 1996.
7. Levenshtein V.I. // Dokl. Akademii Nauk SSSR. 1965. T. 163, №4. S. 845-848.
8. Masek W.J., Paterson M.S. // Journal of Computer and System Sciences. 1980. Vol. 20, № 1.
9. Ehrenfeucht A., Haussler D. // Discrete Applied Mathematics. 1988. Vol. 20, № 3. P. 191-203.
10. Ukkonen E. Approximate string-matching with q-grams and maximal matches // Theoretical Computer Science 1992. Vol. 92, № 1. P.191-211.
11. Hall P.A.V., Dowling G.R. // Computing Surveys. 1980. Vol. 12, № 4. P. 381-402.
12. Blumer A., Blumer J., Haussler D. et al. // Theoretical Computer Science. 1985. Vol. 40. P. 31-55.
13. Hirschberg D.S. // Journal of the Assoclauon for Computing Machinery. 1977. Vol. 24, № 4. P. 664-675.
14. Kormen T., Leizerson Ch., Rivest R. i dr. Algoritmy: postroenie i analiz. M., 2005.
15. Prytkov V.A., Bartashevich Yu.A., Lukashevich M.M. // Mater. V mezhd. konf.-foruma «Informatsionnye sistemy i tekhnologii». Minsk, 2009. S. 172-175.