On constructing suffix arrays in external memory

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

Volumn 1643, Issue , 1999, Pages 224-235

  Crauser, Andreas ^a   Ferragina, Paolo ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

EXTERNAL MEMORY; EXTERNAL MEMORY ALGORITHMS; FULL TEXT INDEXING; SEARCH OPERATIONS; SPACE EFFICIENCIES; TEXT COLLECTION; WORKING SPACE; WORST-CASE PERFORMANCE;

INDEXING (OF INFORMATION);

EID: 84958039005     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48481-7_20     Document Type: Conference Paper

References (24)

1. L. Arge, P. Ferragina, R. Grossi and J. S. Vitter. On sorting Strings in External Memory. In ACMSymp. on Theory of Computing, pp. 540-548, 1997.
2. R. Ahuja, K. Mehlhorn, J. B. Orlin and R. E. Tarjan. Faster Algorithms for the Shortest Path Problem. Journal of the ACM(2), pp. 213-223, 1990.
3. A. Andersson and S. Nilsson. Efficient implementation of Suffix Trees. Software Practice and Experience, 2(25): 129-141, 1995.
4. S. Burkhard, A. Crauser, P. Ferragina, H. Lenhof, E. Rivals and M. Vingron. q-gram based database searching using a suffix array (QUASAR). International Conference on Computational Molecular Biology, 1999.
5. D. R. Clark and J. I. Munro. Efficient Suffix Trees on Secondary Storage. In ACM-SIAM Symp. on Discrete Algorithms, pp.383-391, 1996.
6. A. Crauser, P. Ferragina and U. Meyer. Practical and Efficient Priority Queues for External Memory. Technical Report MPI, see WEB pages of the authors.
7. A. Crauser and K. Mehlhorn. LEDA-SM: A Library Prototype for Computing in Secondary Memory. Technical Report MPI, see WEB pages of the authors.
8. C. Faloutsos. Access Methods for text. ACMComputingSurveys, 17, pp.49-74, March 1985.
9. M. Farach. Optimal suffix tree construction with large alphabets. In IEEE Foundations of Computer Science, pp. 137-143, 1997.
10. M. Farach, P. Ferragina and S. Muthukrishnan. Overcoming the Memory Bottleneck in Suffix Tree Construction. In IEEE Foundations of Computer Science, 1998.
11. C.L. Feng. PAT-Tree-Based Keyword Extraction for Chinese Information Retrieval. ACM SIGIR,pp. 50-58, 1997.
12. P. Ferragina and R. Grossi. A Fully-Dynamic Data Structure for External Substring Search. In ACM Symp. Theory of Computing, pp. 693-702, 1995. Also Journal of the ACM (to appear).
13. G. H. Gonnet, R. A. Baeza-Yates and T. Snider. New indices for text:PAT trees and PAT arrays. In Information Retrieval - Data Structures and Algorithms, W.B. Frakes and R. BaezaYates Editors, pp. 66-82, Prentice-Hall, 1992.
14. D. E. Knuth. The Art of Computer Programming: Sorting and Searching. Vol. 3, Addison-Wesley Publishing Co. 1973.
15. S. Kurtz. Reducingthe Space Requirement of Suffix Trees. Technical Report98-03, University of Bielefeld, 1998.
16. U. Manber and G. Myers. Suffix arrays: a new method for on-line string searches. SIAM Journal of Computing 22, 5,pp. 935-948, 1993.
17. E. M. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM 23, 2,pp. 262-272, 1976.
18. G. Navarro, J.P. Kitajima, B.A. Ribeiro-Neto and N. Ziviani. Distributed Generation of Suffix Arrays. In Combinatorial Pattern Matching Conference, pp. 103-115, 1997.
19. S. Naher and K. Mehlhorn. LEDA: A Platform for Combinatorial and Geometric Computing. Communications of the ACM (38), 1995.
20. C. Ruemmler and J. Wilkes. An introduction to disk drive modeling. IEEE Computer, 27(3):17-29, 1994.
21. E. A. Shriver and J. S. Vitter. Algorithms for parallel memory I: two-level memories. Algo-rithmica, 12(2-3), pp. 110-147, 1994.
22. D. E. Vengroff and J. S. Vitter. I/O-efficient scientific computing using TPIE. In IEEE Symposium on Parallel and Distributed Computing, 1995.
23. J. Vitter. External memory algorithms. Invited Tutorial in 17th Ann. ACM Symp. onPrinciples of Database Systems (PODS '98), 1998. Also Invited Paper in European Symposium on Algorithms (ESA '98), 1998.
24. J. Zobel, A. Moffat and K. Ramamohanarao. Guidelines for presentation and comparison of indexing techniques. SIGMADRecord25, 3:10-15, 1996.