On-line construction of compact suffix vectors and maximal repeats

Theoretical Computer Science

Volumn 407, Issue 1-3, 2008, Pages 290-301

  Prieur, Élise ^a   Lecroq, Thierry ^a  

^a UNIVERSITÉ DE ROUEN   (France)

Author keywords

Compact suffix automata; Design of analysis; Maximal repeats; Suffix trees; Suffix vectors

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTER SCIENCE; COMPUTERS; CURVE FITTING; DATA STRUCTURES; FILE ORGANIZATION; MATHEMATICAL TRANSFORMATIONS; POWDERS; TIMING CIRCUITS; TREES (MATHEMATICS);

COMPACT SUFFIX AUTOMATA; DESIGN OF ANALYSIS; MAXIMAL REPEATS; SUFFIX TREES; SUFFIX VECTORS;

VECTORS;

EID: 53249113156     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.06.017     Document Type: Article

References (19)

1. Abouelhoda M., Kurtz S., and Ohlebusch E. Replacing suffix trees with enhanced suffix arrays. Journal of Discrete Algorithms 2 1 (2004) 53-86
2. Apostolico A. The myriad virtues of suffix trees. In: Apostolico A., and Galil Z. (Eds). Combinatorial Algorithms on Words. NATO Advanced Science Institutes, Series F vol. 12 (1985), Springer-Verlag, Berlin 85-96
3. Arroyuelo D., and Navarro G. Space-efficient construction of LZ-index. In: Deng X., and Du D.-Z. (Eds). Proceedings of the 16th International Symposium on Algorithms and Computation. Lecture Notes in Computer Science vol. 3827 (2005), Springer-Verlag, Berlin 1143-1152 Sanya, Hainan, China
4. Clifford R., and Sergot M. Distributed and paged suffix trees for large genetic databases. In: Baeza-Yates R.A., Chávez E., and Crochemore M. (Eds). Proceedings of the 14th Annual Symposium on Combinatorial Pattern Matching. Lecture Notes in Computer Science vol. 2676 (2003), Springer-Verlag, Berlin 70-82 Morelia, Michocán, Mexico
5. Crochemore M., and Vérin R. Direct construction of compact directed acyclic word graphs. In: Apostolico A., and Hein J. (Eds). Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching. Lecture Notes in Computer Science vol. 1264 (1997), Springer-Verlag, Berlin 116-129 Aarhus, Denmark
6. M. Farach, Optimal suffix tree construction with large alphabets, in: Proceedings of the 38th IEEE Annual Symposium on Foundations of Computer Science, Miami Beach, FL, 1997, pp 137-143
7. Gusfield D. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology (1997), Cambridge University Press
8. Holub J., and Crochemore M. On the implementation of compact DAWG's. In: Champarnaud J.-M., and Maurel D. (Eds). Proceedings of the 7th International Conference on Implementation and Application of Automata 2002. Lecture Notes in Computer Science vol. 2608 (2003), Springer-Verlag, Berlin 289-294 Tours, France
9. Inenaga S., and Takeda M. On-line linear-time construction of word suffix trees. In: Lewenstein M., and Valiente G. (Eds). Proceedings of the 17th Annual Symposium on Combinatorial Pattern Matching. Lecture Notes in Computer Science vol. 4009 (2006), Springer-Verlag, Berlin 60-71 Barcelona, Spain
10. Kurtz S. Reducing the space requirements of suffix trees. Software - Practice & Experience 29 13 (1999)
11. McCreight E.M. A space-economical suffix tree construction algorithm. Journal of Algorithms 23 2 (1976) 262-272
12. K. Monostori, Efficient computational approach to identifying overlapping documents in large digital collections, Ph.D. Thesis, Monash University, 2002
13. Monostori K., Zaslavsky A., and Schmidt H. Suffix vector: Space-and-time-efficient alternative to suffix trees. CRPITS'02: Proceedings of the 25th Australasian Computer Science Conference vol. 4 (2002), Australian Computer Society, Inc., Darlinghurst, Australia 157-166
14. Monostori K., Zaslavsky A., and Vajk I. Suffix vector: A space-efficient suffix tree representation. In: Eades P., and Takaoka T. (Eds). Proceedings of the 12th International Symposium on Algorithms and Computation. Lecture Notes in Computer Science vol. 2223 (2001), Springer-Verlag, Berlin 707-718 Christchurch, New Zealand
15. Ian Munro J., Raman V., and Srinivasa Rao S. Space efficient suffix trees. In: Arvind V., and Ramanujam R. (Eds). Proceedings of the Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science vol. 1530 (1998), Springer-Verlag, Berlin 186-196 Chennai, India
16. Prieur É., and Lecroq T. From suffix trees to suffix vectors. International Journal of Foundations of Computer Science 17 6 (2006) 1385-1402
17. Raffinot M. On maximal repeats in strings. Information Processing Letters 80 3 (2001) 165-169
18. Ukkonen E. On-line construction of suffix trees. Algorithmica 14 3 (1995) 249-260
19. P. Weiner, Linear pattern matching algorithm, in: Proceedings of the 14th Annual IEEE Symposium on Switching and Automata Theory, Washington, DC, 1973, pp. 1-11