1Skiena S. The Algorithm Design Manual [M]. 2nd ed. Berlin: Springer, 2008.
2Wang Ke, Cretu G, Salvatore S J. Anomalous payload-based worm detection and signature generation [C] //Proc of Detection of Intrusions and Malware &. Vulnerability Assessment. Berlin: Springer, 2006: 227-246.
3Dan G. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology [M]. New York: Cambridge University Press, 1997.
4Matsubara W, Inenaga S, Ishino A, et al. Computing longest common substring and all palindromes from compressed strings [C] //Proc of SOFSEM2008: Theory and Practice of Computer Science. Berlin: Springer, 2008: 364- 375.
5Manber U, Myers G. Suffix arrays: A new method for online string searches [C] / /Proc of the 1 st Annual ACM-SIAM Symp on Discrete Algorithms. Philadelphia, PA: SIAM, 1990: 319-327.
6Kasai T, Lee G, Arimural H, et al. Linear-time longestcommon-prefix computation in suffix arrays and its applications [C] //Proc of Groupware: Design, Implementation. and Use. Berlin: Springer, 2002: 181-192.
7Babenko M. Starikovskaya T. Computing longest common substrings via suffix arrays [C] //Proc of Computer ScienceTheory and Applications. Berlin: Springer, 2008: 64-75.
9Michael M. Puglisi S J. Faster lightweight suffix array construction [C] //Proc of the 17th Australasian Workshop on Combinatorial Algorithmst A WOCA). Ballarat: School of Information Technology &. Mathematical Sciences, University of Ballarat. 2006: 16-19.
10Nong Ge , Zhang Sen. Chan Waihong. Two efficient algorithms for linear time suffix array construction [J]. IEEE Trans on Computers. 2010. 60(0): 1471-1484.
