ACM Journal of Experimental Algorithmics · 2008 · 26 citations · 15 references
ComputingBioinformaticsComputer ScienceComputational BiologyData StructuresParallel ComputingData CompressionData Structure AlgorithmsExternal Memory AlgorithmsExternal Memory Data StructuresString AlgorithmsExternal Memory String AlgorithmsExternal Memory Suffix ArraysIndexesIndexing Data StructuresMain Memory OrganizationString Algorithms For BioinformaticsString Indexing
Suffix arrays are a simple and powerful data structure for text processing that can be used for full text indexes, data compression, and many other applications, in particular, in bioinformatics. However, so far, it has appeared prohibitive to build suffix arrays for huge inputs that do not fit into main memory. This paper presents design, analysis, implementation, and experimental evaluation of several new and improved algorithms for suffix array construction. The algorithms are asymptotically optimal in the worst case or on average. Our implementation can construct suffix arrays for inputs of up to 4-GB in hours on a low-cost machine. As a tool of possible independent interest, we present a systematic way to design, analyze, and implement pipelined algorithms.
15
A Block-sorting Lossless Data Compression Algorithm
Michael T. Burrows, D. J. Wheeler · 1994 · 2.4K citations
Suffix Arrays: A New Method for On-Line String Searches
Udi Manber, Gene Myers · SIAM Journal on Computing · 1993 · 2K citations
The input/output complexity of sorting and related problems
Alok Aggarwal · Communications of the ACM · 1988 · 1.2K citations · Full text
Linear work suffix array construction
Juha Kärkkäinen, Peter Sanders, Stefan Burkhardt · Journal of the ACM · 2006 · 401 citations