Fast optimal algorithms for computing all the repeats in a string

Proceedings of the Prague Stringology Conference 2008

Volumn , Issue , 2008, Pages 161-169

  Puglisi, Simon J ^a   Smyth, William F ^b,c   Yusufu, Munina ^b  

^a RMIT UNIVERSITY   (Australia)

^b MCMASTER UNIVERSITY   (Canada)

^c CURTIN UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALPHABET SIZE; FAST ALGORITHMS; OPTIMAL ALGORITHM; SUFFIX ARRAYS;

BIOINFORMATICS; DATA COMPRESSION;

ALGORITHMS;

EID: 70449105322     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. M. I. Abouelhoda, S. Kurtz, and E. Ohlebusch: Replacing suffix trees with enhanced suffix arrays. Journal of Discrete Algorithms, 2(1) 2004, pp. 53-86.
2. A. Apostolico and S. Lonardi: Off-line compression by greedy textual substitution. Proceedings of the IEEE, 88(11) 2000, pp. 1733-1744.
3. Y. Berstein and J. Zobel: Accurate discovery of co-derivative documents via duplicate text detection. Information Systems, 31 2006, pp. 595-609.
4. G. S. Brodal, R. B. Lyngso, C. N. S. Pederesen, and J. Stoye: Finding maximal pairs with bounded gap. Journal of Discrete Algorithms, 1 2000, pp. 77-103.
5. M. Burrows and D. J. Wheeler: A block sorting lossless data compression algorithm, Tech. Rep. 124, Digital Equipment Corporation, Palo Alto, California, 1994.
6. F. Franek, J. Simpson, and W. F. Smyth: The maximum number of runs in a string, in Proceedings of the 14th Australasian Workshop on Combinatorial Algorithms, M. Miller and K. Park, eds., Seoul, Korea, 2003, pp. 36-45.
7. F. Franek, W. F. Smyth, and Y. Tang: Computing all repeats using suffix arrays. Journal of Automata, Languages and Combinatorics, 8(4) 2003, pp. 579-591.
8. D. Gusfield: Algorithms on Strings, Trees, and Sequences: Computer Science and Computa-tional Biology, Cambridge University Press, Cambridge, United Kingdom, 1997.
9. J. Kaarkkaainen, and P. Sanders: Simple linear work suffix array construction, in Proceedings of the 30th International Colloquium Automata, Languages and Programming, vol. 2971 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 2003, pp. 943-955.
10. S. Karlin, G. Ghandour, F. Ost, S. Tavare, and L. J. Korn: New approaches for computer analysis of nucleic acid sequences. Proceedings of the National Academy of Science, 80(18) September 1983, pp. 5660-5664.
11. T. Kasai, G. Lee, H. Arimura, S. Arikawa, and K. Park: Linear-time longest-common-prefix computation in suffix arrays and its applications, in Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, A. Amir and G. M. Landau, eds., vol. 2089 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 2001, pp. 181-192.
12. P. Ko and S. Aluru: Space efficient linear time construction of suffix arrays, in Proceedings of the 14th Annual Symposium on Combinatorial Pattern Matching, R. Baeza-Yates, E. Ch́avez, and M. Crochemore, eds., vol. 2676 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 2003, pp. 200-210.
13. J. Larsson and A. Moffat: Off-line dictionary-based compression. Proceedings of the IEEE, 88(11) 2000, pp. 1722-1732.
14. M. A. Maniscalco and S. J. Puglisi: Faster lightweight suffix array construction, in Proceedings of 17th Australasian Workshop on Combinatorial Algorithms, J. Ryan and Dafik, eds., 2006, pp. 16-29.
15. G. Manzini: Two space saving tricks for linear time LCP computation, in Proceedings of 9th Scandinavian Workshop on Algorithm Theory (SWAT '04), T. Hagerup and J. Katajainen, eds., vol. 3111 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 2004, pp. 372-383.
16. G. Manzini and P. Ferragina: Engineering a lightweight suffix array construction algorithm. Algorithmica, 40 2004, pp. 33-50.
17. K. Narisawa, S. Inenaga, H. Bannai, and M. Takeda: Efficient computation of substring equivalence classes with suffix arrays, in Proceedings of the 18th Annual Symposium on Combinatorial Pattern Matching, B. Ma and K. Zhang, eds., vol. 4580 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 2007, pp. 340-351.
18. S. J. Puglisi, W. F. Smyth, and A. Turpin: A taxonomy of suffix array construction algorithms. ACM Computing Surveys, 39(2) 2007, pp. 1-31.
19. S. W. Shin and S. M. Kim: A new algorithm for detecting low-complexity regions in protein sequences. Bioinformatics, 21(2) 2005, pp. 160-170.
20. B. Smyth: Computing Patterns in Strings, Pearson Addison-Wesley, Essex, England, 2003.
21. A. Turpin and W. F. Smyth: An approach to phrase selection for offline data compression, in Proceedings of the 25th Australasian Computer Science Conference, M. Oudshoorn, ed., 2000, pp. 267-273.