1. A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. A. Apostolico (1992) “Fast Parallel Detection of Squares in Strings,” Algorithmica, Vol. 8, pp. 285–319.
3. S. K. Kannan and E. W. Myers (1993) “An algorithm for locating nonoverlapping regions of maximum alignment score,” these proceedings.
4. V. I. Levenshtein (1966) “Binary Codes Capable of Correcting Deletions, Insertions and Reversals,” Soviet Phys. Dokl, Vol. 10, pp. 707–710.
5. G.M. Landau and U. Vishkin (1988) “Fast string matching with k differences,” JCSS, Vol. 37, No. 1, pp. 63–78.