An efficient online algorithm for square detection

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3106, Issue , 2004, Pages 432-439

  Leung, Ho Fung ^a   Peng, Zeshan ^b   Ting, Hing Fung ^b  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; DATA COMPRESSION; SOCIAL NETWORKING (ONLINE);

INPUT STRING; OFF-LINE ALGORITHM; ON-LINE ALGORITHMS; SUB-STRINGS; TIME COMPLEXITY;

ALGORITHMS;

EID: 35048876784     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27798-9_46     Document Type: Article

References (11)

1. A. Apostolico and D. Breslauer. An optimal O(log log n)-time parallel algorithm for detecting squares in a string. SIAM Journal on Computing, 25(6):1318-1331, 1996.
2. A. Apostolico and E.P. Preparata. Optimal off-line detection of repetitions in a string. Theoretical Computer Science, 22:297-315, 1983.
3. M. Crochemore. An optimal algorithm for computing the repetitions in a word. Information Processing Letters, 12(5):244-250, 1981.
4. M. Crochemore, W. Rytter, and R. Crochemore. Text Algorithms. Oxford University Press, 1994.
5. D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, 1997.
6. J.H.M. Lee, H.F. Leung, and H.W. Won. Extending genet for non-binary constraint satisfaction problems. In Proceedings of the 7th International Conference on Tools with Artificial Intelligence, pages 338-343, 1995.
7. J.H.M. Lee, H.F. Leung, and H.W. Won. Performance of a comprehensive and efficient constraint library based on local search. In Proceedings of the 11th Australian Join Conference on Artifical Intelligence , pages 13-17, 1998.
8. M.G. Main and R.J. Lorentz. An O(n log n) algorithm for finding all repetitions in a string. Journal of Algorithms, 5:422-432, 1984.
9. M.G. Main and R.J. Lorentz. Linear time recognition of squarefree strings. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, volume F12 of NATO ASI Series, pages 271-278. Springer-Verlag, Berlin Heidelberg, 1985.
10. M.O. Rabin. Discovering repetitions in strings. Combinatorial Algorithms on Words, pages 279-288, 1985.
11. J.H.Y. Wong and H.F. Leung. Solving fuzzy constraint satisfaction problems with fuzzy genet. In Proceedings of the 10th IEEE International Conference on Tools with Artificial Intelligence, pages 180-191, 1998.