Online and dynamic recognition of squarefree strings

Lecture Notes in Computer Science

Volumn 3618, Issue , 2005, Pages 520-531

  Jansson, Jesper ^a   Peng, Zeshan ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ONLINE SYSTEMS; PROBLEM SOLVING;

DYNAMIC RECOGNITION; SQUAREFREE STRINGS;

CHARACTER RECOGNITION;

EID: 26844524061     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11549345_45     Document Type: Conference Paper

References (19)

1. A. Apostolico and F. P. Preparata. Optimal off-line detection of repetitions in a string. Theoretical Computer Science, 22(3):297-315, 1983.
2. D. R. Bean, A. Ehrenfeucht, and G. F. McNulty. Avoidable patterns in strings of symbols. Pacific Journal of Mathematics, 85(2):261-294, 1979.
3. G. Benson. Tandem repeats finder: A program to analyze DNA sequences. Nucleic Acids Research, 27(2):573-580, 1999.
4. D. Breslauer. Efficient String Algorithmics. PhD thesis, Columbia University, 1992.
5. A. T. Castelo, W. Martins, and G. R. Gao. TROLL - tandem repeat occurrence locator. Bioinformatics, 18(4):634-636, 2002.
6. C. Choffrut and J. Karhumäki. Combinatorics of words. In A. Salomaa and G. Rozenberg, editors, Handbook of Formal Languages, volume 1, pages 329-438. Springer-Verlag, 1997.
7. M. Crochemore. An optimal algorithm for computing the repetitions in a word. Information Processing Letters, 12(5):244-250, 1981.
8. M. Crochemore. Transducers and repetitions. Theoretical Computer Science, 45:63-86, 1986.
9. M. Crochemore and W. Rytter. Jewels of Stringology. World Scientific Publishing, 2002.
10. M. Farach-Colton, P. Ferragina, and S. Muthukrishnan. On the sorting-complexity of suffix tree construction. Journal of the ACM, 47(6):987-1011, 2000.
11. D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, New York, 1997.
12. th International Conference on Implementation and Application of Automata (CIAA 2003), volume 2759 of LNCS, pages 3-10. Springer, 2003.
13. V. Kumar. Algorithms for constraint satisfaction problems: A survey. AI Magazine, 12(1):32-44, 1992.
14. th Australian Joint Conference on Artificial Intelligence, pages 191-202, 1998.
15. th International Computing and Combinatorics Conference (COCOON 2004), volume 3106 of LNCS, pages 432-439. Springer, 2004.
16. M. G. Main, W. Bucher, and D. Haussler. Applications of an infinite square-free co-CFL. Theoretical Computer Science, 49(2-3): 113-119, 1987.
17. M. G. Main and R. J. Lorentz. An O(n log n) algorithm for finding all repetitions in a string. Journal of Algorithms, 5(3):422-432, 1984.
18. 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 F 12 of NATO ASI Series, pages 271-278. Springer-Verlag, 1985.
19. th IEEE International Conference on Tools with Artificial Intelligence, pages 184-191, 1998.