On Constructing Suffix Arrays in External Memory
- 1 January 1999
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 224-235
- https://doi.org/10.1007/3-540-48481-7_20
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Optimal suffix tree construction with large alphabetsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- q -gram based database searching using a suffix array (QUASAR)Published by Association for Computing Machinery (ACM) ,1999
- Overcoming the memory bottleneck in suffix tree constructionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1998
- Distributed generation of suffix arraysLecture Notes in Computer Science, 1997
- Efficient implementation of suffix treesSoftware: Practice and Experience, 1995
- A fully-dynamic data structure for external substring searchPublished by Association for Computing Machinery (ACM) ,1995
- Suffix Arrays: A New Method for On-Line String SearchesSIAM Journal on Computing, 1993
- Faster algorithms for the shortest path problemJournal of the ACM, 1990
- Access methods for textACM Computing Surveys, 1985
- A Space-Economical Suffix Tree Construction AlgorithmJournal of the ACM, 1976