Fast and practical algorithms for computing all the runs in a string

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

Volumn 4580 LNCS, Issue , 2007, Pages 307-315

  Chen, Gang ^a   Puglisi, Simon J ^b   Smyth, W F ^a,b  

^a MCMASTER UNIVERSITY   (Canada)

^b CURTIN UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DATA STRUCTURES; FACTORIZATION; TREES (MATHEMATICS);

MAXIMAL PERIODICITY; SPACE-EFFICIENT ALGORITHMS; TIME SUFFIX TREE CONSTRUCTION ALGORITHM;

ALGORITHMS;

EID: 37849036343     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73437-6_31     Document Type: Conference Paper

References (33)

1. Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. J. Discrete Algs. 2, 53-86 (2004)
2. Apostolico, A., Preparata, F.P.: Optimal off-line detection of repetitions in a string. Theoret. comput. sci. 22, 297-315 (1983)
3. Crochemore, M.: An optimal algorithm for computing the repetitions in a word. Inform, process, lett. 12(5), 244-250 (1981)
4. Fan, K., Puglisi, S.J., Smyth, W.F., Turpin, A.: A new periodicity lemma. SIAM J. Discrete Math. 20(3), 656-668 (2006)
5. th FOCS pp. 137-143 (1997)
6. Franek, F., Holub, J., Smyth, W.F., Xiao, X.: Computing quasi suffix arrays. J. Automata, Languages & Combinatorics 8(4), 593-606 (2003)
7. th AWOCA, pp. 26-35 (2003)
8. Grossi, R., Vitter, J.S.: Compressed suffix arrays and suffix trees with applications to text indexing & string matching. SIAM J. Computing 35(2), 378-407 (2005)
9. th ICALP. pp. 943-955 (2003)
10. Karlin, S., Ghandour, G., Ost, F., Tavare, S., Korn, L.J.: New approaches for computer analysis of nucleic acid sequences. Proc. Natl. Acad. Sci. USA 80, 5660-5664 (1983)
11. Kasai, T., Lee, C., Arimura, H., Arikawa, S., Park, K.: Linear-time longest-common-prefix computation in suffix arrays and its applications. In: Amir, A., Landau, C.M. (eds.) CPM 2001. LNCS, vol. 2089, Springer, Heidelberg (2001)
12. Ko, P., Aluru, S.: Space efficient linear time construction of suffix arrays. In: Baeza-Yates, R.A., Chavez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, Springer, Heidelberg (2003)
13. Kolpakov, R., Kucherov, G.: http://bioinfo.lifl.fr/mreps/
14. Kolpakov, R., Kucherov, G.: On maximal repetitions in words. J. Discrete Algs. 1, 159-186 (2000)
15. Kurtz, S.: Reducing the space requirement of suffix trees. Software Practice & Experience 29(13), 1149-1171 (1999)
16. Lempel, A., Ziv, J.: On the complexity of finite sequences. IEEE Trans. Information Theory 22, 75-81 (1976)
17. Lentin, A., Schützenberger, M.P.: A combinatorial problem in the theory of free monoids, Combinatorial Mathematics & Its Applications. In: Bose, R.C., Dowling, T.A. (eds.) University of North Carolina Press, pp. 128-144 (1969)
18. Main, M.G.: Detecting leftmost maximal periodicities. Discrete Applied Maths 25, 145-153 (1989)
19. Main, M.G., Lorentz, R.J.: An O(n log n) Algorithm for Recognizing Repetition, Tech. Rep. CS-79-056, Computer Science Department, Washington State University (1979)
20. Main, M.G., Lorentz, R.J.: An O(nlog n) algorithm for finding all repetitions in a string. J. Algs. 5, 422-432 (1984)
21. Mäkinen, V., Navarro, G.: Compressed full-text indices, ACM Computing Surveys (to appear)
22. th AWOCA pp. 16-29 (2006)
23. Manzini, G.: Two space-saving tricks for linear time LCP computation. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, Springer, Heidelberg (2004)
24. Manzini, G., Ferragina, P.: Engineering a lightweight suffix array construction algorithm. Algorithmica 40, 33-50 (2004)
25. McCreight, E.M.: A space-economical suffix tree construction algorithm. J. Assoc. Comput. Mach. 32(2), 262-272 (1976)
26. Puglisi, S.J., Smyth, W.F., Turpin, A.: A taxonomy of suffix array construction algorithms, ACM Computing Surveys (to appear)
27. rd STACS. LNCS, vol. 2884, pp. 184-195. Springer, Heidelberg (2006)
28. Sadakane, K.: Space-efficient data structures for flexible text retrieval systems. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, Springer, Heidelberg (2002)
29. Smyth, B.: Computing Patterns in Strings, Pearson Addison-Wesley, p. 423 (2003)
30. Thue, A.: Über unendliche zeichenreihen. Norské Vid. Selsk. Skr. I. Mat. Nat. Kl. Christiana 7, 1-22 (1906)
31. Ukkonen, E.: On-line construction of suffix trees. Algorithmica 14, 249-260 (1995)
32. Weiner, P.: Linear pattern matching algorithms. In: Proc. 14th Annual IEEE Symp. Switching & Automata Theory, pp. 1-11 (1973)
33. Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Information Theory 23, 337-343 (1977)