Linear suffix array construction by almost pure induced-sorting

Proceedings - 2009 Data Compression Conference, DCC 2009

Volumn , Issue , 2009, Pages 193-202

  Nong, Ge ^a   Zhang, Sen ^b   Chan, Wai Hong ^c  

^a SUN YAT SEN UNIVERSITY   (China)

^b STATE UNIVERSITY OF NEW YORK   (United States)

^c HONG KONG BAPTIST UNIVERSITY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

C CODES; CONSTRUCTION ALGORITHMS; LINEAR TIME; LINEAR-TIME ALGORITHMS; PROBLEM REDUCTION; SUB-STRINGS; SUFFIX ARRAYS; TIME AND SPACE;

ALGORITHMS; INDEXING (OF INFORMATION); MICROWAVE ANTENNAS; SIMULATED ANNEALING; SORTING;

DATA COMPRESSION;

EID: 67650683413     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.2009.42     Document Type: Conference Paper

References (7)

1. Y.-F. Chien, W.-K. Hon, R. Shah, and J. S. Vitter. Geometric burrows-wheeler transform: Linking range searching and text indexing. In Proceedings DCC 2008 Data Compression Conference, pages 252-261, Snowbird, UT, USA, March 2008.
2. R. Grossi and J. S. Vitter. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In Proceedings of STOC'00, pages 397-406, 2000.
3. J. Kärkkäinen, P. Sanders, and S. Burkhardt. Linear work suffix array construction. Journal of the ACM, (6):918-936, November 2006.
4. P. Ko and S. Aluru. Space efficient linear time construction of suffix arrays. In Proceedings 14th CPM, LNCS 2676, Springer-Verlag, pages 200-210, 2003.
5. U. Manber and G. Myers. Suffix arrays: A new method for on-line string searches. In Proceedings of the first ACM-SIAM SODA, pages 319-327, 1990.
6. G. Manzini and P. Ferragina. Engineering a lightweight suffix array construction algorithm. Algorithmica, 40(1):33-50, September 2004.
7. S. Zhang and G. Nong. Fast and space efficient linear suffix array construction. In Proceedings DCC 2008 Data Compression Conference, page 553, Snowbird, UT, USA, March 2008.