论文信息 - Lexicographically Least Circular Substrings - 字舞流文

Lexicographically Least Circular Substrings

Kellogg S. Booth | K. Booth

[1] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[2] Peter Weiner,et al. Linear Pattern Matching Algorithms , 1973, SWAT.

[3] Charles J. Colbourn,et al. Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs , 1981, SIAM J. Comput..

[4] Yossi Shiloach,et al. A Fast Equivalence-Checking Algorithm for Circular Lists , 1979, Inf. Process. Lett..

[5] Donald E. Knuth,et al. Fast Pattern Matching in Strings , 1977, SIAM J. Comput..