Advantages of backward searching - Efficient secondary memory and distributed implementation of compressed suffix arrays

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

Volumn 3341, Issue , 2004, Pages 681-692

  Mäkinen, Veli ^a   Navarro, Gonzalo ^b   Sadakane, Kunihiko ^c  

^a UNIVERSITY OF HELSINKI   (Finland)

^b UNIVERSITY OF CHILE   (Chile)

^c KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ACCESS PATTERNS; ALPHABET SIZE; BINARY SEARCH; COMPRESSED SUFFIX ARRAY; DISTRIBUTED IMPLEMENTATION; SECONDARY MEMORY; SUB-STRINGS; SUCCINCT SUFFIX ARRAYS; ZERO-ORDER ENTROPY; LINEAR STRUCTURES; ORIGINAL STRUCTURES;

INDEXING (OF INFORMATION);

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EID: 35048898345     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30551-4_59     Document Type: Article

References (27)

1. V. L. Arlazarov, E. A. Dinic, M. A. Kronrod, and I. A. Faradzev. On economic construction of the transitive closure of a directed graph. Dokl. Acad. Nauk. SSSR 194, 487-488, 1970 (in Russian).
2. English translation in Soviet Math. Dokl. 11, 1209-1210, 1975.
3. D. Clark. Compact Pat Trees. PhD thesis, University of Waterloo, 1996.
4. P. Ferragina and G. Manzini. Opportunistic data structures with applications. In Proc. FOCS'00, pp. 390-398, 2000.
5. P. Ferragina, G. Manzini, V. Mäkinen, and G. Navarro. An Alphabet-Friendly FM-index. To appear in llth Symposium on String Processing and Information Retrieval (SPIRE 2004), Padova, Italy, October 5-8, 2004.
6. R. Grossi, A. Gupta, and J. Vitter. High-order entropy-compressed text indexes. In Proc. SODA'03, pp. 841-850, 2003.
7. 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.
8. R. Grossi and J. Vitter. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In Proc. STOC'OO, pp. 397-406, 2000.
9. G. Jacobson. Succinct Static Data Structures. PhD thesis, CMU-CS-89-112, Carnegie Mellon University, 1989.
10. J. Kärkkäinen. Repetition-Based Text Indexes, PhD Thesis, Report A-1999-4, Department of Computer Science, University of Helsinki, Finland, 1999.
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. E. M. McCreight. A space economical suffix tree construction algorithm. J. of the ACM, 23, pp. 262-272, 1976.
14. I. Munro. Tables. In Proc. FSTTCS'96, pp. 37-42, 1996.
15. V. Mäkinen. Compact Suffix Array -A space-efficient full-text index. Fundamenta Informaticae 56(1-2), pp. 191-210, 2003.
16. V. Mäkinen and G. Navarro. New search algorithms and space/time tradeoffs for succinct suffix arrays. Technical report, C-2004-20, Dept. CS, Univ. Helsinki, April 2004. [http://www.cs.helsinki.fi/u/vmakinen/papers/ ssa_tech_2004.ps.gz]
17. V. Mäkinen and G. Navarro. Compressed compact suffix arrays. In Proc. CPM'04, LNCS 3109, pp. 420-433, 2004.
18. M. Marín and G. Navarro. Distributed query processing using suffix arrays. In Proc. SPIRE'03, pages 311-325, LNCS 2857, 2003.
19. G. Navarro. Indexing text using the Ziv-Lempel trie. J. of Discrete Algorithms 2(1):87-114, 2004.
20. K. Sadakane. Compressed text databases with efficient query algorithms based on the compressed suffix array. In Proc. ISAAC'00, LNCS 1969, pp. 410-421, 2000.
21. K. Sadakane. Succinct representations of Icp information and improvements in the compressed suffix arrays. In Proc. SODA 2002, ACM-SIAM, pp. 225-232, 2002.
22. K. Sadakane. Constructing compressed suffix arrays with large alphabets. In Proc. ISAAC'03, LNCS 2906, pp. 240-249, 2003.
23. S. Srinivasa Rao. Time-space trade-offs for compressed suffix arrays. Inf. Proc. Lett., 82 (6), pp. 307-311, 2002.
24. E. Ukkonen. On-line construction of suffix-trees. Algorithmica, 14, pp. 249-260, 1995.
25. L. Valiant. A bridging model for parallel computation. Comm. ACM, 33:103-111, Aug. 1990.
26. P. Weiner. Linear pattern matching algorithms. In Proc. IEEE 14th Ann. Symp. on Switching and Automata Theory, pp. 1-11, 1973.
27. I. Witten, A. Moffat, and T. Bell. Managing Gigabytes. Morgan Kaufmann Publishers, New York, second edition, 1999.