Suffix arrays: what are they good for?

Authors:
Simon J. Puglisi;William F. Smyth;Andrew Turpin
Affiliations:
Dept. of Computing, Curtin University of Technology, Perth, Australia;McMaster University, Hamilton, Canada and Curtin University of Technology, Perth, Australia;Dept. of Computer Science & IT, RMIT University, Melbourne, Australia
Venue:
ADC '06 Proceedings of the 17th Australasian Database Conference - Volume 49
Year:
2006

Citing 13
Cited 0

Suffix arrays: a new method for on-line string searches

SIAM Journal on Computing
Suffix arrays: a new method for on-line string searches

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Managing gigabytes (2nd ed.): compressing and indexing documents and images

Managing gigabytes (2nd ed.): compressing and indexing documents and images
A fast string searching algorithm

Communications of the ACM
An experimental study of an opportunistic index

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Succinct representations of lcp information and improvements in the compressed suffix arrays

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Opportunistic data structures with applications

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
When indexing equals compression: experiments with compressing suffix arrays and applications

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Replacing suffix trees with enhanced suffix arrays

Journal of Discrete Algorithms - SPIRE 2002
Indexing text using the Ziv-Lempel trie

Journal of Discrete Algorithms - SPIRE 2002
The Performance of Linear Time Suffix Sorting Algorithms

DCC '05 Proceedings of the Data Compression Conference
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching

SIAM Journal on Computing
Succinct suffix arrays based on run-length encoding

Nordic Journal of Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently the theoretical community has displayed a flurry of interest in suffix arrays, and compressed suffix arrays. New, asymptotically optimal algorithms for construction, search, and compression of suffix arrays have been proposed. In this talk we will present our investigations into the practicalities of these latest developments. In particular, we investigate whether suffix arrays can indeed replace inverted files, as suggested in recent literature on suffix arrays.