A Fast Algorithm for Making Suffix Arrays and for Burrows-Wheeler Transformation (1998)
| Venue: | IN PROCEEDINGS OF THE IEEE DATA COMPRESSION CONFERENCE, SNOWBIRD, UTAH, MARCH 30 - APRIL 1 |
| Citations: | 24 - 3 self |
BibTeX
@INPROCEEDINGS{Sadakane98afast,
author = {Kunihiko Sadakane},
title = {A Fast Algorithm for Making Suffix Arrays and for Burrows-Wheeler Transformation},
booktitle = {IN PROCEEDINGS OF THE IEEE DATA COMPRESSION CONFERENCE, SNOWBIRD, UTAH, MARCH 30 - APRIL 1},
year = {1998},
pages = {129--138},
publisher = {IEEE Computer Society Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We propose a fast and memory efficient algorithm for sorting suffixes of a text in lexicographic order. It is important to sort suffixes because an arrayof indexes of suffixes is called suffix array and it is a memory efficient alternative of the suffix tree. Sorting suffixes is also used for the Burrows-Wheeler transformation in the Block Sorting text compression, therefore fast sorting algorithms are desired. We compare
Citations
| 560 | G: Suffix arrays: a new method for on-line string searches - Manber, Myers - 1993 |
| 493 | A space-economical suffix tree construction algorithm - MCCREIGHT - 1976 |
| 461 | D: A block-sorting lossless data compression algorithm - Burrows, Wheeler - 1994 |
| 289 | Data compression using adaptive coding and partial string matching - Cleary, Witten - 1984 |
| 269 | On-line construction of suffix trees - Ukkonen - 1995 |
| 131 | Fast algorithms for sorting and searching strings - BENTLEY, R - 1997 |
| 64 | Rapid identification of repeated patterns in strings, trees and arrays - Karp, Miller, et al. - 1972 |
| 46 | A Corpus for the Evaluation of Lossless Compression Algorithms - Arnold, Bell - 1997 |
| 35 | Extended application of suffix trees to data compression - Larsson |
| 29 | A new efficient radix sort - Andersson, Nilsson - 1994 |
| 4 | Block-Sorting Data Compression and KMR Algorithm - Hongo, Yokoo - 1997 |
