Compressed compact suffix arrays

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

Volumn 3109, Issue , 2004, Pages 420-433

  Mäkinen, Veli ^a   Navarro, Gonzalo ^b  

^a UNIVERSITY OF HELSINKI   (Finland)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

ECONOMIC AND SOCIAL EFFECTS; PATTERN MATCHING;

COMPRESSED SUFFIX ARRAY; FULL-TEXT INDEX; SEARCH SPEED; SELF-INDEX; SPACE EFFICIENT; SPACE USAGE; SPACE-TIME TRADE-OFFS; SUFFIX ARRAYS;

INDEXING (OF INFORMATION);

EID: 35048854569     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27801-6_32     Document Type: Article

References (20)

1. A. Brodnik and I. Munro. Membership in constant time and almost-minimum space. SIAM J. on Comp. 5:1627-1640, 1999.
2. M. Burrows and D. J. Wheeler. A block-sorting lossless data compression algorithm. DEC SRC Research Report 124, 1994.
3. D. Clark. Compact Pat Trees. PhD thesis, University of Waterloo, 1996.
4. M. Crochemore and Renaud Vérin. Direct Construction of Compact Directed Acyclic Word Graphs. In Proc. CPM'97, Springer-Verlag LNCS 1264, pp. 116-129, 1997.
5. P. Ferragina and G. Manzini. Opportunistic Data Structures with Applications. In Proc. IEEE Symp. on Foundations of Computer Science (FOCS'00), pp. 390-398, 2000.
6. P. Ferragina and G. Manzini. An Experimental Study of an Opportunistic Index. In Proc. 12th Symposium on Discrete Algorithms (SODA'01), pp. 269-278, 2001.
7. R. Giegerich, S. Kurtz, and J. Stoye. Efficient Implementation of Lazy Suffix Trees. In Proc. 3rd Workshop on Algorithmic Engineering (WAE'99), LNCS 1668, pp. 30-42, 1999.
8. R. Grossi and J. Vitter. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In Proc. 32nd Symposium on Theory of Computing (STOC'OO), pp. 397-406, 2000.
9. D. Harman. Overview of the Third Text REtrieval Conference. In Proc. TREC-3, pages 1-19, 1995. NIST Special Publication 500-207.
10. G. Jacobson. Succinct Static Data Structures. PhD thesis, CMU-CS-89-112, Carnegie Mellon University, 1989.
11. U. Manber and G. Myers. Suffix arrays: A new method for on-line string searches. SIAM J. Comput. 22, pp. 935-948, 1993.
12. G. Manzini. An Analysis of the Burrows-Wheeler Transform. J. of the ACM 48(3):407-430, 2001.
13. I. Munro. Tables. In Proc. FSTTCS'96, pp. 37-42, 1996.
14. V. Mäkinen. Compact Suffix Array - A Space-efficient Full-text Index. Fundamenta Informaticae 56(1-2), pp. 191-210, 2003.
15. V. Mäkinen and G. Navarro. New search algorithms and time/space trade offs for succinct suffix arrays. Technical report C-2004-20, Dept. of Computer Science, Univ. of Helsinki, April 2004.
16. G. Navarro. Indexing Text using the Ziv-Lempel Trie. In Proc. 9th String Processing and Information Retrieval (SPIRE'02), LNCS 2476, pp. 325-336, 2002.
17. Extended version to appear in J. of Discrete Algorithms.
18. G. Navarro. The LZ-index: A Text Index Based on the Ziv-Lempel Trie. Technical Report TR/DCC-2003-1, Dept. of Computer Science, Univ. of Chile, January 2003.
19. K. Sadakane. Compressed text databases with efficient query algorithms based on the compressed suffix array. In Proc. 11th Algorithms and Computation (ISAAC'00), LNCS 1969, pp. 410-421, 2000.
20. P. Weiner. Linear pattern matching algorithms. In Proc. IEEE 14th Annual Symposium on Switching and Automata Theory, pp. 1-11, 1973.