The Performance of Linear Time Suffix Sorting Algorithms

Authors:
Simon J. Puglisi;William F. Smyth;Andrew Turpin
Affiliations:
Curtin University of Technology, Perth, Australia;McMaster University, Hamilton, Canada;University of Melbourne, Australia
Venue:
DCC '05 Proceedings of the Data Compression Conference
Year:
2005

Citing 0
Cited 13

Detecting higher-level similarity patterns in programs

Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering
Suffix arrays: what are they good for?

ADC '06 Proceedings of the 17th Australasian Database Conference - Volume 49
Linear work suffix array construction

Journal of the ACM (JACM)
A taxonomy of suffix array construction algorithms

ACM Computing Surveys (CSUR)
An efficient, versatile approach to suffix sorting

Journal of Experimental Algorithmics (JEA)
Scalable parallel suffix array construction

Parallel Computing
Efficient Algorithms for the Inverse Sort Transform

IEEE Transactions on Computers
Faster suffix sorting

Theoretical Computer Science
RadixZip: linear time compression of token streams

VLDB '07 Proceedings of the 33rd international conference on Very large data bases
The generalised k-Truncated Suffix Tree for time-and space-efficient searches in multiple DNA or protein sequences

International Journal of Bioinformatics Research and Applications
Computing the inverse sort transform in linear time

ACM Transactions on Algorithms (TALG)
Rapid parallel genome indexing with MapReduce

Proceedings of the second international workshop on MapReduce and its applications
Scalable parallel suffix array construction

EuroPVM/MPI'06 Proceedings of the 13th European PVM/MPI User's Group conference on Recent advances in parallel virtual machine and message passing interface

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sorting all the suffixes of a string x = x[1..n] into lexicographical order is the most computationally expensive step in the Burrows-Wheeler Transformation for lossless compression. One tool for achieving a suffix sort is the suffix array.Suffix arrays are also the basis for a variety of compressed text indexing systems that allow arbitrary queries, for example the scheme of Grossi and Vitter.