Abstract
Burrows-Wheeler Transform (BWT) is a new data transform method, firstly introduced by Burrows and Wheeler in 1994 and used in a lossless data compression algorithm. In the original version of data compression algorithm based on BWT, Burrows and Wheeler used the Move-To-Front (MTF) transform after the BWT and entropy coding (Huffman coding) for encoding the transform result in the last stage. Ferragina and Manzini combined the compression algorithm based on BWT and the suffix array data structure, and proposed a new opportunistic data structure. They shortly called it FM-index in that it is a Full-text index and occupies Minute space. This paper mainly describes the methods about compression and index based on BWT, and relationship between them. At last, the paper compares some tools.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
