Compressed suffix trees with full functionality

Theory of Computing Systems

Volumn 41, Issue 4, 2007, Pages 589-607

  Sadakane, Kunihiko ^a  

^a KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPRESSED SUFFIX TREES; LOWEST COMMON ANCESTORS; ON CURRENTS; SUFFIX LINK; SUFFIX-TREES;

DATA STRUCTURES; TREES (MATHEMATICS);

FORESTRY;

EID: 34250183733     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-006-1198-x     Document Type: Article

References (28)

1. P. Beame and F. E. Fich. Optimal Bounds for the Predecessor Problem. In Proc. ACM STOC, pages 295-304, 1999.
2. M. Bender and M. Farach-Colton. The LCA Problem Revisited. In Proc. LATIN 2000, pages 88-94. LNCS 1776. Springer, Berlin, 2000.
3. D. R. Clark and J. I. Munro. Efficient Suffix Trees on Secondary Storage. In Proc. 7th Annual ACM-SIAM Symp. on Discrete Algorithms, pages 383-391, 1996.
4. P. Elias. Efficient storage and retrieval by content and address of static files. Journal of the ACM, 21(2):246-260, 1974.
5. M. Farach. Optimal Suffix Tree Construction with Large Alphabets. In Proc. 38/A IEEE Symp. on Foundations of Computer Science, pages 137-143, 1997.
6. P. Ferragina and G. Manzini. Opportunistic Data Structures with Applications. In Proc. 41st IEEE Symp. on Foundations of Computer Science, pages 390-398, 2000.
7. P. Ferragina and G. Manzini. An Experimental Study of an Opportunistic Index. In Proc. ACM-SIAM SODA, pages 269-278, 2001.
8. P. Ferragina and G. Manzini. On Compressing and Indexing Data. Technical Report TR-02-01, Dipartimento di Informatica, Universita di Pisa, 2002.
9. G. H. Gonnet, R. Baeza-Yates, and T. Snider. New Indices for Text: PAT Trees and PAT Arrays. In W. Frakes and R. Baeza-Yates, editors, Information Retrieval: Algorithms and Data Structures, chapter 5, pages 66-82. Prentice-Hall, Englewood Cliffs, NJ, 1992.
10. R. Grossi, A. Gupta, and J. S. Vitter. Higher Order Entropy Analysis of Compressed Suffix Arrays. In Proc. DIMACS Workshop on Data Compression in Networks and Applications, pages 841-850, March 2003.
11. R. Grossi and J. S. Vitter. Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching. In Proc. 32nd ACM Symp. on Theory of Computing, pages 397-406, 2000.
12. R. Grossi and J. S. Vitter. Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching, 2001. Submitted for publication.
13. D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge, 1997.
14. T. Hagerup. Sorting and Searching on the Word RAM. In Proc. STACS, pages 366-398, 1998.
15. W. K. Hon, T. W. Lam, K. Sadakane, and W. K. Sung. Constructing Compressed Suffix Arrays with Large Alphabets. In Proc. ISAAC, pages 240-249. LNCS 2906. Springer, Berlin, 2003.
16. W. K. Hon, K. Sadakane, and W. K. Sung. Breaking a Time-and-Space Barrier in Constructing Full-Text Indices. In Proc. IEEE FOCS, pages 251-260, 2003.
17. T. Kasai, G. Lee, H. Arimura, S. Arikawa, and K. Park. Linear-time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications. In Proc. 12th Annual Symp. on Combinatorial Pattern Matching (CPM '01), pages 181-192. LNCS 2089. Springer, Berlin, 2001.
18. S. Kurtz. Reducing the Space Requirement of Suffix Trees. Software-Practice and Experience, 29(13):1149-1171, 1999.
19. T. W. Lam, K. Sadakane, W. K Sung, and S. M Yiu. A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays. In Proc. COCOON, pages 401-410. LNCS 2387. Springer, Berlin, 2002.
20. U. Manber and G. Myers. Suffix arrays: A New Method for On-Line String Searches. SIAM Journal on Computing, 22(5):935-948, October 1993.
21. E. M. McCreight. A Space-economical Suffix Tree Construction Algorithm.. Journal of the ACM, 23(12):262-272, 1976.
22. J. I. Munro. Tables. In Proc. 16th Conf. on Foundations of Software Technology and Computer Science (FSTTCS '96), pages 37-42. LNCS 1180. Springer, Berlin, 1996.
23. J. I. Munro and V. Raman. Succinct Representation of Balanced Parentheses and Static Trees. SIAM Journal on Computing, 31(3):762-776, 2001.
24. J. I. Munro, V. Raman, and S. Srinivasa Rao. Space Efficient Suffix Trees. Journal of Algorithms, 39(2):205-222, May 2001.
25. K. Sadakane. New Text Indexing Functionalities of the Compressed Suffix Arrays. Journal of Algorithms, 48(2):294-313, 2003.
26. S. Shimozono, H. Arimura, and S. Arikawa. Efficient Discovery of Optimal Word-Association Patterns in Large Text Databases. New Generation Computing, 18:49-60, 2000.
27. E. Ukkonen. On-line Construction of Suffix Trees. Algorithmica, 14(3):249-260, September 1995.
28. P. Weiner. Linear Pattern Matching Algorihms. In Proc. 14th IEEE Symp. on Switching and Automata Theory, pages 1-11, 1973.