Fast algorithm for making suffix arrays and for burrows-wheeler transformation

Data Compression Conference Proceedings

Volumn , Issue , 1998, Pages 129-138

  Sadakane, Kunihiko ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMPRESSION; DATA STORAGE EQUIPMENT; DATA STRUCTURES; DATABASE SYSTEMS; MATHEMATICAL TRANSFORMATIONS; ONLINE SEARCHING; SORTING; TREES (MATHEMATICS);

AVERAGE MATCH LENGTH; BURROWS-WHEELER TRANSFORMATION; LEXICOGRAPHIC ORDER; SUFFIX ARRAY; SUFFIX TREE;

ALGORITHMS;

EID: 0031673367     PISSN: 10680314     EISSN: None     Source Type: None    
DOI: 10.1109/DCC.1998.672139     Document Type: Conference Paper

References (13)

1. A. Andersson S. Nilsson A New Efficient Radix Sort 35th Symp. on Foundations of Computer Science 714 721 35th Symp. on Foundations of Computer Science 1994
2. R. Arnold T. Bell A Corpus for the Evaluation of Lossless Compression Algorithms Data Compression Conference 201 210 Data Compression Conference 1997-March http://corpus.canterbury.ac.nz/
3. J. L. Bentley R. Sedgewick Fast algorithms for sorting and searching strings Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms 360 369 Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms 1997 http://www.cs.princeton.edu/~rs/strings/
4. M. Burrows D. J. Wheeler A block-sorting lossless data compression algorithms 1994 124
5. Calgary Text Compression Corpus
6. J. G. Cleary I. H. Witten Data compression using adaptive coding and partial string matching IEEE Trans. on Commun. COM-32 4 396 402 April 1984
7. F. Hongo H. Yokoo Block-Sorting Data Compression and KMR Algorithm 20th Symposium on Information Theory and Its Applications 673 676 20th Symposium on Information Theory and Its Applications 1997-December
8. R. M. Karp R. E. Miller A. L. Rosenberg Rapid identification of repeated patterns in strings, arrays and trees 4th ACM Symposium on Theory of Computing 125 136 4th ACM Symposium on Theory of Computing 1972
9. N. J. Larsson Extended application of suffix trees to data compression Data Compression Conference 190 199 Data Compression Conference 1996-April
10. U. Manber G. Myers Suffix arrays: A new method for on-line string searches Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms 319 327 Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms 1990
11. E. M. McCreight A space-economical suffix tree construction algorithm Journal of the ACM 23 12 262 272 1976
12. J. Seward 1996 bzip2 http://www.muraroa.demon.co.uk/
13. E. Ukkonen On-line construction of suffix trees Algorithmica 14 3 249 260 September 1995