Succinct suffix arrays based on run-length encoding

Lecture Notes in Computer Science

Volumn 3537, Issue , 2005, Pages 45-56

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

^a BIELEFELD UNIVERSITY   (Germany)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

ENCODING (SYMBOLS); ENTROPY; INDEXING (OF INFORMATION); INFORMATION RETRIEVAL; SEARCH ENGINES;

ALPHABET; RUN-LENGTH ENCODING; SUCCINCT SUFFIX ARRAYS;

TEXT PROCESSING;

EID: 26444528435     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11496656_5     Document Type: Conference Paper

References (25)

1. M. Burrows and D. Wheeler. A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation, 1994.
2. D. Clark. Compact Pat Trees. PhD thesis, University of Waterloo, 1996.
3. P. Ferragina and G. Manzini. Opportunistic data structures with applications. In Proc. FOCS'00, pp. 390-398, 2000.
4. P. Ferragina and G. Manzini. An experimental study of an opportunistic index. In Proc. SODA'01, pp. 269-278, 2001.
5. P. Ferragina, G. Manzini, V. Mäkinen, and G. Navarro. An alphabet-friendly FM-index. In Proc. SPIRE'04, pp. 150-160, 2004.
6. P. Ferragina, G. Manzini, V. Mäkinen, and G. Navarro. Succinct representation of sequences. Technical Report TR/DCC-2004-5, Dept. of CS, Univ. Chile, Aug. 2004.
7. R. Gonzalez, Sz. Grabowski, V. Mäkinen, and G. Navarro. Practical implementation of rank and select queries. To appear in Proc. WEA'05 (poster).
8. R. Grossi, A. Gupta, and J. Vitter. High-order entropy-compressed text indexes. In Proc. SODA'03, pp. 841-850, 2003.
9. R. Grossi, A. Gupta, and J. Vitter. When indexing equals compression: Experiments with compressing suffix arrays and applications. In Proc. SODA '04, pp. 636-645, 2004.
10. R. Grossi and J.S. Vitter. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In Proc. STOC'00, pp. 397-406, 2000.
11. R. N. Horspool. Practical fast searching in strings. Softw. Pract. Exp., 10(6) :501-506, 1980.
12. G. Jacobson. Space-efficient static trees and graphs. In Proc. FOCS'89, pp. 549-554, 1989.
13. V. Mäkinen. Compact suffix array - a space-efficient full-text index. Fundamenta Informaticae, 56(1-2):191-210, 2003.
14. V. Mäkinen and G. Navarro. Compressed compact suffix arrays. In Proc. CPM'04, pp. 420-433, 2004.
15. V. Mäkinen and G. Navarro. Run-length FM-index. In Proc. DIMACS Workshop: "The Burrows-Wheeler Transform: Ten Years Later", pp. 17-19, Aug. 2004.
16. Also in New Search Algorithms and Time/Space Tradeoffs for Succinct Suffix Arrays, Tech. Report. C-2004-20, Univ. Helsinki, Apr. 2004.
17. U. Manber and G. Myers. Suffix arrays: a new method for on-line string searches. SIAM Journal on Computing, 22(5):935-948, 1993.
18. G. Manzini. An analysis of the Burrows-Wheeler transform. Journal of the ACM, 48(3):407-430, 2001.
19. I. Munro. Tables. In Proc. FSTTCS'96, pp. 37-42, 1996.
20. G. Navarro. Indexing text using the Ziv-Lempel trie. Journal of Discrete Algorithms, 2(1):87-114, 2004.
21. R. Pagh. Low redundancy in dictionaries with O(1) worst case lookup time. In Proc. ICALP'99, pp. 595-604, 1999.
22. R. Raman, V. Raman, and S. Srinivasa Rao. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In Proc. SODA '02, pp. 233-242, 2002.
23. K. Sadakane. Compressed text databases with efficient query algorithms based on the compressed suffix array. In Proc. ISAAC'00, pp. 410-421, 2000.
24. K. Sadakane. Succinct representations of lcp information and improvements in the compressed suffix arrays. In Proc. SODA '02, pp. 225-232, 2002.
25. P. Weiner. Linear pattern matching algorithm. In Proc. IEEE Symposium on Switching and Automata Theory, pages 1-11, 1973.