E. M. McCreight “a Space-Economical Suffix Tree Construction Algorithm”, Apr. 1976, Journal of the Association for Computing Machinery, vol.22, 262-272.* |
R. S. Boyer “A Fast String Searching Algorithm”, Oct. 1977, Communication ACM, vol. 20, 762-772.* |
V. I. Levenstein, “Binary codes capable of correcting deletions, insertions, and reversals”, (Russian) Doklady Akademii nauk SSSR, vol. 163, No. 4, pp. 845-848 (1965). |
J. Kärkkäinen & E. Ukkonen, in “Sparse Suffix Trees”, Proceedings of the Second Annular International Computing and Combinatorics Conference (COCOON '96), Springer Verlag, pp. 219-330. |
D. R. Morrison, “PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphaneumeric”, Journal of the ACM, 15 pp. 514-534 (1968). |
H. Shang & T.H. Merrettal, “Tries for Approximate String Matching”, IEEE Transactions on Knowledge and Data Engineering, vol. 5, No. 4, pp. 540-547 (1996). |
E. Ukkonen, “Finding Approximate Patterns in Strings”, Journal of Algorithms, vol. 6, pp. 132-137 (1985). |