|
Abstract:
|
Burrows-Wheeler transformation has been used in many fields such as lossless data compression, search in text and read alignments in genome sequencing. Particularly both Burrows-Wheeler transformation and its inversion are important in lossless data compression. There are many efficient inversion algorithms available, however, all of them recovers the original text one by one from the end to obtain better efficiency in both time and working memory. We present new algorithms which recovers the original text from the beginning with high efficiency either in time or in working memory space. Performances of proposed algorithms are compared to other known efficient algorithms with public corpus.
|
