References
Apostolico, A., Szpanowski, W. (1992).Self-alignments in words and their applications Journal of Algorithms, 13, pp. 446-67.
Baker, B. (1993) A theory of parameterized pattern matching: Algorithms and applications (Extended Abstract) Proceedings 25th ACM Symposium on Theory of Computing, 1993, pp. 71-80
Baker, B. (1997) Parameterized Duplications in Strings: algorithms and an Application to Software Maintenance SIAM J. Computing 25(6), October 1997. pp. 1343-1352
Chang, W.I. & Lawler, E.L.(1990) Approximate string matching in sublinear expected time Proc. Of 31st Symposium on Foundations of Computer Science, pp. 116-124.
Manber U. & Myers, E.W. (1993) Suffix arrays: A new method for on-line string Searches SIAM Journal on Computing (October 1993), pp. 935-948
McCreight, E.M. (1976). A space-economical suffix tree construction algorithm Journal of the ACM, 23, 2, pp. 262-272, April 1976.
Stephen, G. (1994) String Searching Algorithms London: World Scientific Press.