1. AHO, A. V. (1990): Algorithms for finding patterns in strings. In: J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Volume A, Algorithms and Complexity. Elsevier Sci., Amsterdam, 255–300.
2. AHO, A. V., and CORASICK, M. J. (1975): Efficient string matching: an aid to bibliographic search. Communications of the ACM, 18(6), 333–340.
3. AHO, A. V., HIRSCHBERG, D. S., and ULLMAN, J. D. (1976): Bounds on the complexity of the longest common subsequence problem. Journal of the Association for Computing Machinery, 23(1), 112.
4. ALTSCHUL, S. F. (1989): Gap costs for multiple sequence alignment. Journal of Theoretical Biology, 138(3), 297–309.
5. ALTSCHUL, S. F. (1991): Amino acid substitution matrices from an information theoretic perspective. Journal of Molecular Biology, 219(3), 555–565.