IEEE - Institute of Electrical and Electronics Engineers, Inc. - A modified Burrows-Wheeler transformation for case-insensitive search with application to suffix array compression

Proceedings of Conference on Data Compression (DCC'99)

Author(s): Sadakane, K.
Publisher: IEEE - Institute of Electrical and Electronics Engineers, Inc.
Publication Date: 1 January 1999
Conference Location: Snowbird, UT, USA, USA
Conference Date: 29 March 1999
ISBN (Paper): 0-7695-0096-X
ISSN (Paper): 1068-0314
DOI: 10.1109/DCC.1999.785705
Regular:

Summary form only given. The suffix array is a memory-efficient data structure for searching any substring of a text. It is also used for defining the Burrows-Wheeler transformation (BWT), which... View More

Advertisement