1. A.V. Aho and M.J. Corasick, “Efficient string matching”, C. ACM, Vol. 18, No. 6, 1975, pp. 333–340.
2. A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
3. A. Amir, “Multidimensional and Relative Approximate Pattern Matching”, UMIACS-TR-87-41, CS-TR-1912, Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, 1987.
4. AILSV-87] A. Apostolico, C. Iliopoulos, G.M. Landau, B. Schieber, and U. Vishkin, “Parallel Construction of a Suffix Tree with Applications”, Algorithmica, to appear.
5. T.P. Baker, “A Technique For Extending Rapid Exact-Match String Matching to Arrays of More Than One Dimension”, SIAM J. Comput., Vol. 7, No. 4, 1978, pp. 533–541.