1 |
T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, Second Ed., MIT Press and McGraw-Hill, 2001
|
2 |
J.P. Duval, Factoring words over an ordered alphabet, J. Algorithms, Vol.4, No.1, pp.363-381, 1983
DOI
|
3 |
M. Crochemore, String matching and periods, Bulletin of the EATCS, Vol.39, pp.149-153, 1989
|
4 |
M. Crochemore, String matching on ordered alphabets, Theor. Comput. Sci., Vol.92, No.1, pp.33-47, 1992
DOI
ScienceOn
|
5 |
M. Crochemore and D. Perrin, Two-way string matching, J. ACM, Vol.38, No.3, pp.651-675, 1991
DOI
|
6 |
D.E. Knuth, J.H. Morris, and V.R. Pratt, Fast pattern matchings in strings, SIAM J. Comp., Vol.6, No.2, pp.323-350, 1977
DOI
|
7 |
K. Roh, M. Crochemore, C.S. Iliopoulos, and K. Park, External Memory Algorithms for String Problems, Proceedings of the 17th Australasian Workshop on Combinatorial Algorithms, Central Australia, July 2006
|
8 |
Y. Shiloach, Fast canonization of circular strings, J. Algorithms, Vol.2, pp.107-121, 1981
DOI
|
9 |
J.S. Vitter, External memory algorithm and data structures: dealing with massive data, ACM Computing Surveys, Vol.33, No.2, pp.209-271, 2001
DOI
ScienceOn
|